Jun 18, 2020 · In this work, we present the first (poly)-logarithmic, potentially post-quantum zero-knowledge arguments that deviate from the PCP approach.
Aug 10, 2020 · In this work, we present the first (poly)-logarithmic, potentially post-quantum zero-knowledge arguments that deviate from the PCP approach.
Duration: 21:54
Posted: Aug 13, 2020
Posted: Aug 13, 2020
Today's most compact zero-knowledge arguments are based on the hardness of the discrete logarithm problem and related classical assumptions.
In this paper, we present a simple bare-bones solution of a Zero-Knowledge authentication protocol which uses non-commutative algebra and a variation of the ...
People also ask
How to explain zero knowledge protocols?
What is the history of zero knowledge proof?
Aug 26, 2020 · Jonathan Bootle , Vadim Lyubashevsky, Ngoc Khanh Nguyen , Gregor Seiler: A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. J. Bootle, V. Lyubashevsky, N. Nguyen, and G. Seiler. CRYPTO (2), volume 12171 of Lecture Notes ...
Publications ; A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. Jonathan Bootle; Vadim Lyubashevsky ; Practical Lattice-Based Zero-Knowledge Proofs for ...
I am a cryptography researcher, currently working on efficient zero-knowledge proofs, especially those based on lattice assumptions or error-correcting codes.
Dec 3, 2022 · A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. Jonathan Bootle; Vadim Lyubashevsky; et al. 2020; CRYPTO 2020. 1 · 2. Resources.