Tightly secure signatures from lossy identification schemes
From MaRDI portal
Publication:315555
DOI10.1007/s00145-015-9203-7zbMath1348.94026OpenAlexW2063831477MaRDI QIDQ315555
Mehdi Tibouchi, Michel Abdalla, Vadim Lyubashevsky, Pierre-Alain Fouque
Publication date: 21 September 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9203-7
Related Items
Post-quantum key-blinding for authentication in anonymity networks ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ On the tightness of forward-secure signature reductions ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Signatures from sequential-OR proofs ⋮ More efficient digital signatures with tight multi-user security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved pseudo-random generator based on the discrete logarithm problem
- On the fly authentication and signature schemes based on groups of unknown order
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Kangaroos, monopoly and discrete logarithms
- Improving the exact security of digital signature schemes
- On-line/off-line digital signatures
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Efficient cryptographic schemes provably as secure as subset sum
- On Diffie-Hellman Key Agreement with Short Exponents
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Tightly-Secure Signatures from Lossy Identification Schemes
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Improved Generic Algorithms for Hard Knapsacks
- Short and Stateless Signatures from the RSA Assumption
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Generalized Compact Knapsacks Are Collision Resistant
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Efficient Public Key Encryption Based on Ideal Lattices
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- Solving low-density subset sum problems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- The Knowledge Complexity of Interactive Proof Systems
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Advances in Cryptology - EUROCRYPT 2004
- On Ideal Lattices and Learning with Errors over Rings
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Public Key Cryptography – PKC 2004
