Pepper - PDFSEARCH.IO - Document Search Engine

Pepper
Results: 2653

#	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	Evolving Specification Engineering Dusko Pavlovic, Peter Pepper, Doug Smith Email: {dusko,smith}@kestrel.edu, Kestrel Institute and Technische Universit¨ at Berlin Add to Reading List Source URL: www.kestrel.edu Language: English - Date: 2012-08-02 20:29:47 Concurrent computing Liveness Temporal logic Safety property Category theory Computation tree logic Morphism Dual Category Natural transformation Mathematics Mathematical logic
5	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
6	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
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	Full Accounting for Verifiable Outsourcing Riad S. Wahby⋆ abhi shelat‡ Justin Thaler△ ⋆ Stanford Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54
9	Verifiable ASICs Riad S. Wahby⋆◦ Max Howald† Siddharth Garg⋆ Add to Reading List Source URL: www.pepper-project.org Language: English - Date: 2017-11-11 14:59:54 Cryptography IP Cryptographic protocols NP Soundness Non-interactive zero-knowledge proof XTR Proof of secure erasure
10	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

UPDATE