Daniel Wichs

Daniel Wichs

Auto-generated profile, based on publicly available information

Daniel Wichs

Northeastern University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 April 2016
Verified
Book Chapter
Closed access
PDF file
PMPratyay Mukherjee
Pratyay Mukherjee
DWDaniel Wichs
Daniel Wichs

24 December 2015
Verified
Book Chapter
Closed access
PDF file
SDSrinivas Devadas
Srinivas Devadas
MDMarten van Dijk
Marten van Dijk
CFChristopher W. Fletcher
Christopher W. Fletcher
LRLing Ren
Ling Ren
ESElaine Shi
Elaine Shi
DWDaniel Wichs
Daniel Wichs

16 June 2021
Verified
Book Chapter
Closed access
PDF file
HWHoeteck Wee
Hoeteck Wee
DWDaniel Wichs
Daniel Wichs


2 June 2023
Verified
Conference Paper
Open access
YKYael Kalai
Yael Kalai
ALAlex Lombardi
Alex Lombardi
VVVinod Vaikuntanathan
Vinod Vaikuntanathan
DWDaniel Wichs
Daniel Wichs
We show how to generically improve the succinctness of non-interactive publicly verifiable batch argument (BARG) systems. In particular, we show (under a mild additional assumption) how to convert a BARG that generates proofs of length poly (m)· k1−є, where m is the length of a single instance and k is the number of instances being batched, into one that generates proofs of length poly (m, logk), which is the gold standard for succinctness of BARGs. By prior work, such BARGs imply the existence of SNARGs for deterministic time T computation with succinctness poly(logT). Our result reduces the long-standing challenge of building publicly-verifiable delegation schemes to a much easier problem: building a batch argument system that beats the trivial construction. It also immediately implies new constructions of BARGs and SNARGs with polylogarithmic succinctness based on either bilinear maps or a combination of the DDH and QR assumptions. Along the way, we prove an equivalence between BARGs and a new notion of SNARGs for (deterministic) RAM computations that we call “flexible RAM SNARGs with partial input soundness.” This is the first demonstration that SNARGs for deterministic computation (of any kind) imply BARGs. Our RAM SNARG notion is of independent interest and has already been used in a recent work on constructing rate-1 BARGs (Devadas et. ‍al. FOCS 2022).

20 June 2018
Verified
Conference Paper
Open access
PDF file
SBSaikrishna Badrinarayanan
Saikrishna Badrinarayanan
YKYael Tauman Kalai
Yael Tauman Kalai
DKDakshita Khurana
Dakshita Khurana
ASAmit Sahai
Amit Sahai
DWDaniel Wichs
Daniel Wichs