Sciweavers

Share
CSFW
2007
IEEE
9 years 8 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
WIMOB
2008
IEEE
9 years 8 months ago
On the Energy Cost of Communication and Cryptography in Wireless Sensor Networks
Energy is a central concern in the deployment of wireless sensor networks. In this paper, we investigate the energy cost of cryptographic protocols, both from a communication and ...
Giacomo de Meulenaer, François Gosset, Fran...
CSFW
2009
IEEE
9 years 8 months ago
Achieving Security Despite Compromise Using Zero-knowledge
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
Michael Backes, Martin P. Grochulla, Catalin Hritc...
CSFW
2009
IEEE
9 years 8 months ago
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. ...
Najah Chridi, Mathieu Turuani, Michaël Rusino...
CTRSA
2010
Springer
200views Cryptology» more  CTRSA 2010»
9 years 8 months ago
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
Scott Yilek
IEEEARES
2010
IEEE
9 years 8 months ago
Pitfalls in Formal Reasoning about Security Protocols
Formal verification can give more confidence in the security of cryptographic protocols. Application specific security properties like “The service provider does not loose mo...
Nina Moebius, Kurt Stenzel, Wolfgang Reif
CADE
2005
Springer
10 years 1 months ago
Regular Protocols and Attacks with Regular Knowledge
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
Tomasz Truderung
WWW
2007
ACM
10 years 2 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...
books