Sciweavers

849 search results - page 3 / 170
» Secure Applications of Low-Entropy Keys
Sort
View
EUROPKI
2008
Springer
13 years 9 months ago
Fault Attacks on Public Key Elements: Application to DLP-Based Schemes
Chong Hee Kim, Philippe Bulens, Christophe Petit, ...
IACR
2011
73views more  IACR 2011»
12 years 7 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr
INFOCOM
2011
IEEE
12 years 11 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 5 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena