Sciweavers

CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
Computational Differential Privacy
Ilya Mironov, Omkant Pandey, Omer Reingold, Salil ...
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
CRYPTO
2009
Springer
101views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
How to Encipher Messages on a Small Domain
Ben Morris, Phillip Rogaway, Till Stegers
CRYPTO
2009
Springer
90views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
Smooth Projective Hashing for Conditionally Extractable Commitments
Michel Abdalla, Céline Chevalier, David Poi...
CRYPTO
2009
Springer
113views Cryptology» more  CRYPTO 2009»
14 years 6 months ago
Abstraction in Cryptography
ion in Cryptography Ueli Maurer ETH Zurich CRYPTO 2009, August 19, 2009
Ueli M. Maurer
CODCRY
2009
Springer
174views Cryptology» more  CODCRY 2009»
14 years 6 months ago
Equal-Weight Fingerprinting Codes
We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new e...
Ilya Dumer
CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
14 years 6 months ago
On the Impossibility of Strong Encryption Over
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
Raphael C.-W. Phan, Serge Vaudenay