From post

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier.

, , и . EUROCRYPT (2), том 13276 из Lecture Notes in Computer Science, стр. 275-304. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE., , , и . ESORICS (2), том 12973 из Lecture Notes in Computer Science, стр. 608-627. Springer, (2021)Linear-Time Arguments with Sublinear Verification from Tensor Codes., , и . TCC (2), том 12551 из Lecture Notes in Computer Science, стр. 19-46. Springer, (2020)Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification., , и . CRYPTO (2), том 14082 из Lecture Notes in Computer Science, стр. 227-251. Springer, (2023)Designing efficient zero-knowledge proofs in the ideal linear commitment model.. University College London, UK, (2019)British Library, EThOS.Sumcheck Arguments and Their Applications., , и . CRYPTO (1), том 12825 из Lecture Notes in Computer Science, стр. 742-773. Springer, (2021)The Sumcheck Protocol., , и . Arch. Formal Proofs, (2024)A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge., , , и . CRYPTO (2), том 12171 из Lecture Notes in Computer Science, стр. 441-469. Springer, (2020)Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier., , и . EUROCRYPT (2), том 13276 из Lecture Notes in Computer Science, стр. 275-304. Springer, (2022)Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs., , и . CRYPTO (1), том 11692 из Lecture Notes in Computer Science, стр. 176-202. Springer, (2019)A Framework for Practical Anonymous Credentials from Lattices., , , и . CRYPTO (2), volume 14082 of Lecture Notes in Computer Science, page 384-417. Springer, (2023)