On the Impossibility of Tight Cryptographic Reductions

DOI10.1007/978-3-662-49896-5_10zbMath1369.94519OpenAlexW2409148419MaRDI QIDQ5739205

Christoph Bader, Tibor Jager, Sven Schäge, Yong Li

Publication date: 15 July 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (36)

Generic construction for tightly-secure signatures from discrete log ⋮ Practical isogeny-based key-exchange with optimal tightness ⋮ On the security loss of unique signatures ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Authenticated key exchange and signatures with tight security in the standard model ⋮ Tightness subtleties for multi-user PKE notions ⋮ Memory lower bounds of reductions revisited ⋮ Optimal tightness for chain-based unique signatures ⋮ On the concrete security of TLS 1.3 PSK mode ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Deniable authentication when signing keys leak ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Multi-instance secure public-key encryption ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Adaptive multiparty NIKE ⋮ The power of undirected rewindings for adaptive security ⋮ On optimal tightness for key exchange with full forward secrecy via key confirmation ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ On the adaptive security of MACs and PRFs ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss ⋮ A formal security analysis of the Signal messaging protocol ⋮ 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 ⋮ Security of BLS and BGLS signatures in a multi-user setting ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Tightly-secure authenticated key exchange, revisited ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ More efficient digital signatures with tight multi-user security ⋮ Verifiable random functions with optimal tightness ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols

This page was built for publication: On the Impossibility of Tight Cryptographic Reductions