On 2-Round Secure Multiparty Computation
Authors:
- Rosario GennaroRGRosario Gennaro
- Tal RabinTRTal Rabin
- 13 September 2002
- book chapter
- Published by Springer Nature
- p. 178-193
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Secure Distributed Linear Algebra in a Constant Number of Rounds2001
- Minimal-Latency Secure Function Evaluation2000
- One-Round Secure Computation and Secure Autonomous Mobile AgentsLecture Notes in Computer Science, 2000
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Efficient Multiparty Computations Secure Against an Adaptive Adversary1999
- An Optimal Probabilistic Protocol for Synchronous Byzantine AgreementSIAM Journal on Computing, 1997
- A minimal model for secure computation (extended abstract)1994
- Bit Optimal Distributed Consensus1992
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction1989
- Multiparty unconditionally secure protocols1988