Universally composable two-party and multi-party secure computation
Top Cited Papers
- 19 May 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 494-503
- https://doi.org/10.1145/509907.509980
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Universal Composition with Joint StatePublished by Springer Nature ,2003
- Nonmalleable CryptographySIAM Journal on Computing, 2000
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984