Multi-prover Commitments Against Non-signaling Attacks
暂无分享,去创建一个
[1] R. Raz,et al. How to delegate computations: the power of no-signaling proofs , 2014, Electron. Colloquium Comput. Complex..
[2] Adrian Kent,et al. Unconditionally Secure Bit Commitment , 1998, quant-ph/9810068.
[3] S. Popescu,et al. Quantum nonlocality as an axiom , 1994 .
[4] Robert König,et al. Universally Composable Privacy Amplification Against Quantum Adversaries , 2004, TCC.
[5] A. Shimony,et al. Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .
[6] J. S. BELLt. Einstein-Podolsky-Rosen Paradox , 2018 .
[7] Hoi-Kwong Lo,et al. Is Quantum Bit Commitment Really Possible? , 1996, ArXiv.
[8] S. Fehr,et al. Multi-Prover Commitments Against Non-Signaling Attacks Extended Abstract , 2022 .
[9] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[10] Nan Yang. Zero-Knowledge Multi-Prover Interactive Proofs , 2013 .
[11] J. Bell. On the Einstein-Podolsky-Rosen paradox , 1964 .
[12] Peter Rastall,et al. Locality, Bell's theorem, and quantum mechanics , 1985 .
[13] Dominic Mayers. Unconditionally secure quantum bit commitment is impossible , 1997 .
[14] Louis Salvail,et al. Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation , 2000, EUROCRYPT.
[15] Louis Salvail,et al. Two Provers in Isolation , 2011, ASIACRYPT.