Incrementally verifiable computation or knowledge implies time/space efficiency
Name
163581090-MIT.pdf
Description
Full printable version
Size
1.51 MB
Format
Adobe PDF
Checksum (MD5)
4f1a2067558aae80ab698c2fd7d459f3
Author(s)
Valiant, Paul (Paul Andrew)
Advisor(s)
Silvio Micali.
Alternative Title
Knowledge implies time/space efficiency
Date Issued
2007
Publisher
Massachusetts Institute of Technology
Abstract
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 our proposed proof system by way of a natural new assumption about proofs of knowledge. In fact, a main contribution of our result is showing that knowledge can be "traded" for time and space efficiency in noninteractive proof systems.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 35-36).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
