Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (Extended Abstract)

Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (Extended Abstract) (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jonathan Katz

Venue:	Advances in Cryptology – proc. of EUROCRYPT ’03, LNCS 2656
Citations:	24 - 1 self

BibTeX

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

Bookmark

OpenURL

Abstract

We describe efficient 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...

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
484	Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2005
441	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT - Paillier - 1999
410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
394	A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack - Cramer, Shoup - 1998
295	Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack - Rackoff, Simon - 1992
289	Zero Knowledge Proofs of Identity - Feige, Fiat, et al. - 1987
262	Efficient Identification and Signatures for Smart Cards. CRYPTO - Schnorr - 1989
261	Digitalized signatures and public-key functions as intractable as factorization - Rabin
253	A public-key cryptosystem and a signature scheme based on discrete logarithms - Gamal - 1985
215	Foundations of Cryptography — Basic Tools - Goldreich - 2001
212	Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks - Naor, Yung - 1990
175	A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory - Guillou, Quisquater - 1988
156	Robust non-interactive zero knowledge - Santis, Crescenzo, et al. - 2001
143	Multiple non-interactive zero knowledge proofs based on a single random string - Feige, Lapidot, et al. - 1990
140	Concurrent zero-knowledge - Dwork, Naor, et al. - 1998
127	Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security. FOCS - Sahai - 1999
121	On Defining Proofs of Knowledge - Bellare, Goldreich - 1993
105	Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption - Cramer, Shoup - 2002
102	An efficient probabilistic public-key encryption scheme which hides all partial information - Blum, Goldwasser - 1985
94	H.: Public-key cryptography and password protocols - Halevi, Krawczyk - 1999
80	Multiparty computation from threshold homomorphic encryption - Cramer, Damg˚ard, et al. - 2001
62	Constant-round coin-tossing with a man in the middle or realizing the shared random string model - Barak
57	Zero-knowledge proofs of knowledge without interaction - Santis, Persiano - 1992
49	Non-Interactive and Non-Malleable Commitment - Crescenzo, Ishai, et al. - 1998
49	Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints - Dwork, Sahai - 1998
41	Fast Signature Generation with a Fiat-Shamir-Like Scheme - Ong, Schnorr - 1991
39	Modular Design of Secure Yet Practical Cryptographic Protocols - Cramer - 1996
34	Zaps and Their Applications - Dwork, Naor
28	Public-Key Cryptography and Password Protocols: The Multi-User Case - Boyarsky - 1999
26	Deniable ring authentication - Naor
24	Proofs that yield nothing but their validity - Goldreich, Micali, et al. - 1991
19	Concurrent oblivious transfer - Garay, MacKenzie - 2000
13	Multi-Party Cryptographic Computations: Techniques and Applications - Haber - 1987
9	Symmetric Public-Key Encryption - Galil, Haber, et al. - 1986
9	Efficient Cryptographic Protocols Preventing Man in the Middle Attacks”, Doctoral Dissertation submitted at - Katz
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