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.
Today's most compact zero-knowledge arguments are based on the hardness of the discrete logarithm problem and related classical assumptions.
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.
People also ask
What is the zero knowledge approach?
What are the three properties which a protocol must satisfy to be a zero-knowledge proof?
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. https://doi.org/10.1007/978-3-030-56880-1_16 ·. Journal: Advances in Cryptology – CRYPTO 2020 ...
Aug 26, 2020 · Jonathan Bootle , Vadim Lyubashevsky, Ngoc Khanh Nguyen , Gregor Seiler: A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.
Dec 3, 2022 · There is currently a large performance gap between non-quantum-safe (pairing-based) zero-knowledge proof systems and quantum-safe hash-based ...
I am a cryptography researcher, currently working on efficient zero-knowledge proofs, especially those based on lattice assumptions or error-correcting codes.
Publications ; A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. Jonathan Bootle; Vadim Lyubashevsky; et al. ; Practical Lattice-Based Zero-Knowledge ...