How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)
- 1 December 2000
- book chapter
- Published by Springer Nature
- p. 171-185
- https://doi.org/10.1007/3-540-47721-7_11
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- How to share a secretCommunications of the ACM, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971