Secure Computation
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 392-404
- https://doi.org/10.1007/3-540-46766-1_32
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990
- Private computations over the integersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- A zero-one law for Boolean privacyPublished by Association for Computing Machinery (ACM) ,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
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the ResultPublished by Springer Nature ,1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981