Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
نویسندگان
چکیده
Education 06/18 Stanford University (expected) Ph.D. in Computer Science (Specialization: Cryptography and Computer Security) Advised by Dan Boneh 06/13 Stanford University M.S. in Computer Science (Specialization: Artificial Intelligence) 06/13 Stanford University B.S. in Computer Science with Honors and Distinction, Minor in Physics Honors Thesis: End-to-End Text Recognition with Convolutional Neural Networks Advised by Andrew Y. Ng
منابع مشابه
On the Size of Pairing-Based Non-interactive Arguments
Non-interactive arguments enable a prover to convince a verifier that a statement is true. Recently there has been a lot of progress both in theory and practice on constructing highly efficient non-interactive arguments with small size and low verification complexity, so-called succinct non-interactive arguments (SNARGs) and succinct non-interactive arguments of knowledge (SNARKs). Many constru...
متن کاملErratum: Succinct Non-interactive Arguments via Linear Interactive Proofs
Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the length of such arguments; nowadays researches have focused also on minimizing verification time, by drawing motivation from the problem of delegating computation. A common relaxation is a preprocessing S...
متن کاملLattice-Based SNARGs and Their Application to More Efficient Obfuscation
Succinct non-interactive arguments (SNARGs) enable verifying NP computations with substantially lower complexity than that required for classical NP verification. In this work, we first construct a lattice-based SNARG candidate with quasi-optimal succinctness (where the argument size is quasilinear in the security parameter). Further extension of our methods yields the first SNARG (from any ass...
متن کاملMulti-prover Interactive Proofs: Unsound Foundations
Several Multi-Prover Interactive Proofs (MIPs) found in the literature contain proofs of soundness that are lacking. This was first observed [1] in which a notion of Prover isolation is defined to partly address the issue. Furthermore, some existing Zero-Knowledge MIPs suffer from a catastrophic flaw: they outright allow the Provers to communicate via the Verifier. Consequently, their soundness...
متن کاملQuasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
The seminal result that every language having an interactive proof also has a zero-knowledge interactive proof assumes the existence of one-way functions. Ostrovsky and Wigderson (ISTCS 1993) proved that this assumption is necessary: if one-way functions do not exist, then only languages in BPP have zero-knowledge interactive proofs. Ben-Or et al. (STOC 1988) proved that, nevertheless, every la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2018 شماره
صفحات -
تاریخ انتشار 2018