Optimal security proofs for full domain hash. Revisited
From MaRDI portal
Publication:1747667
DOI10.1007/s00145-017-9257-9zbMath1426.94106OpenAlexW2607790354WikidataQ113906167 ScholiaQ113906167MaRDI QIDQ1747667
Publication date: 26 April 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9257-9
Related Items
Digital Signatures with Memory-Tight Security in the Multi-challenge Setting, Identity-based encryption in DDH hard groups, On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model, Short tightly secure signatures for signing a vector of group elements: a new approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another look at ``provable security
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Finding a Small Root of a Univariate Modular Equation
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Public-Key Locally-Decodable Codes
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
- Computationally Sound Proofs
- Certifying RSA
- Advances in Cryptology - EUROCRYPT 2004
- Proving Tight Security for Rabin-Williams Signatures
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- Automata, Languages and Programming
