How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Authors:
- 9 August 2007
- book chapter
- Published by Springer Nature
- p. 284-302
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems2005
- A Quantitative Approach to Reductions in Secure Computation2004
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- The All-or-Nothing Nature of Two-Party Secure ComputationLecture Notes in Computer Science, 1999
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions1999
- Correlated pseudorandomness and the complexity of private computations1996
- Precomputing Oblivious Transfer1995
- Modular construction of a Byzantine agreement protocol with optimal message bit complexityInformation and Computation, 1992
- Bit Optimal Distributed Consensus1992
- An O (log n ) expected rounds randomized byzantine generals protocolJournal of the ACM, 1987