Blumberg - PDFSEARCH.IO - Document Search Engine

Blumberg
Results: 223

#	Item
1	Taking proof-based verified computation a few steps closer to practicality1 Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract. W Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54 Cryptography Randomized algorithms Computational complexity theory Mathematics Probabilistically checkable proof Complexity classes Interactive proof system IP NP Soundness PCP theorem Commitment scheme
2	Verifying computations with state Benjamin Braun, Ariel J. Feldman⋆ , Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin ⋆ University of Pennsylvania Abstract When Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54 Cryptography Distributed computing architecture Parallel computing MapReduce Certificate IP NP Commitment scheme PP Computational complexity theory
3	Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ † Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54
4	Making Argument Systems for Outsourced Computation Practical (Sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract This paper describes the desig Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54 Cryptography Computational complexity theory Randomized algorithms Complexity classes Probabilistically checkable proof Proof theory IP NP NEXPTIME Soundness PCP theorem Commitment scheme
5	Toward practical and unconditional verification of remote computations Srinath Setty∗, Andrew J. Blumberg∗, and Michael Walfish∗ 1 Introduction Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54 Cryptography Computational complexity theory Complexity classes Public-key cryptography Interactive proof system NP NEXPTIME IP Probabilistically checkable proof Commitment scheme Proof of secure erasure Randomized algorithm
6	Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ † Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2014-12-14 14:47:16 Computational complexity theory Theory of computation IP Proof of knowledge NP Zero-knowledge proof Certificate Theoretical computer science Applied mathematics
7	Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54 Computational complexity theory Logic Mathematics Randomized algorithms Automated theorem proving Logic programming Probabilistically checkable proof IP NP Substitution MAX-3SAT operator
8	A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54
9	How to Write a Shidduch Profile Sample profile provided by Mrs. Rochelle Goldberg* Shprintza Faiga Blumberg Birthday: Jan 1, 1993 Age: 23 Height: 5’3” Add to Reading List Source URL: shidduchcenter.org - Date: 2016-06-09 13:04:25
10	New Challenges for Character-Based AI for Games Dami´an Isla and Bruce Blumberg The Synthetic Characters Group, MIT Media Lab 20 Ames St. Cambridge, MA 02139 {naimad, bruce}@media.mit.edu Add to Reading List Source URL: www.naimadgames.com - Date: 2009-05-06 22:22:41