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

Lattice-Based Ring Verifiable Random Functions

Jie Xu, Muhammed F. Esgin, Ron Steinfeld

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-981-92-3018-1_4

Related papers

Post-quantum verifiable random functions from ring signatures.

Endre Abraham

•Jan 1, 2018•4 citations

Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques

Shota Yamada

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

Verifiable Random Function from the Deuring Correspondence and Higher Dimensional Isogenies

Antonin Leroux

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

Turning Uncertainty into Efficiency: Toward Practical, Quantum-Resistant Verifiable Privacy Tools

Jie Xu

Verifiable Random Functions (VRFs) and Oblivious Pseudorandom Functions (OPRFs) are essential cryptographic primitives in privacy-preserving applications such as anonymous authentication, private set intersection (PSI), and decentralized identity. Existing constructions, however, rely on number-theoretic assumptions that are vulnerable to quantum attacks. This PhD research project focuses on constructing efficient and practical VRFs and OPRFs from lattice-based assumptions to ensure post-quantum security. A key obstacle in these constructions is the overhead of zero-knowledge proofs (ZKPs), particularly range proofs, which are costly in terms of size and prover complexity. To address this, we investigate probabilistic techniques that relax exact correctness. In particular, we explore approximate range proofs and algebraic transformations, such as using automorphisms in polynomial rings to simulate inner product arguments via polynomial multiplication. These methods enable more efficient and scalable lattice-based constructions of VRFs, including group and context-bound variants, as well as OPRFs. The goal is to make these primitives practical for deployment in post-quantum privacy-preserving systems.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 19, 2025•0 citations

Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices

Martin R. Albrecht, Alex Davidson, Amit Deo +1 more

Lecture notes in computer science•Jan 1, 2021•49 citations

LATTICE-BASED STRONG DESIGNATE VERIFIER SIGNATURE AND ITS APPLICATIONS

Fenghe Wang, Yupu Hu, Baocang Wang

Motivated by the need to have secure strong designate verifier signatures (SDVS) even in the presence of quantum computers, a post-quantum lattice-based SDVS scheme is proposed based on the hardness of the short integer solution problem (SIS) and the learning with errors problem (LWE). The proposed SDVS scheme utilizes the Bonsai trees and pre-image sample-able function primitives to generate the designate verifier signature (DVS). In this construction, the un- forge-ability is based on the hardness of the SIS problem which is proven in the random oracle model and the non-transferability is based on the hardness of the LWE problem. As an application of the proposed SDVS scheme, we design a strong designate verifier ring signature scheme (SDVRS) which satisfies non-transferability. It is proven that the identity of the signer is unconditionally protected not only for any third-party but also for the designate verifier. Under the hardness of the SIS problem, the proposed SDVRS scheme is proven to be existentially un-forgeable in the random oracle model.

Malaysian Journal of Computer Science•Mar 1, 2012•10 citations
Verifiable Random Functions (VRFs) and Oblivious Pseudorandom Functions (OPRFs) are essential cryptographic primitives in privacy-preserving applications such as anonymous authentication, private set intersection (PSI), and decentralized identity. Existing constructions, however, rely on number-theoretic assumptions that are vulnerable to quantum attacks. This PhD research project focuses on constructing efficient and practical VRFs and OPRFs from lattice-based assumptions to ensure post-quantum security. A key obstacle in these constructions is the overhead of zero-knowledge proofs (ZKPs), particularly range proofs, which are costly in terms of size and prover complexity. To address this, we investigate probabilistic techniques that relax exact correctness. In particular, we explore approximate range proofs and algebraic transformations, such as using automorphisms in polynomial rings to simulate inner product arguments via polynomial multiplication. These methods enable more efficient and scalable lattice-based constructions of VRFs, including group and context-bound variants, as well as OPRFs. The goal is to make these primitives practical for deployment in post-quantum privacy-preserving systems.
Motivated by the need to have secure strong designate verifier signatures (SDVS) even in the presence of quantum computers, a post-quantum lattice-based SDVS scheme is proposed based on the hardness of the short integer solution problem (SIS) and the learning with errors problem (LWE). The proposed SDVS scheme utilizes the Bonsai trees and pre-image sample-able function primitives to generate the designate verifier signature (DVS). In this construction, the un- forge-ability is based on the hardness of the SIS problem which is proven in the random oracle model and the non-transferability is based on the hardness of the LWE problem. As an application of the proposed SDVS scheme, we design a strong designate verifier ring signature scheme (SDVRS) which satisfies non-transferability. It is proven that the identity of the signer is unconditionally protected not only for any third-party but also for the designate verifier. Under the hardness of the SIS problem, the proposed SDVRS scheme is proven to be existentially un-forgeable in the random oracle model.