227 search results - page 12 / 46 » On the Reachability Problem in Cryptographic Protocols |
CSFW
1999
IEEE
13 years 11 months ago
1999
IEEE
Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related proble...
CTRSA
2009
Springer
13 years 11 months ago
2009
Springer
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
ACNS
2003
Springer
14 years 22 days ago
2003
Springer
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
ICNP
1998
IEEE
13 years 11 months ago
1998
IEEE
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequen...