Short signatures from weaker assumptions

Authors:
Dennis Hofheinz;Tibor Jager;Eike Kiltz
Affiliations:
Institut für Kryptographie und Sicherheit, Karlsruhe Institute of Technology, Germany;Horst-Görtz Institute for IT Security, Ruhr-University, Bochum, Germany;Horst-Görtz Institute for IT Security, Ruhr-University, Bochum, Germany
Venue:
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Year:
2011

Citing 44
Cited 7

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Signature schemes based on the strong RSA assumption

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
On the generation of cryptographically strong pseudorandom sequences

ACM Transactions on Computer Systems (TOCS)
Coding Constructions for Blacklisting Problems without Computational Assumptions

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Incremental Cryptography: The Case of Hashing and Signing

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Key-Insulated Public Key Cryptosystems

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Cramer-Shoup Strong-RSASignature Scheme Revisited

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Direct chosen ciphertext security from identity-based techniques

Proceedings of the 12th ACM conference on Computer and communications security
Generic Constructions of Identity-Based and Certificateless KEMs

Journal of Cryptology
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

Journal of Cryptology
Trapdoors for hard lattices and new cryptographic constructions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Programmable Hash Functions and Their Applications

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Practical Chosen Ciphertext Secure Encryption from Factoring

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Realizing Hash-and-Sign Signatures under Standard Assumptions

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Short and Stateless Signatures from the RSA Assumption

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles

Theoretical Computer Science
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
An improved protocol for demonstrating possession of discrete logarithms and some generalizations

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computationally private information retrieval with polylogarithmic communication

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure hybrid encryption from weakened key encapsulation

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Bounded CCA2-secure encryption

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Asymptotically efficient lattice-based digital signatures

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Signatures on randomizable ciphertexts

PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Efficient authentication from hard learning problems

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Tight proofs for signature schemes without random oracles

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On the generic insecurity of the full domain hash

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Fuzzy identity-based encryption

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A CDH-Based ring signature scheme with short signatures and public keys

FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Bonsai trees, or how to delegate a lattice basis

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient lattice (H)IBE in the standard model

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Generalization of the Selective-ID security model for HIBE protocols

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A practical and tightly secure signature scheme without hash function

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Efficient blind and partially blind signatures without random oracles

TCC'06 Proceedings of the Third conference on Theory of Cryptography
Chosen-Ciphertext security from tag-based encryption

TCC'06 Proceedings of the Third conference on Theory of Cryptography
Pairing-Friendly elliptic curves of prime order

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Short signatures from weaker assumptions

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Programmable Hash Functions and Their Applications

Journal of Cryptology

Short signatures from weaker assumptions

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Two-Dimensional representation of cover free families and its applications: short signatures and more

CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Generic security-amplifying methods of ordinary digital signatures

Information Sciences: an International Journal
On the instantiability of hash-and-sign RSA signatures

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Strong security from probabilistic signature schemes

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Space efficient signature schemes from the RSA assumption

PKC'12 Proceedings of the 15th 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 provide constructions of (m,1)-programmable hash functions (PHFs) for m≥2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into the generic constructions by Hofheinz and Kiltz (J. Cryptol. 2011) to yield digital signature schemes from the strong RSA and strong q-Diffie-Hellman assumptions. As another application of PHFs, we propose new and efficient constructions of digital signature schemes from weaker assumptions, i.e., from the (standard, non-strong) RSA and the (standard, non-strong) q-Diffie-Hellman assumptions. The resulting signature schemes offer interesting tradeoffs between efficiency/signature length and the size of the public-keys. For example, our q-Diffie-Hellman signatures can be as short as 200 bits; the signing algorithm of our Strong RSA signature scheme can be as efficient as the one in RSA full domain hash; compared to previous constructions, our RSA signatures are shorter (by a factor of roughly 2) and we obtain a considerable efficiency improvement (by an even larger factor). All our constructions are in the standard model, i.e., without random oracles.