Back to Results
First PageMeta Content
Computational complexity theory / Interactive proof system / NEXPTIME / Probabilistically checkable proof / IP / Cryptographic protocols / Soundness / NP / Zero-knowledge proof / Theoretical computer science / Applied mathematics / Complexity classes


How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗
Add to Reading List

Document Date: 2015-05-01 02:12:54


Open Document

File Size: 1.007,79 KB

Share Result on Facebook

City

Princeton / Reading / /

Company

Interactive Argument Systems / Microsoft / /

Country

Israel / /

Currency

pence / /

/

Event

FDA Phase / /

Facility

Weizmann Institute of Science / /

IndustryTerm

delegation protocol / delegation protocols / proof systems / cloud computing / /

Organization

Federal German Ministry for Education and Research / National Science Foundation / Israel Science Foundation / Institute for Advanced Study / Minerva Foundation / Planning and Budgeting Committee / Weizmann Institute of Science / /

Person

Ron D. Rothblum / Yael Tauman Kalai / /

/

Position

cheating worker / /

Product

GKR08 / LOGSPACEuniform / /

ProvinceOrState

New Jersey / /

RadioStation

CORE / /

Technology

Encryption / 1-round delegation protocol / cryptography / 25 4.7 Public-Key Encryption / constructing one-round delegation protocols / resulting 1-round delegation protocol / /

SocialTag