Results 1  10
of
168,449
On expected constantround protocols for Byzantine agreement
 In Advances in Cryptology — Crypto ’06
, 2006
"... In a seminal paper, Feldman and Micali show an nparty Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constantround protocol for aut ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
In a seminal paper, Feldman and Micali show an nparty Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds. Here, resolving a question that had been open since their work, we show an expected constantround protocol
Electronic Colloquium on Computational Complexity, Report No. 28 (2006) On Expected ConstantRound Protocols for Byzantine Agreement
"... In a seminal paper, Feldman and Micali (STOC ’88) show an nparty Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here, we show an expected constantround protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < ..."
Abstract
 Add to MetaCart
In a seminal paper, Feldman and Micali (STOC ’88) show an nparty Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here, we show an expected constantround protocol for authenticated Byzantine agreement assuming honest majority (i.e., t <
ConstantRound Multiparty Computation Using a BlackBox Pseudorandom Generator
"... Abstract. We present a constantround protocol for general secure multiparty computation which makes a blackbox use of a pseudorandom generator. In particular, the protocol does not require expensive zeroknowledge proofs and its communication complexity does not depend on the computational complexi ..."
Abstract
 Add to MetaCart
Abstract. We present a constantround protocol for general secure multiparty computation which makes a blackbox use of a pseudorandom generator. In particular, the protocol does not require expensive zeroknowledge proofs and its communication complexity does not depend on the computational
ConstantRound Oblivious Transfer in the Bounded Storage Model
, 2004
"... We present a constant round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties interacts based on a small portion of R. Even though the portions stored by the honest parties are small, sec ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
We present a constant round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties interacts based on a small portion of R. Even though the portions stored by the honest parties are small
Y.: Constantround multiparty computation using a blackbox pseudorandom generator
 In: CRYPTO. LNCS
, 2005
"... Abstract. We present a constantround protocol for general secure multiparty computation which makes a blackbox use of a pseudorandom generator. In particular, the protocol does not require expensive zeroknowledge proofs and its communication complexity does not depend on the computational complexi ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
Abstract. We present a constantround protocol for general secure multiparty computation which makes a blackbox use of a pseudorandom generator. In particular, the protocol does not require expensive zeroknowledge proofs and its communication complexity does not depend on the computational
Parallel CoinTossing and ConstantRound Secure TwoParty Computation
 Journal of Cryptology
, 2001
"... Abstract. In this paper we show that any twoparty functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may arbitrarily deviate from the protocol specification. This is in contrast to Yao’s constantround protocol that e ..."
Abstract

Cited by 79 (13 self)
 Add to MetaCart
Abstract. In this paper we show that any twoparty functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may arbitrarily deviate from the protocol specification. This is in contrast to Yao’s constantround protocol
ConstantRound Private Function Evaluation with Linear Complexity
"... We consider the problem of private function evaluation (PFE) in the twoparty setting. Here, informally, one party holds an input x while the other holds a circuit describing a function f; the goal is for one (or both) of the parties to learn f(x) while revealing nothing more to either party. In con ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
, and results in constantround protocols with communication/computational complexity linear in the size of the circuit computing f. This gives the first constantround protocol for PFE with linear complexity (without using fully homomorphic encryption), even restricted to semihonest adversaries. 1
Perfect ConstantRound Secure Computation via Perfect Randomizing Polynomials
 In Proc. 29th ICALP
, 2002
"... Various informationtheoretic constantround secure multiparty protocols are known for classes such as NC and polynomialsize branching programs [1, 13, 18, 3, 19, 10]. All these protocols have a small probability of failure, or alternatively use an expected constant number of rounds, suggesti ..."
Abstract

Cited by 31 (17 self)
 Add to MetaCart
Various informationtheoretic constantround secure multiparty protocols are known for classes such as NC and polynomialsize branching programs [1, 13, 18, 3, 19, 10]. All these protocols have a small probability of failure, or alternatively use an expected constant number of rounds
ConstantRound Oblivious Transfer in the Bounded Storage Model
"... ronen@cs.haifa.ac.il. Research supported by the Koshland Scholarship. Abstract. We present the first constantround protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties stores only a small porti ..."
Abstract
 Add to MetaCart
ronen@cs.haifa.ac.il. Research supported by the Koshland Scholarship. Abstract. We present the first constantround protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties stores only a small
ConstantRound Oblivious Transfer in the Bounded Storage Model
"... ronen@cs.haifa.ac.il. Research supported by the Koshland Scholarship. Abstract. We present the first constantround protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties stores only a small porti ..."
Abstract
 Add to MetaCart
ronen@cs.haifa.ac.il. Research supported by the Koshland Scholarship. Abstract. We present the first constantround protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties stores only a small
Results 1  10
of
168,449