Article

Free access

Resettable zero-knowledge (extended abstract)

Authors:

Ran Canetti,

Oded Goldreich,

Shafi Goldwasser,

Silvio MicaliAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 235 - 244

https://doi.org/10.1145/335305.335334

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

M. Bellaxe and O. Goldreich, Proofs of Computational Ability. Crypto '92, August 1992. Full version available on the Theo~ of C~ptogr~phy Lib~'a~y, http://philby .ucsd. sdu/01d, html, Record Arc-03.

Google Scholar

[2]

G. Brassard, D. Chaum and C. Cr~peau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988.

Digital Library

Google Scholar

[3]

R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. BCC'C', TR99-042, 1999.Also available from the Theory of Cryptography Library.

Digital Library

Google Scholar

[4]

I. Damg&rd. Concurrent Zero-Knowledge in Easy in Practics. Theory of Cryptography Library, 99-14, 3une 1999. http: } }philby. ucsd. e du/crypt 01 ib/1999, html.

Google Scholar

[5]

I. Damg~-rd. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Eurocrypt 2000.

Digital Library

Google Scholar

[6]

D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. In ~S,d STOC, pages 542-552, 1991.

Digital Library

Google Scholar

[7]

C. Dwork, and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In Crypto98, Springer LNCS 1462.

Digital Library

Google Scholar

[8]

C. Dwork, M. Naor, and A. Sahai. Concurrent Zero- Knowledge. In $0th STOC, pages 409-418, 1998.

Digital Library

Google Scholar

[9]

U. Feige. Ph.D. thesis, Weizmann Institute of Science.

Google Scholar

[10]

U. Feige, A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. Jour"nal of Cryl~tology, Vol. 1, 1988, pages 77-94.

Digital Library

Google Scholar

[11]

U. Feige and A. Sharnir. Witness Indistinguishability and Witness Hiding Protocols. In,~nd $TOC, pages 416-426, 1990.

Digital Library

Google Scholar

[12]

A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. In CRYPT086, Springer-Verlag LNCS263, pages 186-189, 1987.

Digital Library

Google Scholar

[13]

O. Goldreich. Foundation of C~jptography - F, ag- ~'nentz of a Book. February 1996. Revised version, January 1998. Both versions axe available from http://theory, lcs. mi~. sdu/~oded/frag, h~ml.

Google Scholar

[14]

O. Goldreich, S. Goldwa~ser, and S. Micadi. How to Construct Random Functions. JACM, Vol. 33, No. 4, pages 792-807, 1986.

Digital Library

Google Scholar

[15]

O. Goldreich, S. Goldwasser, and S. Micali. Interleaved Zero-Knowledge in the Public-Key Model. ECCC, TR99- 024, 1999. Also available from the Theor~j of Cr~yptography Library.

Google Scholar

[16]

O. Goldreich and A. Kahan. How to Construct Constant- Round Zero-Knowledge Proof Systems for NP.Jour. of Cryptology, Vol. 9, No. 2, pages 167-189, 1996.

Digital Library

Google Scholar

[17]

O. Goldreich and H. Krawcsyk. On the Composition of Zero- Knowledge Proof Systems. SIAM J. Computing, Vol. 25, No. 1, pages 169-192, 1996.

Digital Library

Google Scholar

[18]

O. Goldreich and L.A. Levin. Haxd-core Predicates for any One-Way Function. In 215t STOC, pages 25-32, 1989.

Digital Library

Google Scholar

[19]

O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38, No. 1, pp. 691-729, 1991.

Digital Library

Google Scholar

[20]

O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology, Vol. 7, No. 1, pages 1-32, 1994.

Digital Library

Google Scholar

[21]

S. Goldwasser and S. Micali. Patent applications on Inand Internet Zero-Knotvledge and Lo~v-Knotoledge Proofs ~.d P~oto~oZ, (6/ll/sg).

Google Scholar

[22]

S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., Vol. 18, No. 1, pp. 186-208, 1989.

Digital Library

Google Scholar

[23]

.1. H~stad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One.Way Function. SIAM Jour. on C'o~r~p~ting, Vol. 28 (4), pages 1364-1396, 1999.

Digital Library

Google Scholar

[24]

3. Kilian, E. Petrank, and C. Rackoff. Lower Bounds for Zero-Knowledge on the Internet. In Sgth FOC$, pages 484- 492, 1998.

Digital Library

Google Scholar

[25]

M. Naor. Bit Commitment using Pseudorandom Generators. Jolt. of Cryptology, Vol. 4, pages 151-158, 1991.

Digital Library

Google Scholar

[26]

It. Richardson and 3. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In B~.o(Tr~p~99, Springer LNCS 1592, pages 415-413.

Digital Library

Google Scholar

[27]

M. Tompa and H. Woll. Random Self-Reducibility and Zero- Knowledge Interactive Proofs of Possession of Information. In 28th FOC$, pages 472-482, 1987.

Google Scholar

[28]

A.C. Yao. Theory and Application of Trapdoor Functions. In 23~d FO C$, pages 80-91, 1982.

Google Scholar

Cited By

View all

Zhu WDeng Y(2024)Simultaneously resettable zero knowledge protocol in Public Key modelCybersecurity10.1186/s42400-024-00253-57:1Online publication date: 17-Nov-2024
https://doi.org/10.1186/s42400-024-00253-5
Civit PGilbert SGuerraoui RKomatovic JParamonov AVidigueira MKuznetsov PGelles ROlivetti D(2024)All Byzantine Agreement Problems Are ExpensiveProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662780(157-169)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662780
Kiyoshima S(2024)Resettable Statistical Zero-Knowledge for Advances in Cryptology – CRYPTO 202410.1007/978-3-031-68400-5_9(288-320)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68400-5_9
Show More Cited By

Index Terms

Resettable zero-knowledge (extended abstract)

Recommendations

Resettable Zero-Knowledge
Concurrently-secure credential ownership proofs
ASIACCS '07: Proceedings of the 2nd ACM symposium on Information, computer and communications security

We address the case in credential systems where a credential owner wants to show her credential to a verifier without taking the risk that the ability to prove ownership of the same (and any other) credential is transferred to the verifier. We define ...
An efficient statistical zero-knowledge authentication protocol for smart cards

We construct an efficient statistical zero-knowledge authentication protocol for smart cards based on general assumptions. We show how it can be instantiated using lattice-based primitives, which are conjectured to be secure against quantum attacks. We ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

149
Total Citations
View Citations
1,227
Total Downloads

Downloads (Last 12 months)224
Downloads (Last 6 weeks)27

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhu WDeng Y(2024)Simultaneously resettable zero knowledge protocol in Public Key modelCybersecurity10.1186/s42400-024-00253-57:1Online publication date: 17-Nov-2024
https://doi.org/10.1186/s42400-024-00253-5
Civit PGilbert SGuerraoui RKomatovic JParamonov AVidigueira MKuznetsov PGelles ROlivetti D(2024)All Byzantine Agreement Problems Are ExpensiveProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662780(157-169)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662780
Kiyoshima S(2024)Resettable Statistical Zero-Knowledge for Advances in Cryptology – CRYPTO 202410.1007/978-3-031-68400-5_9(288-320)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68400-5_9
Liu YPass R(2024)A Direct PRF Construction from Kolmogorov ComplexityAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58737-5_14(375-406)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58737-5_14
Schäge S(2024)New Limits of Provable Security and Applications to ElGamal EncryptionAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58737-5_10(255-285)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58737-5_10
Alamati NMontgomery HPatranabis SRoy A(2023)Minicrypt Primitives with Algebraic Structure and ApplicationsJournal of Cryptology10.1007/s00145-022-09442-236:1Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1007/s00145-022-09442-2
Grześkowiak MKrzywiecki ŁNiczyj K(2023)Cryptanalysis of Human Identification Protocol with Human-Computable PasswordsInformation Security Practice and Experience10.1007/978-981-99-7032-2_21(347-364)Online publication date: 8-Nov-2023
https://doi.org/10.1007/978-981-99-7032-2_21
Bitansky NKhurana DPaneth O(2022)Weak Zero-Knowledge beyond the Black-Box BarrierSIAM Journal on Computing10.1137/20M131956552:2(STOC19-156-STOC19-199)Online publication date: 27-Jan-2022
https://doi.org/10.1137/20M1319565
Sugauchi SObana S(2022)Fully Subliminal-Free Schnorr Signature for Nonce2022 Tenth International Symposium on Computing and Networking (CANDAR)10.1109/CANDAR57322.2022.00032(179-185)Online publication date: Nov-2022
https://doi.org/10.1109/CANDAR57322.2022.00032
VISCONTI IPointcheval D(2022)Zero‐Knowledge ProofsAsymmetric Cryptography10.1002/9781394188369.ch3(63-84)Online publication date: 30-Nov-2022
https://doi.org/10.1002/9781394188369.ch3
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Resettable Zero-Knowledge

Concurrently-secure credential ownership proofs

An efficient statistical zero-knowledge authentication protocol for smart cards