Optimal Security Proofs for Full Domain Hash, Revisited

DOI10.1007/978-3-642-29011-4_32zbMath1297.94118OpenAlexW1604930642WikidataQ56475248 ScholiaQ56475248MaRDI QIDQ2894430

Eike Kiltz, Saqib A. Kakvi

Publication date: 29 June 2012

Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_32

zbMATH Keywords

tight security reductiondigital signature schemesubtle flaw in Coron's impossibility result

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (19)

On the security loss of unique signatures ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Memory lower bounds of reductions revisited ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Optimal tightness for chain-based unique signatures ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Identity-based encryption in DDH hard groups ⋮ On tight security proofs for Schnorr signatures ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ On the adaptive security of MACs and PRFs ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ On the tightness of forward-secure signature reductions ⋮ Generalized public-key cryptography with tight security ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Verifiable random functions with optimal tightness ⋮ On selective-opening security of deterministic primitives

This page was built for publication: Optimal Security Proofs for Full Domain Hash, Revisited