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

Improved Zero-Knowledge Argument of Encrypted Extended Permutation

Yi Liu, Qi Wang, Siu‐Ming Yiu

Published Jan 1, 2021• 0 citations
Publisher
DOI
10.1007/978-3-030-88323-2_15

Related papers

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Lecture notes in computer science•Jan 1, 2016•40 citations

Zero-knowledge arguments for matrix–vector relations and lattice-based group encryption

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Theoretical Computer Science•Jan 9, 2019•7 citations

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Benoît Libert, San Ling, Khoa Nguyen +1 more

Lecture notes in computer science•Jan 1, 2018•34 citations

Post-Quantum Perfect Zero-Knowledge Arguments for NP From Any One-Way Permutation

Frédéric Dupuis, Rémi Ligez, Khaireddine Medhioub +2 more

In this paper, we show for the first time that post-quantum one-way permutations are sufficient for perfect zero-knowledge classical arguments for all of NP with security guaranteed against quantum adversaries. We first establish that Naor, Ostrovsky,Venkatesen, and Yung's bit commitment scheme built from any permutation using interactive hashing, called the NOVY scheme, is sum-binding and collapse-binding against quantum polynomial-time committers provided the permutation is post-quantum one-way. We then show that the collapse-binding property of the NOVY scheme allows for Blum's perfect zero-knowledge argument for HAMCYCLE to remain so exactly as it stands against quantum adversaries.

quant-pharXiv:2610.33185•Oct 27, 2026•1 citation

Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications

Rupeng Yang, Man Ho Au, Zhenfei Zhang +3 more

Lecture notes in computer science•Jan 1, 2019•114 citations

Lattice-based zero-knowledge arguments for additive and multiplicative relations

Veronika Kuchta, Amin Sakzad, Ron Steinfeld +1 more

Designs Codes and Cryptography•Mar 2, 2021•4 citations
In this paper, we show for the first time that post-quantum one-way permutations are sufficient for perfect zero-knowledge classical arguments for all of NP with security guaranteed against quantum adversaries. We first establish that Naor, Ostrovsky,Venkatesen, and Yung's bit commitment scheme built from any permutation using interactive hashing, called the NOVY scheme, is sum-binding and collapse-binding against quantum polynomial-time committers provided the permutation is post-quantum one-way. We then show that the collapse-binding property of the NOVY scheme allows for Blum's perfect zero-knowledge argument for HAMCYCLE to remain so exactly as it stands against quantum adversaries.