Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (2003) [19 citations — 0 self]

Download:
pdf | ps

by Jonathan Katz

Advances in Cryptology – proc. of EUROCRYPT ’03, LNCS 2656

http://www.cs.umd.edu/~jkatz/papers/NMPPK-long.ps

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Katz03efficientand,
    author = {Jonathan Katz},
    title = {Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications},
    booktitle = {Advances in Cryptology – proc. of EUROCRYPT ’03, LNCS 2656},
    year = {2003},
    pages = {211--228},
    publisher = {Springer-Verlag}
}

Abstract:

Abstract. We describe e#cient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols:-- Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext-secure interactive encryption schemes based on any of the schemes above. In each case, the improved scheme requires only a small overhead beyond the original, semantically-secure scheme.-- Password-based authenticated key exchange. We derive e#cient protocols for password-based key exchange in the public-key model [28, 5] whose security may be based on any of the cryptosystems mentioned above.-- Deniable authentication. Our techniques give the first e#cient constructions of deniable authentication protocols based on, e.g., the RSA or computational Di#e-Hellman assumption. Of independent interest, we consider the concurrent composition of proofs of knowledge; this is essential to prove security of our protocols when run in an asynchronous, concurrent environment.

Citations

1976	A method for obtaining digital signatures and public key cryptosystems – Rivest, Shamir, et al. - 1978
355	Nonmalleable cryptography – Dolev, Dwork, et al.
352	A paractical public-key cryptosystem provably secure against adaptive chosen ciphertext attack – Cramer, Shoup - 1998
306	Universally composable security: A new paradigm for cryptographic protocols – Canetti - 2001
264	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt ’99 – Paillier
263	Zero Knowledge Proofs of Identity – Fiege, Fiat, et al. - 1987
245	Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack – Rackoff, Simon - 1992
210	Efficient identification and signatures for smart cards – Schnorr
193	Digitalized signatures and public-key functions as intractable as factorization – Rabin - 1979
174	A public key cryptosystem and a signature scheme based on discrete logarithms – Gamal - 1985
166	Public-key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks. STOC ’90 – Naor, Yung
161	J.-J.Quisquater: A Practical Zero-Knowledge Protocol fitted to Security Microprocessor Minimizing both Transmission and Memory, Proc.of EuroCrypt 88, Springer Verlag LNCS series – Guillou
134	Nonin-teractive zero-knowledge – Blum, Santis, et al. - 1991
132	Foundations of Cryptography: Basic Tools – Goldreich - 2001
122	Concurrent zero-knowledge – Dwork, Naor, et al. - 1998
113	Multiple non-interactive zero knowledge proofs under general assumptions – Feige, Lapidot, et al. - 1999
102	On defining proofs of knowledge – Bellare, Goldreich
88	Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security – Sahai - 1999
86	An efficient probabilistic public-key encryption scheme which hides all partial information – Blum, Goldwasser - 1985
79	Public-Key Cryptography and Password Protocols – Halevi, Krawczyk - 1999
74	Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption – Cramer, Shoup - 2002
58	Multiparty Computation from Threshold Homomorphic Encryption. Eurocrypt 2001 – Cramer, Damg˚ard, et al.
57	Zero-Knowledge Proofs of Knowledge without Interaction – Santis, Persiano - 1992
52	A.Sahai: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints – Dwork
48	Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model – Barak - 2002
42	Efficient and noninteractive non-malleable commitment – Crescenzo, Katz, et al.
35	Fast signature generation with a Fiat Shamir-like scheme – Ong, Schnorr - 1990
33	Public-Key Cryptography and Password Protocols: The Multi-User Case – Boyarsky - 1999
32	Modular Design of Secure yet Practical Cryptographic Protocols – Cramer - 1995
28	Zaps and Their Applications – Dwork, Naor
28	Deniable Ring Authentication – Naor - 2002
27	Proofs that Yield Nothing but their Validity – Goldreich, Micali, et al. - 1991
19	Concurrent Oblivious Transfer – Garay, Mackenzie - 2000
14	Multi-Party Cryptographic Computation: Techniques and Applications – Haber - 1988
8	Symmetric Public-Key Encryption – Galil, Haber, et al. - 1985
5	Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks – Katz - 2002
2	A Proof of Plaintext Knowledge Protocol and Applications – Aumann, Rabin - 2001
1	On Defining Proofs of Knowledge. Advances in Cryptology --- Crypto '92 – Bellare, Goldreich - 1992
1	on Information and System Security 2(3): 230--268 – Katz - 1999

View or Download | Add to My Collection | Correct Errors