Another look at ``provable security

DOI10.1007/s00145-005-0432-zzbMath1115.68078WikidataQ56016960 ScholiaQ56016960MaRDI QIDQ882771

Neal Koblitz, Alfred J. Menezes

Publication date: 24 May 2007

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-005-0432-z

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory

94A62: Authentication, digital signatures and secret sharing

Related Items

Interpreting Hash Function Security Proofs, Chasing Diagrams in Cryptography, Another look at automated theorem-proving, The One-More Discrete Logarithm Assumption in the Generic Group Model, Digital signature scheme set in a hidden cyclic group, The random oracle model: a twenty-year retrospective, Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces, Optimal security proofs for full domain hash. Revisited, Circuit complexity of linear functions: gate elimination and feeble security, A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs, A novel version of the hidden logarithm problem for post-quantum signature algorithms, CryptHOL: game-based proofs in higher-order logic, Device independent quantum key distribution using three-party pseudo-telepathy, Elliptic curve cryptography: the serpentine course of a paradigm shift, Another Look at Tightness, Gate Elimination for Linear Functions and New Feebly Secure Constructions, Practical significance of security bounds for standardized internally re-keyed block cipher modes, A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups, Another look at non-standard discrete log and Diffie-Hellman problems, Hash function requirements for Schnorr signatures, Building Secure Block Ciphers on Generic Attacks Assumptions