Relevant bibliographies by topics / Multi-prover interactive proofs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Multi-prover interactive proofs'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multi-prover interactive proofs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multi-prover interactive proofs"

1

Kempe, Julia, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick. "Using Entanglement in Quantum Multi-Prover Interactive Proofs." computational complexity 18, no. 2 (2009): 273–307. http://dx.doi.org/10.1007/s00037-009-0275-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ito, Tsuyoshi. "Parallelization of entanglement-resistant multi-prover interactive proofs." Information Processing Letters 114, no. 10 (2014): 579–83. http://dx.doi.org/10.1016/j.ipl.2014.05.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kobayashi, Hirotada, and Keiji Matsumoto. "Quantum multi-prover interactive proof systems with limited prior entanglement." Journal of Computer and System Sciences 66, no. 3 (2003): 429–50. http://dx.doi.org/10.1016/s0022-0000(03)00035-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Verbitskiĭ, O. V. "ON THE POSSIBILITY OF PERFORMING ANY MULTI-PROVER INTERACTIVE PROOF IN CONSTANTLY MANY ROUNDS." Russian Academy of Sciences. Izvestiya Mathematics 42, no. 3 (1994): 561–86. http://dx.doi.org/10.1070/im1994v042n03abeh001545.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Multi-prover interactive proofs"

1

Yang, Nan. "Zero-Knowledge Multi-Prover Interactive Proofs." Thesis, 2013. http://spectrum.library.concordia.ca/977228/1/Nan%2DYang_MCompSc_S2013.pdf.

Full text
Abstract:
Single-prover interactive proofs can recognize PSPACE; if certain complexity assumptions are made, they can do so in zero-knowledge. Generalizing to multiple non-communicating provers extends this class to NEXP, and at the same time removes the complexity assumption needed for zero-knowledge. However, it was recently discovered that the non-communication condition might be insufficient to guarantee soundness. The provers can form joint randomness through non-local computation without communicating. This could break protocols that rely on the statistical independence of the provers. In this work, we analyze multi-prover interactive proofs under the constraint of statistical isolation which prohibits non-local computation. We show that there exists perfect zero-knowledge proofs for NEXP under statistical isolation.
APA, Harvard, Vancouver, ISO, and other styles
2

Payette, Tommy. "Multi-Prover and parallel repetition in non-classical interactive games." Thèse, 2009. http://hdl.handle.net/1866/3547.

Full text
Abstract:
Depuis l’introduction de la mécanique quantique, plusieurs mystères de la nature ont trouvé leurs explications. De plus en plus, les concepts de la mécanique quantique se sont entremêlés avec d’autres de la théorie de la complexité du calcul. De nouvelles idées et solutions ont été découvertes et élaborées dans le but de résoudre ces problèmes informatiques. En particulier, la mécanique quantique a secoué plusieurs preuves de sécurité de protocoles classiques. Dans ce m´emoire, nous faisons un étalage de résultats récents de l’implication de la mécanique quantique sur la complexité du calcul, et cela plus précisément dans le cas de classes avec interaction. Nous présentons ces travaux de recherches avec la nomenclature des jeux à information imparfaite avec coopération. Nous exposons les différences entre les théories classiques, quantiques et non-signalantes et les démontrons par l’exemple du jeu à cycle impair. Nous centralisons notre attention autour de deux grands thèmes : l’effet sur un jeu de l’ajout de joueurs et de la répétition parallèle. Nous observons que l’effet de ces modifications a des conséquences très différentes en fonction de la théorie physique considérée.
Since the introduction of quantum mechanics, many mysteries of nature have found explanations. Many quantum-mechanical concepts have merged with the field of computational complexity theory. New ideas and solutions have been put forward to solve computational problems. In particular, quantum mechanics has struck down many security proofs of classical protocols. In this thesis, we survey recent results regarding the implication of quantum mechanics to computational complexity and more precisely to classes with interaction. We present the work done in the framework of cooperative games with imperfect information. We give some differences between classical, quantum and no-signaling theories and apply them to the specific example of Odd Cycle Games. We center our attention on two different themes: the effect on a game of adding more players and of parallel repetition. We observe that depending of the physical theory considered, the consequences of these changes is very different.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multi-prover interactive proofs"

1

Crépeau, Claude, and Nan Yang. "Multi-prover Interactive Proofs: Unsound Foundations." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61273-7_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Boneh, Dan, Yuval Ishai, Amit Sahai, and David J. Wu. "Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs." In Advances in Cryptology – EUROCRYPT 2018. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78372-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bitansky, Nir, and Alessandro Chiesa. "Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32009-5_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kobayashi, Hirotada, and Keiji Matsumoto. "Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement." In Algorithms and Computation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36136-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ben-Or, Michael, Shafi Goldwasser, Joe Kilian, and Avi Wigderson. "Multi-prover interactive proofs: how to remove intractability assumptions." In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. Association for Computing Machinery, 2019. http://dx.doi.org/10.1145/3335741.3335758.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multi-prover interactive proofs"

1

Ji, Zhengfeng. "Compression of quantum multi-prover interactive proofs." In STOC '17: Symposium on Theory of Computing. ACM, 2017. http://dx.doi.org/10.1145/3055399.3055441.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kempe, Julia, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick. "Using Entanglement in Quantum Multi-prover Interactive Proofs." In 2008 23rd Annual IEEE Conference on Computational Complexity. IEEE, 2008. http://dx.doi.org/10.1109/ccc.2008.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Or, Michael Ben, Avinatan Hassidim, and Haran Pilpel. "Quantum Multi Prover Interactive Proofs with Communicating Provers." In 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 2008. http://dx.doi.org/10.1109/focs.2008.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ben-Or, Michael, Shafi Goldwasser, Joe Kilian, and Avi Widgerson. "Multi-prover interactive proofs: how to remove intractability." In the twentieth annual ACM symposium. ACM Press, 1988. http://dx.doi.org/10.1145/62212.62223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ito, Tsuyoshi, and Thomas Vidick. "A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers." In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2012. http://dx.doi.org/10.1109/focs.2012.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ito, Tsuyoshi, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew C. C. Yao. "Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems." In 2008 23rd Annual IEEE Conference on Computational Complexity. IEEE, 2008. http://dx.doi.org/10.1109/ccc.2008.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography