286 search results - page 23 / 58 » Pitfalls in Formal Reasoning about Security Protocols |
114
click to vote
ACNS
2007
Springer
15 years 6 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
106
click to vote
NDSS
2000
IEEE
15 years 4 months ago
2000
IEEE
We analyze an optimistic contract signing protocol of Asokan, Shoup, and Waidner as a case study in the applicability of formal methods to verification of fair exchange protocols...
CCS
2007
ACM
15 years 6 months ago
2007
ACM
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
103
click to vote
JOC
2011
14 years 2 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
ICSE
2003
IEEE-ACM
15 years 11 months ago
2003
IEEE-ACM
Increasingly systems are composed of parts: software components, and the interaction mechanisms (connectors) that enable them to communicate. When assembling systems from independ...