Efficient Multi-party Computation with Dispute Control
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 305-328
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Robustness for Free in Unconditional Multi-party ComputationLecture Notes in Computer Science, 2001
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Efficient Multiparty Computations Secure Against an Adaptive Adversary1999
- Modular construction of a Byzantine agreement protocol with optimal message bit complexityInformation and Computation, 1992
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result1988
- Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- Polynomial algorithms for multiple processor agreement1982
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979