COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Quadratic Span Programs for Succinct NIZKs without PCPs
Quadratic Span Programs for Succinct NIZKs without PCPsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani. Semantics and Syntax: A Legacy of Alan Turing We introduce a new characterization of the NP complexity class, called “Quadratic Span Programs” (QSPs), which is a natural extension of “span programs” by Karchmer and Wigderson. Our main motivation is the construction of succinct arguments of NP-statements that are quickly constructible and verifiable. QSPs seem well-suited for this task, perhaps even better than Probabilistically Checkable Proofs (PCPs). In 2010, Groth constructed a NIZK argument in the common reference string (CRS) model for Circuit-SAT consisting of only 42 elements in a bilinear group. Interestingly, his argument does not (explicitly) use PCPs. But his scheme has some disadvantages—namely, the CRS size and prover computation are both quadratic in the circuit size. In 2011, Lipmaa reduced the CRS size to quasi-linear, but with prover computation still quadratic. Using QSPs we construct a NIZK argument in the CRS model for Circuit-SAT consisting of just 7 group elements. The CRS size is linear in the circuit size, and prover computation is quasi-linear, making our scheme seemingly quite practical. (The prover only needs to do a linear number of group operations; the quasi-linear computation is a multipoint evaluation.) Our results are complementary to those of Valiant (TCC 2008) and Bitansky et al. (2012), who use ``bootstrapping” (recursive composition) of arguments to reduce CRS size and prover and verifier computation. QSPs also provide a crisp mathematical abstraction of some of the techniques underlying Groth’s and Lipmaa’s constructions. Joint work with Rosario Gennaro, Bryan Parno, and Mariana Raykova. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCentre Family Research/Psych Educational Leadership, Policy, Evaluation and Change (ELPEC) Academic Group Kettle's Yard ARTcrowdOther talksProtein Folding, Evolution and Interactions Symposium From dry to wet granular media Art speak Regulators of Muscle Stem Cell Fate and Function Hunting for cacti in the caribbean Babraham Lecture - Deciphering the gene regulation network in human germline cells at single-cell & single base resolution 'Cryptocurrency and BLOCKCHAIN – PAST, PRESENT AND FUTURE' Disease Migration Art and Migration An approach to the four colour theorem via Donaldson- Floer theory Single Cell Seminars (October) A compositional approach to scalable statistical modelling and computation |