Corpus ID: 16892153

Incrementally verifiable computation or knowledge implies time/space efficiency

@inproceedings{Valiant2007IncrementallyVC,
  title={Incrementally verifiable computation or knowledge implies time/space efficiency},
  author={Paul Valiant},
  year={2007}
}
The probabilistically checkable proof (PCP) system enables proofs to be verified in time polylogarithmic in the length of a classical proof. Computationally sound (CS) proofs improve upon PCPs by additionally shortening the length of the transmitted proof to be polylogarithmic in the length of the classical proof. In this thesis we explore the ultimate limits of non-interactive proof systems with respect to time/space efficiency and the new criterion of composability. We deduce the existence of… Expand

References

SHOWING 1-10 OF 18 REFERENCES
Computationally Sound Proofs
TLDR
If a special type of computationally sound proof exists, it is shown that Blum's notion of program checking can be meaningfully broadened so as to prove that $\cal N \cal P$-complete languages are checkable. Expand
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
TLDR
A superlogarithmic lower bound on the number of hash function evaluations for such online extractable proofs is given, matching the number in the construction, and how to enhance security of the group signature scheme suggested recently by Boneh, Boyen and Shacham with its construction is shown. Expand
Proof verification and the hardness of approximation problems
TLDR
It is proved that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P, and there exists a positive ε such that approximating the maximum clique size in an N-vertex graph to within a factor of Nε is NP-hard. Expand
Probabilistic checking of proofs; a new characterization of NP
  • Sanjeev Arora, S. Safra
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
TLDR
The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs can be verified probabilistically in polynomial time using logarithmic number of random bits and sub-logarital number of queries to the proof. Expand
Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments
We present a zero-knowledge proof system [19] for any NP language L, which allows showing that x in L with error probability less than 2^−k using communication corresponding to O(|x|^c) + k bitExpand
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
TLDR
The protocols presented have the smallest known asymptotic communication complexity among general proofs or arguments for NP, and are also proofs of knowledge of an NP-witness of membership in the language involved. Expand
On Deniability in the Common Reference String and Random Oracle Model
TLDR
It is shown that there exist a specific natural security property that is not captured by these definitions of zero-knowledge, and the notion of deniable zero- knowledge is formally defined in these models. Expand
Robust pcps of proximity, shorter pcps and applications to coding
TLDR
The techniques include the introduction of a new variant of PCPs that are called "Robust PCPs", which facilitate proof composition, which is a central ingredient in construction of PCP systems. Expand
Locally testable codes and PCPs of almost-linear length
TLDR
The novel techniques in use include a random projection of certain codewords and PCP-oracles that preserves local-testability, an adaptation of PCP constructions to obtain “linear PCP” for proving conjunctions of linear conditions, and design of PCPs with some new soundness properties. Expand
The knowledge complexity of interactive proof-systems
Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage. rhe ACM copyright notice and the title ofExpand
...
1
2
...