Sciweavers

117 search results - page 2 / 24
» Concurrent general composition of secure protocols in the ti...
Sort
View
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
14 years 1 months ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
14 years 7 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
IACR
2011
147views more  IACR 2011»
12 years 7 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
CCS
2006
ACM
13 years 11 months ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven