Article

On the composition of zero-knowledge proof systems

Authors:

Oded Goldreich,

Hugo KrawczykAuthors Info & Claims

Proceedings of the seventeenth international colloquium on Automata, languages and programming

Pages 268 - 282

Published: 01 July 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Frankel YGemmell PYung MMiller G(1996)Witness-based cryptographic program checking and robust function sharingProceedings of the twenty-eighth annual ACM symposium on Theory of Computing10.1145/237814.237998(499-508)Online publication date: 1-Jul-1996
https://dl.acm.org/doi/10.1145/237814.237998
Bellare MRogaway PDenning DPyle RGanesan RSandhu RAshby V(1993)Random oracles are practicalProceedings of the 1st ACM conference on Computer and communications security10.1145/168588.168596(62-73)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1145/168588.168596
Rackoff CSimon DKosaraju RJohnson DAggarwal A(1993)Cryptographic defense against traffic analysisProceedings of the twenty-fifth annual ACM symposium on Theory of Computing10.1145/167088.167260(672-681)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/167088.167260
Show More Cited By

Index Terms

On the composition of zero-knowledge proof systems
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
2. Theory of computation

Recommendations

On the Composition of Zero-Knowledge Proof Systems

The wide applicability of zero-knowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zero-...
Definitions and properties of zero-knowledge proof systems

In this paper we investigate some properties of zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff. We introduce and classify two definitions of zero-knowledge: auxiliary-input zero-knowledge and blackbox-simulation zero-...
Interaction in zero-knowledge proof systems

Comments

Information & Contributors

Information

Published In

Proceedings of the seventeenth international colloquium on Automata, languages and programming

July 1990

780 pages

ISBN:0387528261

Editor:
Michael S. Paterson
Univ. of Warwick, Warwick, UK

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Frankel YGemmell PYung MMiller G(1996)Witness-based cryptographic program checking and robust function sharingProceedings of the twenty-eighth annual ACM symposium on Theory of Computing10.1145/237814.237998(499-508)Online publication date: 1-Jul-1996
https://dl.acm.org/doi/10.1145/237814.237998
Bellare MRogaway PDenning DPyle RGanesan RSandhu RAshby V(1993)Random oracles are practicalProceedings of the 1st ACM conference on Computer and communications security10.1145/168588.168596(62-73)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1145/168588.168596
Rackoff CSimon DKosaraju RJohnson DAggarwal A(1993)Cryptographic defense against traffic analysisProceedings of the twenty-fifth annual ACM symposium on Theory of Computing10.1145/167088.167260(672-681)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/167088.167260
Bellare MPetrank EKosaraju RFellows MWigderson AEllis J(1992)Making zero-knowledge provers efficientProceedings of the twenty-fourth annual ACM symposium on Theory of Computing10.1145/129712.129781(711-722)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.1145/129712.129781
Dolev DDwork CNaor MKoutsougeras CVitter J(1991)Non-malleable cryptographyProceedings of the twenty-third annual ACM symposium on Theory of Computing10.1145/103418.103474(542-552)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/103418.103474

View Options

View options

Get Access

Login options

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

Abstract

Cited By

Index Terms

Recommendations

On the Composition of Zero-Knowledge Proof Systems

Definitions and properties of zero-knowledge proof systems

Interaction in zero-knowledge proof systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations