Sciweavers

325 search results - page 2 / 65
» Concurrent Composition of Secure Protocols in the Timing Mod...
Sort
View
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
13 years 11 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...
IACR
2011
147views more  IACR 2011»
12 years 4 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
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
13 years 10 months ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
FOCS
2003
IEEE
13 years 10 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
CRYPTO
2009
Springer
144views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
On the Composition of Public-Coin Zero-Knowledge Protocols
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikstr...