Efficient Multiparty Protocols Using Circuit Randomization

This publication has 10 references indexed in Scilit:

• The round complexity of secure protocols
  Published by Association for Computing Machinery (ACM) ,1990
• Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
  Published by Association for Computing Machinery (ACM) ,1989
• Verifiable secret sharing and multiparty protocols with honest majority
  Published by Association for Computing Machinery (ACM) ,1989
• Multiparty computation with faulty majority
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Multiparty unconditionally secure protocols
  Published by Association for Computing Machinery (ACM) ,1988
• Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)
  Published by Springer Nature ,1988
• Completeness theorems for non-cryptographic fault-tolerant distributed computation
  Published by Association for Computing Machinery (ACM) ,1988
• How to play ANY mental game
  Published by Association for Computing Machinery (ACM) ,1987
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• How to share a secret
  Communications of the ACM, 1979