搜索结果: 1-8 共查到“Multi-Prover”相关记录8条 . 查询时间(0.063 秒)
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
quasi-optimal SNARGs linear MIPs linear PCPs
2018/2/8
This work gives the first quasi-optimal SNARG for Boolean circuit satisfiability from a concrete cryptographic assumption. Our construction takes a two-step approach. The first is an information-theor...
New Perspectives on Multi-Prover Interactive Proofs
New Perspectives Multi-Prover Interactive Proofs
2018/1/19
The existing multi-prover interactive proof framework suffers from incompleteness in terms of soundness and zero-knowledge that is not completely addressed in the literature. The problem is that the e...
Multi-Prover Interactive Proofs: Unsound Foundations
cryptographic protocols Zero-Knowledge
2017/3/9
Several Multi-Prover Interactive Proofs (MIPs) found in the literature contain proofs of soundness that are lacking. This was first observed by Crépeau, Salvail, Simard and Tapp who defined a notion o...
There has been considerable recent interest in “cloud storage” wherein a user asks a server to
store a large file. One issue is whether the user can verify that the server is actually storing the fil...
Multi-Prover Commitments Against Non-Signaling Attacks
non-signaling bit-commitment multi-prover
2015/12/30
We reconsider the concept of two-prover (and more generally:
multi-prover) commitments, as introduced in the late eighties in the
seminal work by Ben-Or et al. As was recently shown by Cr磂peau et al...
Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs
Witness Based Cryptography Multi-Prover Interactive Proofs
2015/12/21
Motivated by the goal of removing trusted setup assumptions from cryptography, we introduce the
notion of witness signatures. This primitive allows any party with a valid witness to an NP statement t...
Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements
Entangled Measurements Short Multi-Prover Quantum
2010/11/8
BellQMA protocols are a subclass of multi-prover quantum Merlin-Arthur protocols in which the verifier is restricted to perform nonadaptive,unentangled measurements on the quantum states received from...
Generalized Tsirelson Inequalities, Commuting-Operator Provers and Multi-Prover Interactive Proof Systems
Commuting-Operator Provers Multi-Prover Interactive Proof Systems
2012/11/30
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as multi-prover interactive ...