Sciweavers

242 search results - page 24 / 49
» Randomness in Cryptography
Sort
View
EUROCRYPT
2005
Springer
15 years 3 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
EUROCRYPT
2004
Springer
15 years 3 months ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
15 years 2 months ago
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...
Omer Horvitz, Virgil D. Gligor
WAIFI
2007
Springer
110views Mathematics» more  WAIFI 2007»
15 years 3 months ago
On Kabatianskii-Krouk-Smeets Signatures
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of ...
Pierre-Louis Cayrel, Ayoub Otmani, Damien Vergnaud
73
Voted
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
15 years 10 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...