Security of digital signature schemes in weakened random oracle models

Authors:
Akira Numayama;Toshiyuki Isshiki;Keisuke Tanaka
Affiliations:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan and NEC Corporation, Kawasaki, Kanagawa, Japan;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan
Venue:
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Year:
2008

Citing 12
Cited 4

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Optimal Security Proofs for PSS and Other Signature Schemes

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
RSA-OAEP Is Secure under the RSA Assumption

Journal of Cryptology
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Constructing an ideal hash function from weak ideal compression functions

SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Hash-and-sign with weak hashing made secure

ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Random oracles and auxiliary input

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strengthening digital signatures via randomized hashing

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Leaky Random Oracle (Extended Abstract)

ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
On the Weak Ideal Compression Functions

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Security of encryption schemes in weakened random oracle models

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Generalized first pre-image tractable random oracle model and signature schemes

ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formalize the notion of several weakened random oracle models in order to capture which property of a hash function is crucial to prove the security of a cryptographic scheme. In particular, we focus on augmenting the random oracle with additional oracles that respectively return collisions, secondpreimages, and first-preimages. We study the security of the full domain hash signature scheme, as well as three variants thereof in the weakened random oracle models, leading to a separation result.