Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/39440
| Title: | Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's | Authors: | Cleve, R. Gavinsky, D. Jain, R. |
Keywords: | Entanglement Interactive proof systems Quantum computing |
Issue Date: | 2009 | Citation: | Cleve, R.,Gavinsky, D.,Jain, R. (2009). Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Information and Computation 9 (7-8) : 0648-0656. ScholarBank@NUS Repository. | Abstract: | We show that every language in NP is recognized by a two-prover interactive proof system with the following properties. The proof system is entanglement-resistant r;1-ε.1/2+ε[2], for any e such that 0 < ε < 1/4). Our result is based on the "oracularizing" property of a particular private information retrieval scheme (PIR), and it suggests that investigating related properties of other PIRs might bear further fruit. | Source Title: | Quantum Information and Computation | URI: | http://scholarbank.nus.edu.sg/handle/10635/39440 | ISSN: | 15337146 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.