Sciweavers

119 search results - page 11 / 24
» Finite models for formal security proofs
Sort
View
CSFW
2008
IEEE
13 years 9 months ago
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
Michael Backes, Catalin Hritcu, Matteo Maffei
SP
1998
IEEE
106views Security Privacy» more  SP 1998»
13 years 11 months ago
Understanding Java Stack Inspection
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
Dan S. Wallach, Edward W. Felten
ESORICS
2005
Springer
14 years 1 months ago
Browser Model for Security Analysis of Browser-Based Protocols
Currently, many industrial initiatives focus on web-based applications. In this context an important requirement is that the user should only rely on a standard web browser. Hence...
Thomas Groß, Birgit Pfitzmann, Ahmad-Reza Sa...
CSFW
1999
IEEE
13 years 11 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
EUROCRYPT
2000
Springer
13 years 11 months ago
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
Victor Boyko, Philip D. MacKenzie, Sarvar Patel