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

Source URL: www.pepper-project.org

• Cryptography
• Randomized algorithms
• Computational complexity theory
• Mathematics
• Probabilistically checkable proof
• Complexity classes
• Interactive proof system
• IP
• NP
• Soundness
• PCP theorem
• Commitment scheme

An extended abstract of this paper appears in Victor Shoup, editor, Advances in Cryptology – CRYPTO 2005, Volume 3621 of Lecture Notes in Computer Science, pages 205–222, Santa Barbara, California, August 14 – 18,

Source URL: www.neven.org

• Cryptography
• Public-key cryptography
• Identity-based cryptography
• ID-based encryption
• Advantage
• Paillier cryptosystem
• BonehFranklin scheme

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

Source URL: www.pepper-project.org

• Computational complexity theory
• Logic
• Mathematics
• Randomized algorithms
• Automated theorem proving
• Logic programming
• Probabilistically checkable proof
• IP
• NP
• Substitution
• MAX-3SAT
• operator

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

Source URL: www.pepper-project.org

PDF Document

Source URL: victor.callaghan.info

PDF Document

Source URL: victor.callaghan.info

PDF Document

Source URL: victor.chahuneau.fr

PDF Document

Source URL: victor.callaghan.info

PDF Document

Source URL: victor.callaghan.info

PDF Document

Source URL: victor.callaghan.info