ESPY
发表于 2025-3-26 22:41:21
http://reply.papertrans.cn/17/1673/167242/167242_31.png
切碎
发表于 2025-3-27 02:45:53
How to Prove Statements Obliviously?sults..Prior to this work, there were . for . of these applications. We also investigate the use of this approach in the context of public proof aggregation. These are only a few representative applications that we explore in this paper. We expect our techniques to be widely applicable in many other scenarios.
我不死扛
发表于 2025-3-27 07:54:22
http://reply.papertrans.cn/17/1673/167242/167242_33.png
VOK
发表于 2025-3-27 10:45:08
Adaptively Sound Zero-Knowledge SNARKs for UPgnated verifier model. . is an expressive subclass of . consisting of all . languages where each instance has at most one witness; a designated verifier SNARG (dvSNARG) is one where verification of the SNARG proof requires a private verification key; and such a dvSNARG is reusable if soundness holds
彻底明白
发表于 2025-3-27 15:26:16
http://reply.papertrans.cn/17/1673/167242/167242_35.png
同来核对
发表于 2025-3-27 21:39:27
Zero-Knowledge IOPs Approaching Witness Length few bits from the prover messages. IOPs generalize standard Probabilistically-Checkable Proofs (PCPs) to the interactive setting, and in the few years since their introduction have already exhibited major improvements in main parameters of interest (such as the proof length and prover and verifier
征税
发表于 2025-3-27 21:59:21
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codesant application of a multilinear PCS is constructing Succinct Non-interactive Arguments (SNARKs) from multilinear polynomial interactive oracle proofs (PIOPs). Furthermore, field-agnosticism is a major boon to SNARK efficiency in applications that require (or benefit from) a certain field choice..Ou
consolidate
发表于 2025-3-28 03:40:36
http://reply.papertrans.cn/17/1673/167242/167242_38.png
白杨
发表于 2025-3-28 08:54:51
http://reply.papertrans.cn/17/1673/167242/167242_39.png
过份
发表于 2025-3-28 13:28:28
Greyhound: Fast Polynomial Commitments from Latticesction lies a simple three-round protocol for proving evaluations for polynomials of bounded degree . with verifier time complexity .. By composing it with the LaBRADOR proof system (CRYPTO 2023), we obtain a succinct proof of polynomial evaluation (i.e. polylogarithmic in .) that admits a sublinear