Sciweavers

25 search results - page 2 / 5
» Breaking a Cryptographic Protocol with Pseudoprimes
Sort
View
SIAMCOMP
2008
154views more  SIAMCOMP 2008»
13 years 4 months ago
Cryptography in the Bounded-Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
ASIACRYPT
2008
Springer
13 years 8 months ago
Limits of Constructive Security Proofs
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
Michael Backes, Dominique Unruh
FC
2010
Springer
163views Cryptology» more  FC 2010»
13 years 10 months ago
A Traceability Attack against e-Passports
Since 2004, many nations have started issuing “e-passports” containing an RFID tag that, when powered, broadcasts information. It is claimed that these passports are more secur...
Tom Chothia, Vitaliy Smirnov
DATE
2005
IEEE
116views Hardware» more  DATE 2005»
13 years 12 months ago
Uniformly-Switching Logic for Cryptographic Hardware
Recent work on Differential Power Analysis shows that even mathematically-secure cryptographic protocols may be vulnerable at the physical implementation level. By measuring energ...
Igor L. Markov, Dmitri Maslov
INFOCOM
2012
IEEE
11 years 8 months ago
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya