On succinct arguments and witness encryption from groups
Succinct non-interactive arguments (SNARGs) enable proofs of NP statements with very low
communication. Recently, there has been significant work in both theory and practice on …
communication. Recently, there has been significant work in both theory and practice on …
Optimal inapproximability with universal factor graphs
The factor graph of an instance of a constraint satisfaction problem (CSP) is the bipartite
graph indicating which variables appear in each constraint. An instance of the CSP is given …
graph indicating which variables appear in each constraint. An instance of the CSP is given …