On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions

This publication has 25 references indexed in Scilit:

• Universally composable two-party and multi-party secure computation
  Published by Association for Computing Machinery (ACM) ,2002
• Universally Composable Notions of Key Exchange and Secure Channels
  Published by Springer Nature ,2002
• Universally Composable Commitments
  Published by Springer Nature ,2001
• Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
  Published by Springer Nature ,2001
• The All-or-Nothing Nature of Two-Party Secure Computation
  Published by Springer Nature ,1999
• Adaptively secure multi-party computation
  Published by Association for Computing Machinery (ACM) ,1996
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
  Journal of Cryptology, 1991
• A zero-one law for Boolean privacy
  Published by Association for Computing Machinery (ACM) ,1989
• Completeness theorems for non-cryptographic fault-tolerant distributed computation
  Published by Association for Computing Machinery (ACM) ,1988
• Limits on the security of coin flips when half the processors are faulty
  Published by Association for Computing Machinery (ACM) ,1986