Foundations of Secure Interactive Computing
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 377-391
- https://doi.org/10.1007/3-540-46766-1_31
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- Minimum-Knowledge Interactive Proofs for Decision ProblemsSIAM Journal on Computing, 1989
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Multiparty computation with faulty majorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- On the cunning power of cheating verifiers: Some observations about zero knowledge proofsPublished 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
- Probabilistic encryptionJournal of Computer and System Sciences, 1984