Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
From MaRDI portal
Recommendations
- Provable security for public key schemes
- Public-key cryptography in the fine-grained setting
- Easy verifiable primitives and practical public key cryptosystems
- Chosen-ciphertext security from subset sum
- On the bit security of cryptographic primitives
- scientific article; zbMATH DE number 1504547
- Towards tightly secure deterministic public key encryption
- Provably Secure Key Assignment Schemes from Factoring
- Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Efficient cryptographic schemes provably as secure as subset sum
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Foundations of Cryptography
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 4213909 (Why is no real title available?)
- Lossy trapdoor functions and their applications
- More on average case vs approximation complexity
- New lattice based cryptographic constructions
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On lattices, learning with errors, random linear codes, and cryptography
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Probability Inequalities for Sums of Bounded Random Variables
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Public-key cryptosystems from the worst-case shortest vector problem
- Public-Key Cryptosystems Resilient to Key Leakage
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Solving low-density subset sum problems
- STACS 2005
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(28)- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- The Modular Subset-Sum Problem and the size of deletion correcting codes
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Improved broadcast attacks against subset sum problems via lattice oracle
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Fully leakage-resilient signatures
- Naor-Yung paradigm with shared randomness and applications
- Efficient cryptographic schemes provably as secure as subset sum
- Improved classical and quantum algorithms for subset-sum
- Chosen-ciphertext security from subset sum
- Naor-Yung Paradigm with Shared Randomness and Applications
- Better key sizes (and attacks) for LWE-based encryption
- The geometry of lattice cryptography
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Subset Sum Quantumly in 1.17 n .
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Algebraic algorithms for variants of subset sum
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Efficient reductions and algorithms for subset product
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Efficient updatable public-key encryption from lattices
- \(k\)-SUM in the sparse regime: complexity and applications
- Fine-grained complexity in a world without cryptography
- Non-interactive blind signatures: post-quantum and stronger security
- Self-masking for hardening inversions
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Batched \& non-interactive blind signatures from lattices
This page was built for publication: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408206)
