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

Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup

Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee

Published Jan 1, 2024• 18 citations
Publisher
DOI
10.1007/978-3-031-68403-6_7

Related papers

Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis

Hoeteck Wee, David J. Wu

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

An Extended Survey Concerning the Vector Commitments

Maria Nuțu, Giorgi Akhalaia, Răzvan Bocu +1 more

Commitment schemes represent foundational cryptographic primitives enabling secure verification protocols across diverse applications, from blockchain systems to zero-knowledge proofs. This paper presents a systematic survey of vector, polynomial, and functional commitment schemes, analyzing their evolution from classical constructions to post-quantum secure alternatives. We examine the strengths and limitations of RSA-based, Diffie–Hellman, and lattice-based approaches, highlighting the critical shift toward quantum-resistant designs necessitated by emerging computational threats. The survey reveals that while lattice-based schemes (particularly those using the Short Integer Solution problem) offer promising security guarantees, they face practical challenges in proof size and verification efficiency. Functional commitments emerge as a powerful generalization, though their adoption is constrained by computational overhead and setup requirements. Key findings identify persistent gaps in adaptive security, composability, and real-world deployment, while proposed solutions emphasize optimization techniques and hybrid approaches. By synthesizing over 90 research works, this paper provides both a comprehensive reference for cryptographic researchers and a roadmap for future developments in commitment schemes, particularly in addressing the urgent demands of post-quantum cryptography and decentralized systems.

Applied Sciences•Aug 29, 2025•4 citations

VPS: A Verkle-Based Polynomial Signature Scheme with Post-Quantum Security

Maria Nuțu, Răzvan Bocu, Maksim Iavich

With the development of large-scale quantum computers, classical cryptographic algorithms such as RSA or ECC can easily be broken by Shor’s algorithm. Consequently, the cryptography community is shifting its focus toward Post-Quantum Cryptography (PQC), developing primitives that are secure against both classical and quantum attacks. In this paper, we propose a novel Verkle-Polynomial Signature (VPS) scheme by combining the lattice-based polynomial commitment scheme of Cini et al. with Verkle trees and a lattice-based One-Time Signature (OTS) engine to achieve post-quantum security. We demonstrate that while sacrificing the operational efficiency and structural maturity of traditional hash-based signatures, our framework provides robust post-quantum security guarantees inherited from standard lattice assumptions.

Mathematics•Jun 9, 2026•0 citations

Advances in Lattice-Based Cryptography for Post-Quantum Security: Protocols, Benchmarks, and Applications

G. Sunil, B. Girirajan, Manda Sai Anjani

Lecture notes in networks and systems•Jun 29, 2026•0 citations

Post-quantum cryptography: lattice signatures

Johannes A Buchmann, Richard Lindner, Markus Rückert +1 more

Computing•May 25, 2009•18 citations

Quantum-Safe Threshold Cryptography for Decentralized Group Key Management via Dealerless DKG (CRYSTALS–Kyber)

P.S. Renisha, Bhawana Rudra

Post-quantum threshold cryptography requires complete elimination of classical assumptions to achieve genuine quantum resistance. This work presents a fully lattice-based dealerless distributed key generation (DKG) protocol with threshold CRYSTALS–Kyber implementation. We implemented a four-phase DKG protocol using lattice-based primitives: SIS-based commitments for verification, Ring-LWE secret sharing, and secure multi-party key derivation without reconstructing private keys. Our approach eliminates the need for a trusted dealer while maintaining 192-bit post-quantum security through exclusive reliance on lattice problems. Experimental evaluation demonstrates 𝒪(n2) communication complexity for lattice-based DKG setup across 3-20 participants, with secure threshold operations preserving key secrecy. Security analysis provides formal reductions to Ring-LWE and Ring-SIS assumptions, ensuring genuine quantum resistance throughout the protocol stack.

Mathematics•Oct 28, 2025•3 citations
Commitment schemes represent foundational cryptographic primitives enabling secure verification protocols across diverse applications, from blockchain systems to zero-knowledge proofs. This paper presents a systematic survey of vector, polynomial, and functional commitment schemes, analyzing their evolution from classical constructions to post-quantum secure alternatives. We examine the strengths and limitations of RSA-based, Diffie–Hellman, and lattice-based approaches, highlighting the critical shift toward quantum-resistant designs necessitated by emerging computational threats. The survey reveals that while lattice-based schemes (particularly those using the Short Integer Solution problem) offer promising security guarantees, they face practical challenges in proof size and verification efficiency. Functional commitments emerge as a powerful generalization, though their adoption is constrained by computational overhead and setup requirements. Key findings identify persistent gaps in adaptive security, composability, and real-world deployment, while proposed solutions emphasize optimization techniques and hybrid approaches. By synthesizing over 90 research works, this paper provides both a comprehensive reference for cryptographic researchers and a roadmap for future developments in commitment schemes, particularly in addressing the urgent demands of post-quantum cryptography and decentralized systems.
With the development of large-scale quantum computers, classical cryptographic algorithms such as RSA or ECC can easily be broken by Shor’s algorithm. Consequently, the cryptography community is shifting its focus toward Post-Quantum Cryptography (PQC), developing primitives that are secure against both classical and quantum attacks. In this paper, we propose a novel Verkle-Polynomial Signature (VPS) scheme by combining the lattice-based polynomial commitment scheme of Cini et al. with Verkle trees and a lattice-based One-Time Signature (OTS) engine to achieve post-quantum security. We demonstrate that while sacrificing the operational efficiency and structural maturity of traditional hash-based signatures, our framework provides robust post-quantum security guarantees inherited from standard lattice assumptions.
Post-quantum threshold cryptography requires complete elimination of classical assumptions to achieve genuine quantum resistance. This work presents a fully lattice-based dealerless distributed key generation (DKG) protocol with threshold CRYSTALS–Kyber implementation. We implemented a four-phase DKG protocol using lattice-based primitives: SIS-based commitments for verification, Ring-LWE secret sharing, and secure multi-party key derivation without reconstructing private keys. Our approach eliminates the need for a trusted dealer while maintaining 192-bit post-quantum security through exclusive reliance on lattice problems. Experimental evaluation demonstrates 𝒪(n2) communication complexity for lattice-based DKG setup across 3-20 participants, with secure threshold operations preserving key secrecy. Security analysis provides formal reductions to Ring-LWE and Ring-SIS assumptions, ensuring genuine quantum resistance throughout the protocol stack.