搜索结果: 1-8 共查到“interactive arguments”相关记录8条 . 查询时间(0.062 秒)
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
parallel repetition interactive argument smooth KL-divergence
2019/4/22
Soundness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of...
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments
ZTHE underlying cryptographic primitives
2017/9/25
We define and study zero-testable homomorphic encryption (ZTHE) -- a semantically secure, somewhat homomorphic encryption scheme equipped with a weak zero test that can identify trivial zeros. These a...
On the Size of Pairing-based Non-interactive Arguments
SNARKs non-interactive zero-knowledge arguments linear interactive proofs
2016/3/9
Non-interactive arguments enable a prover to convince a verifier that a statement
is true. Recently there has been a lot of progress both in theory and practice on
constructing highly efficient non-...
Publicly Verifiable Non-Interactive Arguments for Delegating Computation
Non-Interactive Arguments Delegating Computation
2016/1/5
We construct publicly verifiable non-interactive arguments that can be used to delegate polynomial
time computations. These computationally sound proof systems are completely non-interactive
in the ...
Succinct Non-Interactive Arguments for a von Neumann Architecture
Succinct Non-Interactive Arguments a von Neumann Architecture
2014/3/5
We design and build a system that enables clients to verify the outputs of programs executed by
untrusted servers. A server provides a succinct non-interactive zero-knowledge proof (also known as a
...
Succinct Non-Interactive Arguments via Linear Interactive Proofs
foundations / interactive proofs probabilistically-checkable proofs
2013/2/21
\emph{Succinct non-interactive arguments} (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the...
From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again
foundations / CS proofs proofs of knowledge knowledge assumptions knowledge of exponent knapsack
2012/3/26
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-sound proofs where the verifier's work is essentially independent of the complexity of the NP nondeter...
Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions
black-box separation computationally sound proofs
2010/11/30
In this paper, we study succinct computationally sound proofs (arguments) for NP, whose communication complexity is polylogarithmic the instance and witness sizes. The seminal works of Kilian '92 and ...