1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/39440
DC FieldValue
dc.titleEntanglement-resistant two-prover interactive proof systems and non-adaptive pir's
dc.contributor.authorCleve, R.
dc.contributor.authorGavinsky, D.
dc.contributor.authorJain, R.
dc.date.accessioned2013-07-04T07:41:39Z
dc.date.available2013-07-04T07:41:39Z
dc.date.issued2009
dc.identifier.citationCleve, 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.
dc.identifier.issn15337146
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39440
dc.description.abstractWe 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.
dc.sourceScopus
dc.subjectEntanglement
dc.subjectInteractive proof systems
dc.subjectQuantum computing
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleQuantum Information and Computation
dc.description.volume9
dc.description.issue7-8
dc.description.page0648-0656
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple 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.