## Publications## Lattice-Based Non-Interactive Argument SystemsDavid J. Wu ## ResourcesAdvised by Professor Dan Boneh Abstract
Non-interactive argument systems are an important building block in many
cryptographic protocols. In this work, we begin by studying non-interactive
zero-knowledge (NIZK) arguments for general NP languages. In a NIZK
argument system, a prover can convince a verifier that a statement is true
without revealing anything more about the statement. Today, NIZK arguments can
be instantiated from random oracles, or, in the common reference string (CRS)
model, from trapdoor permutations, pairings, or indistinguishability
obfuscation. Notably absent from this list are constructions from lattice
assumptions, and realizing NIZKs (for general NP languages) from lattices has
been a longstanding open problem. In this work, we make progress on this
problem by giving the first construction of a multi-theorem NIZK argument from
standard lattice assumptions in a relaxed model called the We then turn our attention to constructing BibTeX
@phdthesis{Wu18, author = {David J. Wu}, title = {Lattice-Based Non-Interactive Argument Systems}, school = {Stanford University}, year = {2018} } |