Cited By
View all- Luo PChen XSusilo WHuang Q(2024)Identity-Based Signature from Lattices Without TrapdoorsInformation and Communications Security10.1007/978-981-97-8801-9_11(211-230)Online publication date: 27-Aug-2024
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model
Authors: 
Ernest Foo, Qinyi LiAuthors Info & Claims
Ernest Foo, Qinyi LiAuthors Info & ClaimsPages 381 - 402
Abstract
We present a quantumly secure identity-based signature scheme based on the standard short integer solution problem, featuring tight security reductions in the quantum and classic random oracle models. The scheme has short signatures. Each signature contains a single lattice vector plus a single bit. Compared to the existing tightly secure, short lattice identity-based signature schemes by Pan and Wagner (PQCrypto’21), our scheme has a shorter signature size (around 30% shorter), stronger unforgeability, relies on a weaker assumption, and has detailed proof in the quantum random oracle model.
References
[1]
Agrawal S, Boneh D, and Boyen X Gilbert H Efficient lattice (H)IBE in the standard model Advances in Cryptology – EUROCRYPT 2010 2010 Heidelberg Springer 553-572
[2]
Blazy O, Kakvi SA, Kiltz E, and Pan J Katz J Tightly-secure signatures from chameleon hash functions Public-Key Cryptography – PKC 2015 2015 Heidelberg Springer 256-279
[3]
Boneh D, Dagdelen Ö, Fischlin M, Lehmann A, Schaffner C, and Zhandry M Lee DH and Wang X Random oracles in a quantum world Advances in Cryptology – ASIACRYPT 2011 2011 Heidelberg Springer 41-69
[4]
Boyen X and Li Q Cheon JH and Takagi T Towards tightly secure lattice short signature and id-based encryption Advances in Cryptology – ASIACRYPT 2016 2016 Heidelberg Springer 404-434
[5]
Cash D, Hofheinz D, Kiltz E, and Peikert C Bonsai trees, or how to delegate a lattice basis J. Cryptol. 2012 25 4 601-639
[6]
Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, pp. 197–206 ACM (2008)
[7]
Gjøsteen K and Jager T Shacham H and Boldyreva A Practical and tightly-secure digital signatures and authenticated key exchange Advances in Cryptology – CRYPTO 2018 2018 Cham Springer 95-125
[8]
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC 1996, pp. 212–219, ACM (1996)
[9]
Katsumata S, Yamada S, and Yamakawa T Peyrin T and Galbraith S Tighter security proofs for GPV-IBE in the quantum random oracle model Advances in Cryptology – ASIACRYPT 2018 2018 Cham Springer 253-282
[10]
Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: CCS 2003, pp. 155–164, ACM (2003)
[11]
Kuchta V, Sakzad A, Stehlé D, Steinfeld R, and Sun S-F Canteaut A and Ishai Y Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security Advances in Cryptology – EUROCRYPT 2020 2020 Cham Springer 703-728
[12]
Lee Y, Park JH, Lee K, and Lee DH Tight security for the generic construction of identity-based signature (in the multi-instance setting) Theor. Comput. Sci. 2020 847 122-133
[13]
Micciancio D and Peikert C Pointcheval D and Johansson T Trapdoors for lattices: simpler, tighter, faster, smaller Advances in Cryptology – EUROCRYPT 2012 2012 Heidelberg Springer 700-718
[14]
Micciancio D and Regev O Worst-case to average-case reductions based on Gaussian measures SIAM J. Comput. 2007 37 1 267-302
[15]
Pan J and Wagner B Cheon JH and Tillich J-P Short identity-based signatures with tight security from lattices Post-Quantum Cryptography 2021 Cham Springer 360-379
[16]
Pan, J., Wagner, B.: Short identity-based signatures with tight security from lattices. Cryptology ePrint Archive, Report 2021/970 (2021). https://eprint.iacr.org/2021/970
[17]
Pan, J., Wagner, B.: Lattice-based signatures with tight adaptive corruptions and more. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) Public-Key Cryptography (PKC 2022). LNCS, vol. 13178, pp. 347–378. Springer, Cham (2022).
[18]
Peikert C A decade of lattice cryptography Found. Trends Theor. Comput. Sci. 2016 10 4 283-424
[19]
Saito T, Xagawa K, and Yamakawa T Nielsen JB and Rijmen V Tightly-secure key-encapsulation mechanism in the quantum random oracle model Advances in Cryptology – EUROCRYPT 2018 2018 Cham Springer 520-551
[20]
Shamir A Blakley GR and Chaum D Identity-based cryptosystems and signature schemes Advances in Cryptology 1985 Heidelberg Springer 47-53
Recommendations
An identity-based strongly unforgeable signature without random oracles from bilinear pairings
This paper proposes an identity-based (ID-based) signature (IBS) scheme which is strongly unforgeable in the standard model whose security is reduced to the hardness of the computational Diffie-Hellman (CDH) problem in bilinear groups. Currently, the ID-...
Revocable and strongly unforgeable identity-based signature scheme in the standard model
Revocation functionality is crucial for the practicality of the public key cryptosystems, especially for that of identity-based cryptosystems. When some users lose their private keys, the cryptosystems must support an efficient revocation method to ...
Identity-based strong designated verifier signature schemes: Attacks and new construction
A strong designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party, and no third party ...
Comments
Information & Contributors
Information
Published In
Jul 2023
657 pages
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 05 July 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
Cited By
View all- Luo PChen XSusilo WHuang Q(2024)Identity-Based Signature from Lattices Without TrapdoorsInformation and Communications Security10.1007/978-981-97-8801-9_11(211-230)Online publication date: 27-Aug-2024