Article

A Lattice-Based Provably Secure Multisignature Scheme in Quantum Random Oracle Model

Authors:

Masayuki Fukumitsu,

Shingo HasegawaAuthors Info & Claims

Provable and Practical Security: 14th International Conference, ProvSec 2020, Singapore, November 29 – December 1, 2020, Proceedings

Pages 45 - 64

https://doi.org/10.1007/978-3-030-62576-4_3

Published: 29 November 2020 Publication History

Abstract

The multisignature schemes are attracted to utilize in some cryptographic applications such as the blockchain. Though the lattice-based constructions of multisignature schemes exist as quantum-secure multisignature, a multisignature scheme whose security is proven in the quantum random oracle model (QROM), rather than the classical random oracle model (CROM), is not known.

In this paper, we propose a first lattice-based multisignature scheme whose security is proven in QROM. The difficultly of proving the security in QROM than CROM is how to program the random oracle in the security proof. Although our proposed scheme is based on the Dilithium-QROM signature whose security is proven in QROM, their proof technique cannot be directly applied to the multisignature setting. To solve the problems in the security proof, we develop several proof techniques in QROM. First, we employ the searching query technique by Targi and Unruh to convert the Dilithium-QROM into the multisignature setting. For the second, we develop a new programming technique in QROM, since the conventional programming techniques seem not to work in the multisignature setting of QROM. We combine the programming technique by Unruh with the one by Liu and Zhandry. The new technique enables us to program the random oracle in QROM and to construct the signing oracle in the security proof.

References

[1]

Abdalla M, Fouque PA, Lyubashevsky V, and Tibouchi M Tightly secure signatures from lossy identification schemes J. Cryptol. 2016 29 3 597-631

[2]

Barthe, G., et al.: Masking the GLP lattice-based signature scheme at any order. Cryptology ePrint Archive, Report 2018/381 (2018). https://eprint.iacr.org/2018/381

[3]

Barthe G et al. Nielsen JB, Rijmen V, et al. Masking the GLP lattice-based signature scheme at any order Advances in Cryptology – EUROCRYPT 2018 2018 Cham Springer 354-384

[4]

Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 390–399. ACM, New York (2006).

[5]

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

[6]

de Castro, A.: Quantum one-way permutation over the finite field of two elements. Quantum Inf. Process. 16(6) (2017).

[7]

Damågrd, I., Orlandi, C., Takahashi, A., Tibouchi, M.: Two-round

n

-out-of-

n

and multi-signatures and trapdoor commitment from lattices. Cryptology ePrint Archive, Report 2020/1110 (2020). https://eprint.iacr.org/2020/1110

[8]

Don J, Fehr S, Majenz C, and Schaffner C Boldyreva A and Micciancio D Security of the Fiat-Shamir transformation in the quantum random-oracle model Advances in Cryptology – CRYPTO 2019 2019 Cham Springer 356-383

[9]

Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardware Embed. Syst. 2018(1), 238–268 (2018).

[10]

El Bansarkhani R and Sturm J Foresti S and Persiano G An efficient lattice-based multisignature scheme with applications to bitcoins Cryptology and Network Security 2016 Cham Springer 140-155

[11]

Fiat A and Shamir A Odlyzko AM How to prove yourself: practical solutions to identification and signature problems Advances in Cryptology — CRYPTO 86 1987 Heidelberg Springer 186-194

[12]

Fujisaki E and Okamoto T Secure integration of asymmetric and symmetric encryption schemes J. Cryptol. 2013 26 1 80-101

[13]

Fukumitsu, M., Hasegawa, S.: A tightly-secure lattice-based multisignature. In: Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, APKC 2019, pp. 3–11. ACM, New York (2019). http://doi.acm.org/10.1145/3327958.3329542

[14]

Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 197–206. ACM, New York (2008). http://doi.acm.org/10.1145/1374376.1374407

[15]

Güneysu T, Lyubashevsky V, and Pöppelmann T Prouff E and Schaumont P Practical lattice-based cryptography: a signature scheme for embedded systems Cryptographic Hardware and Embedded Systems - CHES 2012 2012 Heidelberg Springer 530-547

[16]

Itakura K and Nakamura K A public-key cryptosystem suitable for digital multisignature NEC Res. Dev. 1983 71 1-8

[17]

Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS 2003, pp. 155–164. ACM, New York (2003).

[18]

Kiltz, E., Lyubashevsky, V., Schaffner, C.: A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model. Cryptology ePrint Archive, Report 2017/916 (2017). https://eprint.iacr.org/2017/916

[19]

Kiltz E, Lyubashevsky V, and Schaffner C Nielsen JB and Rijmen V A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model Advances in Cryptology - EUROCRYPT 2018 2018 Cham Springer 552-586

[20]

Liu Q and Zhandry M Boldyreva A and Micciancio D Revisiting post-quantum Fiat-Shamir Advances in Cryptology – CRYPTO 2019 2019 Cham Springer 326-355

[21]

Nielsen MA and Chuang IL Quantum Computation and Quantum Information 2000 Cambridge Cambridge University Press

[22]

NIST: Post-quantum cryptography (2017). https://csrc.nist.gov/Projects/Post-Quantum-Cryptography. Accessed 17 Nov 2019

[23]

Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 187–196. ACM, New York (2008). http://doi.acm.org/10.1145/1374376.1374406

[24]

Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999).

[25]

Targhi EE and Unruh D Hirt M and Smith A Post-quantum security of the Fujisaki-Okamoto and OAEP transforms Theory of Cryptography 2016 Heidelberg Springer 192-216

[26]

Unruh D Oswald E and Fischlin M Non-interactive zero-knowledge proofs in the quantum random oracle model Advances in Cryptology - EUROCRYPT 2015 2015 Heidelberg Springer 755-784

[27]

Zhandry M Safavi-Naini R and Canetti R Secure identity-based encryption in the quantum random oracle model Advances in Cryptology – CRYPTO 2012 2012 Heidelberg Springer 758-775

[28]

Zhandry M Boldyreva A and Micciancio D How to record quantum queries, and applications to quantum indifferentiability Advances in Cryptology – CRYPTO 2019 2019 Cham Springer 239-268

Cited By

Gur KKatz JSilde T(2024)Two-Round Threshold Lattice-Based Signatures from Threshold Homomorphic EncryptionPost-Quantum Cryptography10.1007/978-3-031-62746-0_12(266-300)Online publication date: 12-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62746-0_12
Fleischhacker NHerold GSimkin MZhang ZMeng WJensen CCremers CKirda E(2023)Chipmunk: Better Synchronized Multi-Signatures from LatticesProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623219(386-400)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623219
Boudgoust KTakahashi A(2023)Sequential Half-Aggregation of Lattice-Based SignaturesComputer Security – ESORICS 202310.1007/978-3-031-50594-2_14(270-289)Online publication date: 25-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-50594-2_14
Show More Cited By

Index Terms

A Lattice-Based Provably Secure Multisignature Scheme in Quantum Random Oracle Model
1. Security and privacy
  1. Cryptography
    1. Public key (asymmetric) techniques
2. Theory of computation

Index terms have been assigned to the content through auto-classification.

Recommendations

Non-Observable Quantum Random Oracle Model
Post-Quantum Cryptography
Abstract
The random oracle model (ROM), introduced by Bellare and Rogaway (CCS 1993), enables a formal security proof for many (efficient) cryptographic primitives and protocols, and has been quite impactful in practice. However, the security model also ...
Identity-based multi-proxy multi-signature scheme provably secure in random oracle model

A multi-proxy multi-signature scheme is a useful extension of the basic proxy signature scheme, which allows a group of original signers to delegate their signing rights to a group of proxy signers. At the best of our knowledge, no formal security model ...
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model
Information Security and Privacy
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 ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Provable and Practical Security: 14th International Conference, ProvSec 2020, Singapore, November 29 – December 1, 2020, Proceedings

Nov 2020

425 pages

ISBN:978-3-030-62575-7

DOI:10.1007/978-3-030-62576-4

Editors:
Khoa Nguyen
Nanyang Technological University, Singapore, Singapore
,
Wenling Wu
Chinese Academy of Sciences, Beijing, China
,
Kwok Yan Lam
Nanyang Technological University, Singapore, Singapore
,
Huaxiong Wang
Nanyang Technological University, Singapore, Singapore

© Springer Nature Switzerland AG 2020.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 November 2020

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gur KKatz JSilde T(2024)Two-Round Threshold Lattice-Based Signatures from Threshold Homomorphic EncryptionPost-Quantum Cryptography10.1007/978-3-031-62746-0_12(266-300)Online publication date: 12-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62746-0_12
Fleischhacker NHerold GSimkin MZhang ZMeng WJensen CCremers CKirda E(2023)Chipmunk: Better Synchronized Multi-Signatures from LatticesProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623219(386-400)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623219
Boudgoust KTakahashi A(2023)Sequential Half-Aggregation of Lattice-Based SignaturesComputer Security – ESORICS 202310.1007/978-3-031-50594-2_14(270-289)Online publication date: 25-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-50594-2_14
Chen Y(2023): Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free SimulationAdvances in Cryptology – CRYPTO 202310.1007/978-3-031-38554-4_23(716-747)Online publication date: 20-Aug-2023
https://dl.acm.org/doi/10.1007/978-3-031-38554-4_23
Fleischhacker NSimkin MZhang ZYin HStavrou ACremers CShi E(2022)SquirrelProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security10.1145/3548606.3560655(1109-1123)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3548606.3560655
Boschini CTakahashi ATibouchi M(2022)MuSig-L: Lattice-Based Multi-signature with Single-Round Online PhaseAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15979-4_10(276-305)Online publication date: 15-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-15979-4_10
Damgård IOrlandi CTakahashi ATibouchi M(2021)Two-Round n-out-of-n and Multi-signatures and Trapdoor Commitment from LatticesPublic-Key Cryptography – PKC 202110.1007/978-3-030-75245-3_5(99-130)Online publication date: 10-May-2021
https://dl.acm.org/doi/10.1007/978-3-030-75245-3_5

View Options

View options

Media

Figures

Other

Tables

View Table of Contents