Sciweavers

119 search results - page 16 / 24
» Finite models for formal security proofs
Sort
View
ISCI
2008
160views more  ISCI 2008»
13 years 7 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
ASIACRYPT
2008
Springer
13 years 9 months ago
A Modular Security Analysis of the TLS Handshake Protocol
We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modul...
Paul Morrissey, Nigel P. Smart, Bogdan Warinschi
ESOP
2005
Springer
14 years 1 months ago
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of imp...
Steve Kremer, Mark Ryan
SEFM
2007
IEEE
14 years 1 months ago
Verifying the Mondex Case Study
The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those effor...
Peter H. Schmitt, Isabel Tonin