搜索结果: 1-4 共查到“军事学 succinct non-interactive arguments”相关记录4条 . 查询时间(0.097 秒)
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 ...