Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model

Authors:
Zhenhua Liu;Yupu Hu;Xiangsong Zhang;Fagen Li
Affiliations:
Department of Mathematics, Xidian University, Xi'an, Shaanxi 710071, China and Network and Data Security Key Laboratory of Sichuan Province, University of Electronic Science and Technology of Chin ...;Key Laboratory of Computer Networks and Information Security of Ministry of Education, Xidian University, Xi'an, Shaanxi 710071, China;School of Science, Xi'an Technological University, Xi'an, Shaanxi 710032, China;Network and Data Security Key Laboratory of Sichuan Province, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China
Venue:
Security and Communication Networks
Year:
2013

Citing 27
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Complexity of Lattice Problems

Complexity of Lattice Problems
Generating Hard Instances of the Short Basis Problem

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
On the Security of Joint Signature and Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: 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
An Identity-Based Signature from Gap Diffie-Hellman Groups

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The random oracle methodology, revisited

Journal of the ACM (JACM)
Identity-based ring signatures from RSA

Theoretical Computer Science
Trapdoors for hard lattices and new cryptographic constructions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A secure identity-based proxy multi-signature scheme

Information Sciences: an International Journal
Strongly Unforgeable ID-Based Signatures without Random Oracles

ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
How Risky Is the Random-Oracle Model?

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
An efficient and parallel Gaussian sampler for lattices

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Forward-secure identity-based signature: Security notions and construction

Information Sciences: an International Journal
An Efficient Strong ID-Based Signature Scheme with Unforgeability

FCST '10 Proceedings of the 2010 Fifth International Conference on Frontier of Computer Science and Technology
Generating Shorter Bases for Hard Random Lattices

Theory of Computing Systems
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
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
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
Strongly unforgeable signatures based on computational diffie-hellman

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Efficient identity-based signatures secure in the standard model

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
ID-Based ring signature scheme secure in the standard model

IWSEC'06 Proceedings of the 1st international conference on Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

An identity-based signature scheme from lattices is constructed. The scheme is obtained from a modification of Agrawal, Boneh, and Boyen's lattice identity-based encryption scheme. In this construction, we use two distinct trapdoors for finding short bases. One trapdoor enables the real implementation to generate short bases for all lattices. The other trapdoor enables the simulator to generate short bases for all lattices. Furthermore, the generating short bases are used to sample short vectors as signatures. Our scheme is computationally efficient. The scheme's strong unforgeability is proven in the standard model and rests on the hardness of the small integer solution problem. Finally, we extend the basic construction to obtain a hierarchical identity-based signature scheme. Copyright © 2012 John Wiley & Sons, Ltd.