Incrementally verifiable computation or knowledge implies time/space efficiency
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/38663 |
| _version_ | 1826192464574152704 |
|---|---|
| author | Valiant, Paul (Paul Andrew) |
| author2 | Silvio Micali. |
| author_facet | Silvio Micali. Valiant, Paul (Paul Andrew) |
| author_sort | Valiant, Paul (Paul Andrew) |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. |
| first_indexed | 2024-09-23T09:13:12Z |
| format | Thesis |
| id | mit-1721.1/38663 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:13:12Z |
| publishDate | 2007 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/386632019-04-10T07:55:49Z Incrementally verifiable computation or knowledge implies time/space efficiency Knowledge implies time/space efficiency Valiant, Paul (Paul Andrew) Silvio Micali. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. Includes bibliographical references (p. 35-36). 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. by Paul Valiant. S.M. 2007-08-29T20:41:21Z 2007-08-29T20:41:21Z 2007 2007 Thesis http://hdl.handle.net/1721.1/38663 163581090 eng 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. http://dspace.mit.edu/handle/1721.1/7582 36 p. application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Valiant, Paul (Paul Andrew) Incrementally verifiable computation or knowledge implies time/space efficiency |
| title | Incrementally verifiable computation or knowledge implies time/space efficiency |
| title_full | Incrementally verifiable computation or knowledge implies time/space efficiency |
| title_fullStr | Incrementally verifiable computation or knowledge implies time/space efficiency |
| title_full_unstemmed | Incrementally verifiable computation or knowledge implies time/space efficiency |
| title_short | Incrementally verifiable computation or knowledge implies time/space efficiency |
| title_sort | incrementally verifiable computation or knowledge implies time space efficiency |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/38663 |
| work_keys_str_mv | AT valiantpaulpaulandrew incrementallyverifiablecomputationorknowledgeimpliestimespaceefficiency AT valiantpaulpaulandrew knowledgeimpliestimespaceefficiency |