Towards plaintext-aware public-key encryption without random oracles

Towards plaintext-aware public-key encryption without random oracles (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mihir Bellare , Adriana Palacio

Venue:	Advances in Cryptology – Asiacrypt 2004, volume 3329 of Lecture Notes in Computer Science
Citations:	24 - 0 self

BibTeX

@INPROCEEDINGS{Bellare04towardsplaintext-aware,
    author = {Mihir Bellare and Adriana Palacio},
    title = {Towards plaintext-aware public-key encryption without random oracles},
    booktitle = {Advances in Cryptology – Asiacrypt 2004, volume 3329 of Lecture Notes in Computer Science},
    year = {2004},
    pages = {48--62},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract. We consider the problem of defining and achieving plaintextaware encryption without random oracles in the classical public-key model. We provide definitions for a hierarchy of notions of increasing strength: PA0, PA1 and PA2, chosen so that PA1+IND-CPA → IND-CCA1 and PA2+IND-CPA → IND-CCA2. Towards achieving the new notions of plaintext awareness, we show that a scheme due to Damg˚ard [12], denoted DEG, and the “lite ” version of the Cramer-Shoup scheme [11], denoted CS-lite, are both PA0 under the DHK0 assumption of [12], and PA1 under an extension of this assumption called DHK1. As a result, DEG is the most efficient proven IND-CCA1 scheme known. 1

Citations

1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
1001	Probabilistic encryption - Goldwasser, Micali - 1984
872	A.C.-C.: On the security of public key protocols - Dolev, Yao - 1983
410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
394	A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack - Cramer, Shoup - 1998
388	Relations Among Notions of Security for Public-Key Encryption Schemes - Bellare, Desai, et al. - 1998
295	Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack - Rackoff, Simon - 1992
212	Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks - Naor, Yung - 1990
206	The random oracle methodology, revisited - Canetti, Halevi
200	Optimal Asymmetric Encryption - Bellare, Rogaway - 1994
175	How to go beyond the black-box simulation barrier - Barak - 1997
149	Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack - Cramer, Shoup
104	A composable cryptographic library with nested operations - Backes, Pfitzmann, et al. - 2003
104	Non-Interactive Zero-Knowledge and its Applications - Blum, Feldman, et al. - 1988
99	RSA-OAEP is Secure under the RSA Assumption - Fujisaki, Okamoto, et al. - 2001
77	The notion of security for probabilistic cryptosystems - Micali, Racko, et al. - 1988
77	OAEP reconsidered - Shoup - 2002
68	A uniform-complexity treatment of encryption and zero-knowledge - Goldreich - 1993
57	Zero-knowledge proofs of knowledge without interaction - Santis, Persiano - 1992
53	Simplified OAEP for the RSA and Rabin Functions - Boneh - 2001
47	Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case - Nielsen - 2002
43	Towards practical public key systems secure against chosen ciphertext attacks - Damg˚ard - 1991
40	On the existence of 3-round zero-knowledge protocols - Hada, Tanaka - 1998
39	The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols - Bellare, Palacio - 2004
29	On the (in)security of the fiat-shamir paradigm - Goldwasser, Tauman-Kalai - 2003
25	Plaintext awareness via key registration - Herzog, Liskov, et al. - 2003
24	On cryptographic assumptions and challenges - Naor - 2003
10	Non-interactive zero-knowledge and its applications”, STOC 88 - Blum, Feldman, et al.
4	Simplified OAEP for the RSA and Rabin functions. CRYPTO ’01 - Boneh
4	Proving Security against Chosen-Ciphertext Attacks - Blum, Feldman, et al. - 1989
2	RSA-OAEP is secure under the RSA assumption. Crypto 2001 - Fujisaki, Okamoto, et al.
1	An un-instantiable random oracle model scheme for a hybrid encryption problem - Bellare, Boldyreva, et al. - 2004
1	Relations among notions of securityfor public-key encryption schemes - Bellare, Desai, et al. - 1998
1	On the (in)security of the Fiat-Shamir paradigm. FOCS 03. [21 - Goldwasser, Taumann - 1999