Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IACR
2011
147views more  IACR 2011»
10 years 9 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
AAAI
2006
11 years 11 months ago
A Causal Analysis Method for Concurrent Hybrid Automata
Modern artifacts are typically composed of many system components and exhibit a complex pattern of continuous/discrete behaviors. A concurrent hybrid automaton is a powerful model...
Michael W. Hofbaur, Franz Wotawa
EUROCRYPT
1999
Springer
12 years 1 months ago
On the Concurrent Composition of Zero-Knowledge Proofs
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
Ransom Richardson, Joe Kilian
CONCUR
2009
Springer
12 years 2 months ago
Concurrent Kleene Algebra
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...
C. A. R. Hoare, Bernhard Möller, Georg Struth...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
12 years 3 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
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
12 years 3 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
12 years 3 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...
books