Pages that link to "Item:Q3408206"

The following pages link to Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206):

Displayed 19 items.

• Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) ‎ (← links)
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) ‎ (← links)
• The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) ‎ (← links)
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) ‎ (← links)
• Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) ‎ (← links)
• Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) ‎ (← links)
• Fully leakage-resilient signatures (Q2392093) ‎ (← links)
• Naor-Yung paradigm with shared randomness and applications (Q2401764) ‎ (← links)
• Improved classical and quantum algorithms for subset-sum (Q2692398) ‎ (← links)
• Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) ‎ (← links)
• Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) ‎ (← links)
• The Geometry of Lattice Cryptography (Q3092183) ‎ (← links)
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) ‎ (← links)
• An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) ‎ (← links)
• Subset Sum Quantumly in 1.17 n . (Q5889072) ‎ (← links)
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) ‎ (← links)
• Algebraic algorithms for variants of subset sum (Q6102280) ‎ (← links)
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) ‎ (← links)
• Efficient reductions and algorithms for subset product (Q6132518) ‎ (← links)