PPT-Multi-Client Non-Interactive Verifiable Computation

Seung Geol Choi Columbia U Jonathan Katz U Maryland Ranjit Kumaresan Technion Carlos Cid Royal Holloway Verifiable Computation Increasing dependence on the cloud Individual devices getting smaller amp smaller. Srinath. . Setty. , Richard McPherson,. Andrew J. Blumberg, and Michael Walfish. The University of Texas at Austin. The motivation is 3. rd. party computing: cloud, volunteers, etc.. We desire the following properties in the above exchange:. Michael Walfish. The University of Texas at Austin. The motivation is 3. rd. party computing: cloud, volunteers, etc.. We desire the following properties in the above exchange:. 1. . Unconditional. , meaning no assumptions about the server. Victor Vu, . Srinath. . Setty. ,. Andrew J. Blumberg, and Michael Walfish. The University of Texas at Austin. This should be:. 1. . Unconditional. , meaning no assumptions about the server. 2. . General-purpose. Rothblum. Publicly . Verifiable Non-Interactive Arguments . for . Delegating . Computation. Meet . Ran. Computational task:. Review submission #. 123. Accept . \ Reject. Delegating Computation.  .  . Professor, Computer Science, UMD. Director, Maryland Cybersecurity Center. . Secure . Computation. Mathematics. Complexity . theory. C. ryptography. Cybersecurity. Science of . Cybersecurity. C. ryptography. Michael Walfish. The University of Texas at Austin. The motivation is 3. rd. party computing: cloud, volunteers, etc.. We desire the following properties in the above exchange:. 1. . Unconditional. , meaning no assumptions about the server. Towards Practical Verifiable Graph Processing. Yupeng. Zhang, . Charalampos. . Papamanthou. and . Jonathan . Katz. University of . Maryland. Agenda. Background of verifiable computation and motivation. Gait and . E. nvironment. Multi-Touch. Ranjit . Kumaresan. (MIT). Based on joint works with . Iddo. . Bentov. (. Technion. ), Tal Moran (IDC), Guy . Zyskind. (MIT). x. f. . (. x,y. ). y. f. . (. x,y. ). Secure Computation. Most general problem in cryptography. Yupeng. Zhang. , Daniel . Genkin. , Jonathan Katz, . Dimitrios. Papadopoulos and . Charalampos. . Papamanthou. . Cloud Computing. Individuals . Companies. Universities. Security Issue: Integrity. Interactive. . Touch. . Screens. Presentation. . Products. Software. Voting. . System. . Interactive projectors. MULTI Touch LED LCD 55"/65“/70“/84“ . Android. TRIUMPH BOARD MULTI Touch LED LCD. Victor Vu, . Srinath. . Setty. ,. Andrew J. Blumberg, and Michael Walfish. The University of Texas at Austin. This should be:. 1. . Unconditional. , meaning no assumptions about the server. 2. . General-purpose. Outsourced Data Streams. Suman Nath. Microsoft Research, . Red. mond. . . Ramarathnam Venkatesan. Microsoft Research India. Red. mond. Cryptographer . Alert. Sensing and Energy Research Group. Publicly verifiable . J. Alex Halderman Brent Waters. . Princeton University SRI International. Complete audit expensive . . seek . probabilistic . guarantee. Who chooses what to audit?. Motivating Example.