On the public citation graph
Efficient cryptographic schemes provably as secure as subset sum
0 signed · 204 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16486-3_89openalex-snapshot
One-way functions and circuit complexity
inferredcites →https://doi.org/10.1007/3-540-46416-6_4openalex-snapshot
An Improved Low-Density Subset Sum Algorithm
inferredcites →https://doi.org/10.1007/3-540-48071-4_14openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions
inferredcites →https://doi.org/10.1007/3-540-49264-x_1openalex-snapshot
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
inferredcites →https://doi.org/10.1007/3-540-54458-5_70openalex-snapshot
Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_2openalex-snapshot
Solving Low Density Knapsacks
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf00196909openalex-snapshot
Efficient, perfect polynomial random number generators
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1016/0020-0190(87)90036-6openalex-snapshot
Random oracles separate PSPACE from the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1090/psapm/042openalex-snapshot
Cryptology and Computational Number Theory
inferredcites →https://doi.org/10.1109/18.21214openalex-snapshot
A knapsack-type public key cryptosystem based on arithmetic in finite fields
inferredcites →https://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
inferredcites →https://doi.org/10.1109/sfcs.1979.3openalex-snapshot
A TcS2 = 0 (2n) time/space tradeoff for certain NP-complete problems
inferredcites →https://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1984.715945openalex-snapshot
Generating Quasi-Random Sequences From Slightly-Random Sources
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1109/sfcs.1988.21917openalex-snapshot
On the existence of pseudorandom generators
inferredcites →https://doi.org/10.1109/tit.1978.1055927openalex-snapshot
Hiding information and signatures in trapdoor knapsacks
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0215025openalex-snapshot
A Simple Unpredictable Pseudo-Random Number Generator
inferredcites →https://doi.org/10.1137/0215038openalex-snapshot
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1137/0218037openalex-snapshot
Succinct Certificates for Almost All Subset Sum Problems
inferredcites →https://doi.org/10.1137/0220072openalex-snapshot
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/100216.100270openalex-snapshot
Pseudo-random generators under uniform assumptions
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/130385.130388openalex-snapshot
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
inferredcites →https://doi.org/10.1145/167088.167197openalex-snapshot
Cryptographic hardness of distribution-specific learning
inferredcites →https://doi.org/10.1145/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4536622openalex-extracted
Self-Masking for Hardening Inversions1
inferred← citeshttps://doi.org/10.1006/ffta.2000.0321openalex-snapshot
On the Distribution of the Diffie–Hellman Pairs
inferred← citeshttps://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferred← citeshttps://doi.org/10.1007/0-387-23483-7_447openalex-snapshot
Universal One-Way Hash Functions
inferred← citeshttps://doi.org/10.1007/11426639_16openalex-snapshot
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.1007/11538462_32openalex-snapshot
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/11683858_7openalex-snapshot
Quantum Computational Cryptography
inferred← citeshttps://doi.org/10.1007/11745853_11openalex-snapshot
Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption
inferred← citeshttps://doi.org/10.1007/11761679_8openalex-snapshot
QUAD: A Practical Stream Cipher with Provable Security
inferred← citeshttps://doi.org/10.1007/11935230_13openalex-snapshot
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_29openalex-snapshot
An Improved Pseudo-random Generator Based on Discrete Log
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_24openalex-snapshot
On Pseudorandom Generators in NC0
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_26openalex-snapshot
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_5openalex-snapshot
Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_26openalex-snapshot
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_18openalex-snapshot
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ’97
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_3openalex-snapshot
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_8openalex-snapshot
The State of Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_8openalex-snapshot
Super-bits, demi-bits, and NP/qpoly-natural proofs
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_13openalex-snapshot
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_624openalex-snapshot
Universal One-Way Hash Functions (UOWHF)
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_4openalex-snapshot
Low Weight Discrete Logarithm and Subset Sum in $$2^{0.65n}$$ with Polynomial Memory
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_14openalex-snapshot
Cryptographic Group Actions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_624openalex-snapshot
Universal One-Way Hash Functions (UOWHF)
inferred← citeshttps://doi.org/10.1007/978-3-030-80821-1_10openalex-snapshot
Genetic Algorithm-Based Pseudo Random Number Generation for Cloud Security
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_17openalex-snapshot
On Treewidth, Separators and Yao’s Garbling
inferred← citeshttps://doi.org/10.1007/978-3-030-90567-5_4openalex-snapshot
Small Superset and Big Subset Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-031-13150-9_32openalex-snapshot
Design and Implementation of Secure Location Service Using Software Engineering Approach in the Age of Industry 4.0
inferred← citeshttps://doi.org/10.1007/978-3-031-15255-9_9openalex-snapshot
Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-21017-4_22openalex-snapshot
Brief Announcement: Self Masking for Hardening Inversions
inferred← citeshttps://doi.org/10.1007/978-3-031-21229-1_39openalex-snapshot
Bottom-Up Trust Registry in Self Sovereign Identity
inferred← citeshttps://doi.org/10.1007/978-3-031-22966-4_13openalex-snapshot
Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection
inferred← citeshttps://doi.org/10.1007/978-3-031-34671-2_6openalex-snapshot
Single Instance Self–masking via Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-50594-2_10openalex-snapshot
Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-54773-7_3openalex-snapshot
Efficient Quantum-Safe Distributed PRF and Applications: Playing DiSE in a Quantum World
inferred← citeshttps://doi.org/10.1007/978-3-031-76934-4_23openalex-snapshot
Post Quantum Lightweight OWF Candidates
inferred← citeshttps://doi.org/10.1007/978-3-031-78679-2_10openalex-snapshot
Subset-Optimized BLS Multi-signature with Key Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_18openalex-snapshot
A Survey of Hard Core Functions
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_24openalex-snapshot
Distribution of Modular Sums and the Security of the Server Aided Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-319-11659-4_1openalex-snapshot
Sealing the Leak on Classical NTRU Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-28475-0_8openalex-snapshot
Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_4openalex-snapshot
Naor-Yung Paradigm with Shared Randomness and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_7openalex-snapshot
Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_14openalex-snapshot
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_25openalex-snapshot
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_42openalex-snapshot
How to Protect Yourself without Perfect Shredding
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_28openalex-snapshot
An Improved Multi-set Algorithm for the Dense Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_18openalex-snapshot
Secure Arithmetic Computation with No Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_2openalex-snapshot
Public-Key Cryptosystems Resilient to Key Leakage
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_23openalex-snapshot
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_12openalex-snapshot
New Generic Algorithms for Hard Knapsacks
inferred← citeshttps://doi.org/10.1007/978-3-642-13858-4_9openalex-snapshot
Domain Extension for Enhanced Target Collision-Resistant Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7openalex-snapshot
Cryptography in Constant Parallel Time
inferred← citeshttps://doi.org/10.1007/978-3-642-17367-7_8openalex-snapshot
Cryptography with Constant Input Locality
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_11openalex-snapshot
Semi-homomorphic Encryption and Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-21702-9_11openalex-snapshot
Cryptanalysis of the Knapsack Generator
inferred← citeshttps://doi.org/10.1007/978-3-642-22497-3_10openalex-snapshot
Faster and Smoother – VSH Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_26openalex-snapshot
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-23141-4_11openalex-snapshot
2SC: An Efficient Code-Based Stream Cipher
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_624-2openalex-snapshot
Universal One-Way Hash Functions (UOWHF)
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_43openalex-snapshot
Lattice Signatures without Trapdoors
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_20openalex-snapshot
Circular and KDM Security for Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_7openalex-snapshot
Improving the Performance of the SYND Stream Cipher
inferred← citeshttps://doi.org/10.1007/978-3-642-36362-7_19openalex-snapshot
Tighter Reductions for Forward-Secure Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_48openalex-snapshot
Outsourced Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_11openalex-snapshot
Efficient Multiparty Protocols via Log-Depth Threshold Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_23openalex-snapshot
Solving Random Subset Sum Problem by l p -norm SVP Oracle
inferred← citeshttps://doi.org/10.1007/978-3-642-56046-0_6openalex-snapshot
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_26openalex-snapshot
Provable Second Preimage Resistance Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-49384-7_2openalex-snapshot
Chosen-Ciphertext Security from Subset Sum
inferred← citeshttps://doi.org/10.1007/bfb0029948openalex-snapshot
Positive applications of lattices to cryptography
inferred← citeshttps://doi.org/10.1007/bfb0052224openalex-snapshot
The complexity of computing hard core predicates
inferred← citeshttps://doi.org/10.1007/bfb0052227openalex-snapshot
On the foundations of modern cryptography
inferred← citeshttps://doi.org/10.1007/bfb0052256openalex-snapshot
Collision-Resistant hashing: Towards making UOWHFs practical
inferred← citeshttps://doi.org/10.1007/bfb0054129openalex-snapshot
Speeding up discrete log and factoring based schemes via precomputations
inferred← citeshttps://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferred← citeshttps://doi.org/10.1007/s00145-004-0215-yopenalex-snapshot
An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/s00145-009-9039-0openalex-snapshot
Cryptography with Constant Input Locality
inferred← citeshttps://doi.org/10.1007/s00145-011-9103-4openalex-snapshot
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.1007/s00145-017-9270-zopenalex-snapshot
Asymptotically Efficient Lattice-Based Digital Signatures
inferred← citeshttps://doi.org/10.1007/s00145-021-09395-yopenalex-snapshot
Multiparty Generation of an RSA Modulus
inferred← citeshttps://doi.org/10.1007/s00145-023-09484-0openalex-snapshot
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
inferred← citeshttps://doi.org/10.1007/s001459900037openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
inferred← citeshttps://doi.org/10.1007/s001459900043openalex-snapshot
An Efficient Existentially Unforgeable Signature Scheme and Its Applications
inferred← citeshttps://doi.org/10.1007/s00200-017-0323-1openalex-snapshot
A pseudorandom number generator based on worst-case lattice problems
inferred← citeshttps://doi.org/10.1007/s10207-017-0374-0openalex-snapshot
Outsourced pattern matching
inferred← citeshttps://doi.org/10.1007/s10623-009-9329-4openalex-snapshot
More efficient DDH pseudorandom generators
inferred← citeshttps://doi.org/10.1007/s10623-011-9527-8openalex-snapshot
A low-memory algorithm for finding short product representations in finite groups
inferred← citeshttps://doi.org/10.1007/s10623-023-01209-5openalex-snapshot
Fixed points of the subset sum pseudorandom number generators
inferred← citeshttps://doi.org/10.1016/j.ins.2018.04.021openalex-snapshot
Improved broadcast attacks against subset sum problems via lattice oracle
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.01.005openalex-snapshot
Scheduling lower bounds via AND subset sum
inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102782openalex-snapshot
A comprehensive review on collision-resistant hash functions on lattices
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.10.004openalex-snapshot
QUAD: A multivariate stream cipher with provable security
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.019openalex-snapshot
Naor–Yung paradigm with shared randomness and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.015openalex-snapshot
Tightly secure signature schemes from the LWE and subset sum assumptions
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115094openalex-snapshot
Self-masking for hardening inversions
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01274-6openalex-snapshot
On the uniformity of distribution of the RSA pairs
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.64openalex-snapshot
Classification of Hash Functions Suitable for Real-Life Systems
inferred← citeshttps://doi.org/10.1103/prxquantum.2.020319openalex-snapshot
Number Partitioning With Grover’s Algorithm in Central Spin Systems
inferred← citeshttps://doi.org/10.1109/49.839932openalex-snapshot
Certificate revocation and certificate update
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214410openalex-snapshot
Hardness vs. randomness within alternating time
inferred← citeshttps://doi.org/10.1109/ccc.2005.16openalex-snapshot
On Constructing Parallel Pseudorandom Generators from One-Way Functions
inferred← citeshttps://doi.org/10.1109/confluence.2014.6949229openalex-snapshot
A new approach to address Subset Sum problem
inferred← citeshttps://doi.org/10.1109/isit.2007.4557224openalex-snapshot
SYND: a Fast Code-Based Stream Cipher with a Security Reduction
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646134openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181976openalex-snapshot
Quantum computation and lattice problems
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238188openalex-snapshot
On ε-biased generators in NC/sup 0/
inferred← citeshttps://doi.org/10.1109/sp.2018.00036openalex-snapshot
Secure Two-party Threshold ECDSA from ECDSA Assumptions
inferred← citeshttps://doi.org/10.1109/tce.2003.1261226openalex-snapshot
Computational complexity and implementation aspects of the incremental hash function
inferred← citeshttps://doi.org/10.1109/tit.2005.859244openalex-snapshot
Masking-Based Domain Extenders for UOWHFs: Bounds and Constructions
inferred← citeshttps://doi.org/10.1109/ton.2026.3659177openalex-snapshot
Fog-Assisted Composite Attribute-Based Encryption for Secure Personal Health Data Sharing
inferred← citeshttps://doi.org/10.1137/1.9781611975482.3openalex-snapshot
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
inferred← citeshttps://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferred← citeshttps://doi.org/10.1145/1039488.1039490openalex-snapshot
New lattice-based cryptographic constructions
inferred← citeshttps://doi.org/10.1145/301250.301312openalex-snapshot
Oblivious transfer and polynomial evaluation
inferred← citeshttps://doi.org/10.1145/3055399.3055467openalex-snapshot
Faster space-efficient algorithms for subset sum and k-sum
inferred← citeshttps://doi.org/10.1145/3357713.3384308openalex-snapshot
Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
inferred← citeshttps://doi.org/10.1145/3450524openalex-snapshot
SETH-based Lower Bounds for Subset Sum and Bicriteria Path
inferred← citeshttps://doi.org/10.1145/3618260.3649670openalex-snapshot
Locality Bounds for Sampling Hamming Slices
inferred← citeshttps://doi.org/10.1145/780542.780578openalex-snapshot
Random knapsack in expected polynomial time
inferred← citeshttps://doi.org/10.1145/780542.780603openalex-snapshot
New lattice based cryptographic constructions
inferred← citeshttps://doi.org/10.1145/972639.972643openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferred← citeshttps://doi.org/10.1515/gcc-2012-0009openalex-snapshot
No-leak authentication by the Sherlock Holmes method
inferred← citeshttps://doi.org/10.1515/gcc-2017-0001openalex-snapshot
Pseudo-free families of finite computational elementary abelian p-groups
inferred← citeshttps://doi.org/10.1515/itit-2019-0038openalex-snapshot
Solving subset sum with small space – Handling cryptanalytic Big Data
inferred← citeshttps://doi.org/10.1561/0400000033openalex-snapshot
On the Power of Small-Depth Computation
inferred← citeshttps://doi.org/10.1561/9781601983015openalex-snapshot
On the Power of Small-Depth Computation
inferred← citeshttps://doi.org/10.1561/9781680831139openalex-snapshot
A Decade of Lattice Cryptography
inferred← citeshttps://doi.org/10.3390/info16100887openalex-snapshot
From Subset-Sum to Decoding: Improved Classical and Quantum Algorithms via Ternary Representation Technique
inferred← citeshttps://doi.org/10.3929/ethz-a-007554419openalex-snapshot
Cryptanalysis of hardware-oriented ciphers the Knapsack generator, and SHA-1
inferred← citeshttps://doi.org/10.4230/dagsemproc.07021.9openalex-snapshot
QUAD: Overview and Recent Developments
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.73openalex-snapshot
Equal-Subset-Sum Faster Than the Meet-in-the-Middle
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.48openalex-snapshot
Subset Sum in the Absence of Concentration
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2739openalex-snapshot
Division algorithms for the fixed weight subset sum problem
inferred← citeshttps://doi.org/10.48550/arxiv.1703.06255openalex-snapshot
Prio: Private, Robust, and Scalable Computation of Aggregate Statistics
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04295openalex-snapshot
Better Sample -- Random Subset Sum in $2^{0.255n}$ and its Impact on Decoding Random Linear Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1912.09264openalex-snapshot
Improved quantum algorithm for the random subset sum problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0403069openalex-snapshot
Computational Indistinguishability between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.5120/20043-7214openalex-snapshot
The Subset-Sum Problem: Revisited with an Improved Approximated Solution
inferred← citeshttps://doi.org/10.5555/2833227.2833257openalex-snapshot
On randomness extraction in AC0
inferred← citeshttps://doi.org/10.62056/akp-49qgxqopenalex-snapshot
Slalom at the Carnival: Privacy-preserving Inference with Masks from Public Knowledge
inferred← citeshttps://doi.org/10.70675/af9d1b8az08abz41f0za364z66a2ed720b8fopenalex-snapshot
Zero-knowledge arguments from secure multiparty computation
inferred← citeshttps://doi.org/10.70675/de2ebf31z04dez4e26z9fe1z511476c5f092openalex-snapshot
Mathematical studies of arithmetical pseudo-random numbers generators
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.