From Identification to Signatures, Tightly: A Framework and Generic Transforms
From MaRDI portal
Publication:2953785
DOI10.1007/978-3-662-53890-6_15zbMath1407.94083OpenAlexW2555791265MaRDI QIDQ2953785
Mihir Bellare, Douglas Stebila, Bertram Poettering
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_15
Related Items
LESS is More: Code-Based Signatures Without Syndromes, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, Optimal tightness for chain-based unique signatures, Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA, From Identification to Signatures, Tightly: A Framework and Generic Transforms, On the tightness of forward-secure signature reductions, Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures, Identification protocols and signature schemes based on supersingular isogeny problems, Security of hedged Fiat-Shamir signatures under fault attacks, MPSign: a signature from small-secret middle-product learning with errors
Cites Work
- The random oracle model: a twenty-year retrospective
- Zero-knowledge proofs of identity
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Improving the exact security of digital signature schemes
- Optimal Security Proofs for Signatures from Identification Schemes
- 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
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- High-Speed High-Security Signatures
- Trapdoors for hard lattices and new cryptographic constructions
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Tighter Reductions for Forward-Secure Signature Schemes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item