Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Masayuki Fukumitsu, Shingo Hasegawa

Published Jan 1, 2020• 37 citations
Publisher
DOI
10.1007/978-3-030-62576-4_3

Related papers

Provable Secure Post-Quantum Signature Scheme Based on Isomorphism of Polynomials in Quantum Random Oracle Model

Bagus Santoso, Chunhua Su

Lecture notes in computer science•Jan 1, 2017•2 citations

Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model

Ernest Foo, Qinyi Li

Lecture notes in computer science•Jan 1, 2023•2 citations

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

Masayuki Fukumitsu, Shingo Hasegawa

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.

•Jan 1, 2021•0 citations

Lattice-Based Non-interactive Blind Signature Schemes in the Random Oracle Model

Haoqi Zhang, Xinjian Chen, Qiong Huang

Lecture notes in computer science•Jan 1, 2025•2 citations

Single-round Lattice-based Multisignatures

Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M.A. Hasan

This work presents a provably-secure lattice-based multisignature scheme which requires only a single round of communication, whereas the existing works need two or three rounds. The reduction in the number of rounds for the proposed scheme is achieved by utilizing lattice trapdoors. In order to generate multisignatures securely, our scheme however requires an honest centralized server that maintains the trapdoor of a shared matrix used in the scheme.

International Symposium on Computing and Networking Workshops (CANDARW)•Nov 1, 2021•1 citation

A provable secure signature in the quantum random oracle model

Zhen Zhang, Huiyan Chen, Yufan Chen

With the development of quantum computation, quantum computers will break the almost classical cryptography. It is imminent to design post-quantum cryptography algorithm that could resist quantum adversaries. Lattice-based problem has been verified that could resist quantum attacks. Our goal is to design a signature and try to prove it is secure in the quantum random oracle model. Our new signature scheme is redesigned based on the signature proposed by Lyu, but that scheme only proved secure in the random oracle model. The difference between the two signature is that we introduce the middle-product operation. So our signature is based on middle-product LWE hard assumption, which enjoys a security proof from PL WE. Then we combine the secure chameleon hash function and our new scheme, prove that our new combined signature is still secure in the quantum random oracle model.

International Conference on Blockchain Technology and Information Security (ICBCTIS)•Jul 1, 2022•4 citations
With the development of quantum computation, quantum computers will break the almost classical cryptography. It is imminent to design post-quantum cryptography algorithm that could resist quantum adversaries. Lattice-based problem has been verified that could resist quantum attacks. Our goal is to design a signature and try to prove it is secure in the quantum random oracle model. Our new signature scheme is redesigned based on the signature proposed by Lyu, but that scheme only proved secure in the random oracle model. The difference between the two signature is that we introduce the middle-product operation. So our signature is based on middle-product LWE hard assumption, which enjoys a security proof from PL WE. Then we combine the secure chameleon hash function and our new scheme, prove that our new combined signature is still secure in the quantum random oracle model.