Sciweavers

9 search results - page 2 / 2
» Nonce Generators and the Nonce Reset Problem
Sort
View
PKC
2005
Springer
102views Cryptology» more  PKC 2005»
13 years 11 months ago
Experimenting with Faults, Lattices and the DSA
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the first (publicly reported) physical experimen...
David Naccache, Phong Q. Nguyen, Michael Tunstall,...
CSFW
2007
IEEE
14 years 10 days ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
ASIACRYPT
2003
Springer
13 years 11 months ago
The Insecurity of Esign in Practical Implementations
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
Pierre-Alain Fouque, Nick Howgrave-Graham, Gwena&e...
CSFW
2002
IEEE
13 years 11 months ago
Types and Effects for Asymmetric Cryptographic Protocols
We present the first type and effect system for proving authenticity properties of security protocols based on asymmetric cryptography. The most significant new features of our ...
Andrew D. Gordon, Alan Jeffrey