Sciweavers

165 search results - page 15 / 33
» Safely Composing Security Protocols
Sort
View
ACMICEC
2004
ACM
148views ECommerce» more  ACMICEC 2004»
15 years 3 months ago
A secure and private clarke tax voting protocol without trusted authorities
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
Changjie Wang, Ho-fung Leung
CCS
2005
ACM
15 years 3 months ago
Modeling insider attacks on group key-exchange protocols
Protocols for authenticated key exchange (AKE) allow parties within an insecure network to establish a common session key which can then be used to secure their future communicati...
Jonathan Katz, Ji Sun Shin
CCS
2007
ACM
15 years 3 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
APN
2008
Springer
14 years 11 months ago
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
Abstract. In this paper, we introduce a framework composed of a syntax and its compositional Petri net semantics, for the specification and verification of properties (like authent...
Roland Bouroulet, Raymond R. Devillers, Hanna Klau...
ENTCS
2007
129views more  ENTCS 2007»
14 years 9 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...