73 search results - page 8 / 15 » Deciding Properties of Contract-Signing Protocols |
WOLLIC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
SRDS
2000
IEEE
14 years 2 months ago
2000
IEEE
Reliable multicast protocols can strongly simplify the design of distributed applications. However, it is hard to sustain a high multicast throughput when groups are large and het...
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
SOFSEM
2009
Springer
14 years 6 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...