# Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP

FOCS, pp. 355-366, 2006.

EI
Keywords:
succinct non-interactive zero-knowledge proofscomputationally soundpoly-logarithmic sizen statementsize polyMore(12+)

Abstract:

Let \Lambda: {0, 1}^n 脳 {0, 1}^m \to {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y \in {0, 1}^m be an input known only to Alice. Assume that Alice and Bob interacted in the past in a preamble phase (that is, applied a preamble protocol that depends only ...More

Code:

Data: