Statistical zero knowledge protocols to prove modular polynomial relations
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Nature ,2001
- Practical and provably secure release of a secret and exchange of signaturesJournal of Cryptology, 1995
- Witness indistinguishable and witness hiding protocolsPublished by Association for Computing Machinery (ACM) ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Random self-reducibility and zero knowledge interactive proofs of possession of informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976