Another Look at “Provable Security"

Another Look at “Provable Security" (2004)

Cached

Download Links

by Neal Koblitz , Alfred J. Menezes

Citations:

BibTeX

@TECHREPORT{Koblitz04anotherlook,
    author = {Neal Koblitz and Alfred J. Menezes},
    title = {Another Look at “Provable Security"},
    institution = {},
    year = {2004}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusions suggested by the formal terminology and “proofs,” whereas in other cases the formalism seems to be consistent with common sense. We discuss the reasons why the search for mathematically convincing theoretical evidence to support the security of public-key systems has been an important theme of researchers. But we argue that the theorem-proof paradigm of theoretical mathematics is often of limited relevance here and frequently leads to papers that are confusing and misleading. Because our paper is aimed at the general mathematical public, it is self-contained and as jargon-free as possible.

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New Directions in Cryptography - Diffie, Hellman - 1976
1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
1001	Probabilistic encryption - Goldwasser, Micali - 1984
961	A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm - ElGamal - 1985
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
707	How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
512	Efficient signature generation for smart cards - Schnorr - 1991
496	Differential Power Analysis - Kocher, Jaffe, et al. - 1999
460	signatures from the Weil pairing - Boneh, Lynn, et al.
394	A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack - Cramer, Shoup - 1998
321	Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems - Kocher - 1996
308	Modular elliptic curves and Fermat’s last theorem - Wiles - 1995
295	Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack - Rackoff, Simon - 1992
288	The exact security of digital signatures - how to sign with rsa and rabin - Bellare, Rogaway - 1996
262	Elliptic Curve Public Key Cryptosystems - Menezes - 1993
261	Digitalized signatures and public-key functions as intractable as factorization - Rabin
238	On the importance of checking cryptographic protocols for faults - Boneh, Demillo, et al.
227	Security arguments for digital signatures and blind signatures - Pointcheval, Stern
212	Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks - Naor, Yung - 1990
198	Chosen ciphertext attacks against protocols based on the RSA encryption standard - Bleichenbacher - 1998
197	Ring-theoretic properties of certain Hecke algebras - Taylor, Wiles - 1995
191	Security Proofs for Signature Schemes - Pointcheval, Stern - 1996
176	Optimal asymmetric encryption – how to encrypt with RSA - Bellare, Rogaway - 1994
173	The Decision Diffie-Hellman problem - Boneh - 1998
160	A Course in Number Theory and Cryptography - Koblitz - 1994
147	Foundations of Cryptography - Goldreich - 2001
101	On the exact security of full domain hash - Coron - 2000
99	RSA-OAEP is Secure under the RSA Assumption - Fujisaki, Okamoto, et al. - 2001
91	Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information - Goldwasser, Micali - 1982
84	S.: New explicit conditions of elliptic curve traces for FRreduction - Miyaji, Nakabayashi, et al. - 2001
77	The notion of security for probabilistic cryptosystems - Micali, Racko, et al. - 1988
76	Finding a small root of a univariate modular equation - Coppersmith - 1996
69	Algorithms for black box fields and their application to cryptography - Boneh, Lipton - 1996
65	A modification of the RSA public-key encryption procedure - Williams - 1980
62	Using hash functions as a hedge against chosen ciphertext attack - Shoup - 2000
61	Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms - Maurer
60	An uninstantiable random-oracle-model scheme for a hybridencryption problem - Bellare, Boldyreva, et al. - 2004
53	Simplified OAEP for the RSA and Rabin Functions - Boneh - 2001
42	A chosen ciphertext attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as standardized - Manger - 2001
40	Optimal security proofs for PSS and other signature schemes - Coron - 2002
34	Practice-oriented provable-security - Bellare - 1999
33	Breaking RSA may not be equivalent to factoring - Boneh, Venkatesan
29	On the (in)security of the fiat-shamir paradigm - Goldwasser, Tauman-Kalai - 2003
28	A “Paradoxical” Solution to the Signature Problem - Goldwasser, Micali, et al. - 1984
24	Efficiency improvements for signature schemes with tight security reductions - Katz, Wang - 2003
21	A signature scheme as secure as the Diffie-Hellman problem - Goh, Jarecki - 2003
19	The random oracle model revisited - Canetti, Goldreich, et al. - 1998
18	Flaws in applying proof methodologies to signature schemes - Stern, Pointcheval, et al. - 2002