How to Delegate Computations: The Power of No-Signaling Proofs Ran Raz (Weizmann Institute & IAS) Joint work with: Yael Tauman Kalai Ron Rothblum.

Slides:

Advertisements

Similar presentations

Are Quantum States Exponentially Long Vectors? Scott Aaronson (who did and will have an affiliation) (did: IASwill: Waterloo) Distributions over n-bit.

Advertisements

Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson UC Berkeley IAS.

Limitations of Quantum Advice and One-Way Communication Scott Aaronson UC Berkeley IAS Useful?

An Invitation to Quantum Complexity Theory The Study of What We Cant Do With Computers We Dont Have Scott Aaronson (MIT) QIP08, New Delhi BQP NP- complete.

Scott Aaronson Institut pour l'Étude Avançée Le Principe de la Postselection.

The Complexity of Agreement A 100% Quantum-Free Talk Scott Aaronson MIT.

QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.

On the degree of symmetric functions on the Boolean cube Joint work with Amir Shpilka.

Are PCPs Inherent in Efficient Arguments? Guy Rothblum, MIT ) MSR-SVC ) IAS Salil Vadhan, Harvard University.

Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS.

Direct Product : Decoding & Testing, with Applications Russell Impagliazzo (IAS & UCSD) Ragesh Jaiswal (Columbia) Valentine Kabanets (SFU) Avi Wigderson.

Space complexity [AB 4]. 2 Input/Work/Output TM Output.

Quantum Information and the PCP Theorem Ran Raz Weizmann Institute.

Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.

Quantum Computing MAS 725 Hartmut Klauck NTU

Polling With Physical Envelopes A Rigorous Analysis of a Human–Centric Protocol Tal Moran Joint work with Moni Naor.

Quantum Multi-Prover Interactive Proofs with Communicating Provers QIP-2009 Michael Ben-Or Avinatan Hassidim Haran Pilpel.

AM With Multiple Merlins Scott Aaronson MIT Scott Aaronson (MIT) Dana Moshkovitz (MIT) Russell Impagliazzo (UCSD)

Christian Schaffner CWI Amsterdam, Netherlands Position-Based Quantum Cryptography: Impossibility and Constructions Seminar Eindhoven, Netherlands Wednesday,

Gillat Kol (IAS) joint work with Ran Raz (Weizmann + IAS) Interactive Channel Capacity.

Xiaodi Wu with applications to classical and quantum zero-sum games University of Michigan Joint work with Gus Gutoski at IQC, University of Waterloo.

Gillat Kol joint work with Ran Raz Competing Provers Protocols for Circuit Evaluation.

Universal Communication Brendan Juba (MIT) With: Madhu Sudan (MIT)

The Unique Games Conjecture with Entangled Provers is False Julia Kempe Tel Aviv University Oded Regev Tel Aviv University Ben Toner CWI, Amsterdam.

Dana Moshkovitz. Back to NP L  NP iff members have short, efficiently checkable, certificates of membership. Is  satisfiable?  x 1 = truex 11 = true.

Tsuyoshi Ito (McGill U) Hirotada Kobayashi (NII & JST) Keiji Matsumoto (NII & JST) QIP 2009, January 12–16, 2009 arXiv:

How to Delegate Computations: The Power of No-Signaling Proofs Ron Rothblum Weizmann Institute Joint work with Yael Kalai and Ran Raz.

Eran Omri, Bar-Ilan University Joint work with Amos Beimel and Ilan Orlov, BGU Ilan Orlov…!??!!

Short course on quantum computing Andris Ambainis University of Latvia.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Yan Huang, Jonathan Katz, David Evans University of Maryland, University of Virginia Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.

Probabilistically Checkable Arguments Yael Tauman Kalai Microsoft Research Ran Raz Weizmann Institute.

Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.

Computability and Complexity 22-1 Computability and Complexity Andrei Bulatov Hierarchy Theorem.

A Parallel Repetition Theorem for Any Interactive Argument Iftach Haitner Microsoft Research TexPoint fonts used in EMF. Read the TexPoint manual before.

Learning and Fourier Analysis Grigory Yaroslavtsev CIS 625: Computational Learning Theory.

Eric Allender Rutgers University The Audacity of Computational Complexity Theory.

Keeping Secrets with Zero Knowledge Proof Stephanie Lin 6.UAP Concept Talk 1.

EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.

A Counterexample to Strong Parallel Repetition Ran Raz Weizmann Institute.

Xiaodi Wu with applications to classical and quantum zero-sum games EECS, University of Michigan Joint work with Gus Gutoski at IQC, University of Waterloo.

Device-independent security in quantum key distribution Lluis Masanes ICFO-The Institute of Photonic Sciences arXiv:

Presented by: Suparita Parakarn Kinzang Wangdi Research Report Presentation Computer Network Security.

Practical Aspects of Quantum Coin Flipping Anna Pappa Presentation at ACAC 2012.

The computational complexity of entanglement detection Based on and With Gus Gutoski, Patrick Hayden, and Kevin Milner Mark M. Wilde.

André Chailloux, Université Paris 7 and UC Berkeley Or Sattath, the Hebrew University QIP 2012.

Interactive Channel Capacity Ran Raz Weizmann Institute Joint work with Gillat Kol Technion.

Quantum Information Science The size of transistors decreases by half every eighteen months Intel’s 20 and 45 nm transistor Laser MRI Information Theory.

Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.

What are the minimal assumptions needed for infinite randomness expansion? Henry Yuen (MIT) Stellenbosch, South Africa 27 October 2015.

Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.

Gillat Kol (IAS) joint work with Anat Ganor (Weizmann) Ran Raz (Weizmann + IAS) Exponential Separation of Information and Communication.

Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.

Ankit Garg Princeton Univ. Joint work with Mark Braverman Young Kun Ko Princeton Univ. Princeton Univ. Jieming Mao Dave Touchette Princeton Univ. Univ.

NP has log-space verifiers with fixed-size public quantum registers ABUZER YAKARYILMAZ Faculty of Computing University of Latvia A. C. CEM SAY Department.

Verifiable Outsourcing of Computation Ron Rothblum.

Cryptography Resilient to Continual Memory Leakage Zvika Brakerski Weizmann Institute Yael Tauman Kalai Microsoft Jonathan Katz University of Maryland.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.

New Characterizations in Turnstile Streams with Applications

IoT Marketing Specialists

Universal Semantic Communication

Possibilities and Limitations in Computation

Yael Tauman Kalai Area: Cryptography PhD: MIT, with Shafi Goldwasser

How to Delegate Computations: The Power of No-Signaling Proofs

Cynthia Dwork Moni Naor Guy Rothblum

Pseudo-deterministic Proofs

Universal Semantic Communication

Non-Malleable Extractors

Functions By Anand George.

LECTURE 2-9 PSPACE-Complete

Presentation transcript:

How to Delegate Computations: The Power of No-Signaling Proofs Ran Raz (Weizmann Institute & IAS) Joint work with: Yael Tauman Kalai Ron Rothblum

Delegation of Computation

Delegation of Computation: But what if Alice doesn’t trust Bob? Can Bob convince Alice that the computation was done correctly, assuming that Alice doesn’t have the computational power to perform the computation by herself?

Meanwhile on Mars:

The Amazing Martian Engineering:

The Amazing Martian Engineers:

Martian Institute for Technology (MIT): The EXPTIME machine!

Delegating Computation to the Martians: We want the Martians to perform a computation Can they convince us that the computation was done correctly, assuming that we don’t have the computational power to perform the computation ourselves, and that we don’t trust Martians?

Delegating Computation to the Martians: We want the Martians to convince us that a computation was performed correctly

Delegating Computation to the Martians: We want the Martians to convince us that a computation was performed correctly

Delegating Computation to the Martians: We want the Martians to convince us that a computation was performed correctly no communication between the provers: can be guaranteed by special relativity

QIP 2004: [CHTW] Didn’t we forget something???

QIP 2004: [CHTW] Didn’t we forget something??? What if the provers share entangled quantum states??? Maybe they can cheat!!!

No-Signaling Strategies

More general than entangled strategies: All strategies that cannot be used for passing information between the provers

Meanwhile on Earth

Delegation of Computation:

Only one prover

Delegation of Computation: Only one prover and we don’t trust it…

The Approach of Aiello et al.

We Show: The approach works if the MIP has no-signaling soundness

We Show: The approach works if the MIP has no-signaling soundness Corollary: In the cryptographic setting the number of provers can be reduced to 1

Very Recent Application: Quasi-P hardness of approximation of Linear Programing with Preprocessing

Open Problem: What is the power of no-signaling MIP with a constant number of provers? We know that it is between PSPACE and EXP

Thank You!