Efficient hierarchical identity-based signatures from lattices

Authors:
Miaomiao Tian;Liusheng Huang;Wei Yang
Affiliations:
School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China;School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China;School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China
Venue:
International Journal of Electronic Security and Digital Forensics
Year:
2013

Citing 16
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Hierarchical ID-Based Cryptography

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues

Proceedings of the 8th IMA International Conference on Cryptography and Coding
Worst-Case to Average-Case Reductions Based on Gaussian Measures

SIAM Journal on Computing
Trapdoors for hard lattices and new cryptographic constructions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
New Construction of Short Hierarchical ID-Based Signature in the Standard Model

Fundamenta Informaticae
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Homomorphic signatures for polynomial functions

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information 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
Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Lattice signatures without trapdoors

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lattice-based hierarchical identity-based signature HIBS schemes are receiving significant attention due to provable security reductions and potential security for quantum computers. However, most of the existing HIBS schemes based on lattices are less efficient for practical applications. To make lattice-based HIBS schemes become more practical, this paper presents an efficient HIBS scheme from lattices. Both the secret key size and the signature length of our proposal are much shorter than those of other lattice-based HIBS proposals. Our scheme is proven to be strongly unforgeable against adaptive identity attacks in the random oracle model. The security of the construction relies on the standard short integer solution SIS assumption.