Author:
Crépeau Claude,Salvail Louis,Simard Jean-Raymond,Tapp Alain
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Aravind, P.K.: Bell’s theorem without inequalities and only two distant observers. Foundation of Physics Letters, 397–405 (2002)
2. Brassard, G., Crépeau, C., Mayers, D., Salvail, L.: Defeating classical bit commitment schemes with a quantum computer. ArXiv Quantum Physics e-prints (1998)
3. Buhrman, H., Christandl, M., Unger, F., Wehner, S., Winter, A.: Implications of superstrong nonlocality for cryptography. Proceedings of The Royal Society A 462(2071), 1919–1932 (2006)
4. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3–40 (1991)
5. BenOr, M., Goldwasser, S., Kilian, J., Widgerson, A.: Multi-prover interactive proofs: how to remove intractability. In: STOC 1988: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 113–131. ACM Press, New York (1988)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献