Crypto Seminar
— 5:30pm
Location:
In Person and Virtual - ET
-
Gates Hillman 7501 and Zoom
Speaker:
LALITA DEVADAS
,
Ph.D. StudentComputer Science & Artificial Intelligence LaboratoryMassachusetts Institute of Technology
https://www.linkedin.com/in/lalita-devadas
Rate-1 non-interactive arguments for batch-NP and applications
We present a rate-1 construction of a publicly verifiable non-interactive argument system for batch-NP (also called a BARG), under the LWE assumption. In our system, a proof corresponding to a batch of k NP statements has size m + poly(lambda, log k), where m is the length of one witness and lambda is the security parameter. In contrast, prior work either relied on non-standard knowledge assumptions, or produced proofs of size at least m * poly(lambda) [KPY19, CJJ21]. We show how to use our rate-1 BARG scheme to obtain the following results under the LWE assumption (which were previously only known in the random oracle model or under non-standard knowledge assumptions): a multi-hop BARG scheme for NP, a multi-hop aggregate signature scheme, and an incrementally verifiable computation (IVC) scheme for arbitrary deterministic computations (beyond P). The Crypto Seminar is generously sponsored by Smart Contract Research Forum
Zoom Participation. See announcement.
Event Website:
https://sites.google.com/view/crypto-seminar/home
For More Information:
kew2@andrew.cmu.edu