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

Formal Security Proof For Nonlinear Post-Quantum Digital Signature Schemes

Nguyen Kim Tuan, Nguyễn Thị Phượng Hằng, Hoang Duc Tho, Luu Hong Dung

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.13140/rg.2.2.16992.56323/39

Related papers

Efficient and Secure Digital Signature Scheme for Post Quantum Epoch

Maksim Iavich, Giorgi Iashvili, Sergiy O. Gnatyuk +2 more

Communications in computer and information science•Jan 1, 2021•18 citations

Post-quantum Digital Signature Scheme for Personal Data Security in Communication Network Systems

Maksim Iavich, Giorgi Iashvili, Răzvan Bocu +1 more

Advances in intelligent systems and computing•Jan 1, 2021•4 citations

Quantum signature with formal security proof

Huijuan Liu, Xiangjun Xin, Yuzhuo Han +2 more

Quantum Information Processing•Oct 29, 2025•2 citations

Post-Quantum Blind Signature Schemes

Lukáš Belza

This work addresses the threat that quantum computers pose to conventional digital signatures. It focuses on remote signing scenarios, specifically in the context of national identification systems such as ID Austria. We propose a new blind signature scheme that is secure against quantum attacks, preserves user privacy, and supports remote signing. The construction uses a commitment scheme and a post-quantum digital signature. We formally define the security model and prove that the scheme satisfies the IND-CMA and EUF-CMA properties. We discuss a specific instance using the Dilithium algorithm and other PQ algorithms. The result is a practically deployable scheme suitable for electronic identification and digital services. A novelty is the combination of blind signatures with post-quantum signatures in a remote signing model and the proof of its security.

•Jan 1, 2026•0 citations

Verkle-Based PORST—Post-Quantum Digital Signature Scheme

Maksim Iavich, Sergei Simonovi, Răzvan Bocu

Modern-day cryptographic schemes are threatened by the rapid development of quantum computers, which are capable of solving discrete-logarithm-based problems in a reasonable amount of time. The paper proposes a novel approach to a PORS post-quantum secure signature. The main idea of the proposal is integrating a PORS signature scheme with a Verkle tree, which greatly reduces the signature size compared to a PORST that uses a Merkle tree, while reducing authentication overhead through constant-size vector commitment proofs at each tree level. The work is highly relevant as it proposes a post-quantum digital signature which has compact proofs and at the same time solves the problems of the original HORS signature scheme (subset-resilience problem). The work contributes to the ongoing standardization efforts in post-quantum cryptography by providing a theoretically scalable and efficient signature scheme that balances security, size, and verification speed.

IEEE Access•Jan 1, 2026•0 citations

A survey on the additional proposals for post-quantum digital signature schemes

Jelle Sipkes

•Jul 1, 2025•0 citations
This work addresses the threat that quantum computers pose to conventional digital signatures. It focuses on remote signing scenarios, specifically in the context of national identification systems such as ID Austria. We propose a new blind signature scheme that is secure against quantum attacks, preserves user privacy, and supports remote signing. The construction uses a commitment scheme and a post-quantum digital signature. We formally define the security model and prove that the scheme satisfies the IND-CMA and EUF-CMA properties. We discuss a specific instance using the Dilithium algorithm and other PQ algorithms. The result is a practically deployable scheme suitable for electronic identification and digital services. A novelty is the combination of blind signatures with post-quantum signatures in a remote signing model and the proof of its security.
Modern-day cryptographic schemes are threatened by the rapid development of quantum computers, which are capable of solving discrete-logarithm-based problems in a reasonable amount of time. The paper proposes a novel approach to a PORS post-quantum secure signature. The main idea of the proposal is integrating a PORS signature scheme with a Verkle tree, which greatly reduces the signature size compared to a PORST that uses a Merkle tree, while reducing authentication overhead through constant-size vector commitment proofs at each tree level. The work is highly relevant as it proposes a post-quantum digital signature which has compact proofs and at the same time solves the problems of the original HORS signature scheme (subset-resilience problem). The work contributes to the ongoing standardization efforts in post-quantum cryptography by providing a theoretically scalable and efficient signature scheme that balances security, size, and verification speed.