IACR
2011
12 years 10 months ago
2011
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...
AAAI
2006
14 years 9 days ago
2006
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...
EUROCRYPT
1999
Springer
14 years 3 months ago
1999
Springer
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...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
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...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
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 ...
SP
2006
IEEE
14 years 4 months ago
2006
IEEE
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
TCC
2007
Springer
14 years 5 months ago
2007
Springer
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...