Strengthening Zero-Knowledge Protocols using Signatures

Strengthening Zero-Knowledge Protocols using Signatures (2003)

Cached

Download Links

[eprint.iacr.org]
[www-2.cs.cmu.edu]
[www.iacr.org]

Other Repositories/Bibliography

DBLP

by Juan A. Garay , Philip MacKenzie , Ke Yang

Venue:	IN PROCEEDINGS OF EUROCRYPT ’03, LNCS SERIES
Citations:	23 - 6 self

BibTeX

@INPROCEEDINGS{Garay03strengtheningzero-knowledge,
    author = {Juan A. Garay and Philip MacKenzie and Ke Yang},
    title = {Strengthening Zero-Knowledge Protocols using Signatures},
    booktitle = {IN PROCEEDINGS OF EUROCRYPT ’03, LNCS SERIES},
    year = {2003},
    pages = {177--194},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Recently there has been an interest in zero-knowledge protocols with stronger properties, such as concurrency, unbounded simulation soundness, non-malleability, and universal composability. In this paper,

Citations

1001	Probabilistic encryption - Goldwasser, Micali - 1984
961	A public key cryptosystem and a signature scheme based on discrete logarithms - ElGamal - 1985
892	C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
636	The complexity of theorem-proving procedures - Cook - 1971
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
425	How to play any mental game, or a completeness theorem for protocols with honest majority - Goldreich, Micali, et al. - 1987
410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
327	Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems - Goldreich, Micali, et al. - 1991
298	Non-interactive and information-theoretic secure verifiable secret sharing - Pedersen - 1998
262	Efficient Identification and Signatures for Smart Cards. CRYPTO - Schnorr - 1989
227	Security arguments for digital signatures and blind signatures - Pointcheval, Stern
221	Proofs of Partial Knowledge and Simplified Design of Witness Hiding - Cramer, Damg˚ard, et al. - 1994
212	Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks - Naor, Yung - 1990
175	How to go beyond the black-box simulation barrier - Barak - 1997
175	A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory - Guillou, Quisquater - 1988
173	The Decision Diffie-Hellman problem - Boneh - 1998
171	One-way functions are necessary and sufficient for secure signatures - Rompel - 1990
156	Robust non-interactive zero knowledge - Santis, Crescenzo, et al. - 2001
150	Witness indistinguishable and witness hiding protocols - Feige, Shamir - 1990
148	Collision-free accumulators and fail-stop signature schemes without trees - Baric, Pfitzmann - 1997
140	Concurrent zero-knowledge - Dwork, Naor, et al. - 1998
139	A new public-key cryptosystem as secure as factoring - Okamoto, Uchiyama
135	Efficient proofs that a committed number lies in an interval - Boudot - 2000
127	Signature schemes based on the strong RSA assumption - Cramer, Shoup
127	Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security. FOCS - Sahai - 1999
118	T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations - Fujisaki, Okamoto - 1997
113	Universally composable commitments - Canetti, Fischlin
106	Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi, et al. - 1999
93	Efficient concurrent zero-knowledge in the auxiliary string model - Damg˚ard - 1985
70	Separability and efficiency for generic group signature schemes - Camenisch, Michels - 1999
62	Constant-round coin-tossing with a man in the middle or realizing the shared random string model - Barak
49	Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints - Dwork, Sahai - 1998
48	Universal composition with joint state - Canetti, Rabin - 2003
45	On-line/off-line digital signatures - Even, Goldreich, et al. - 1996
41	Concurrent Zero-Knowledge with Logarithmic Round Complexity - Prabhakaran, Rosen, et al. - 2002
39	Strict polynomial-time in simulation and extraction - Barak, Lindell - 2004
39	Concurrent and resettable zero-knowledge in polyloalgorithm rounds - Kilian, Petrank - 2001
38	Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor - Damgård, Nielsen
27	A.: Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures - Jarecki, Lysyanskaya - 2000
25	Secure Hash Standard, Federal Information Processing Standards Publication 180-1 - FIPS - 1995
25	Two-party generation of DSA signatures - MacKenzie, Reiter - 2001
24	Efficient and non-malleable proofs of plaintext knowledge and applications - Katz - 2003
22	Threshold password-authenticated key exchange,” CRYPTO’02 - MacKenzie, Shrimpton, et al. - 2002
17	Universally composable twoparty computation - Canetti, Lindell, et al. - 2002
16	Digital signature algorithm - Kravitz - 1991
16	Universal sorting problems. Problemy Peredaci Informacii, 9:115–116 - Levin - 1973
12	Efficient publicly verifiable secret sharing schemes with fast or delayed recovery - Boudot, Traoré - 1999
11	Digital signature standard. Federal Information Processing Standards Publication 186 - FIPS - 1994