{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/35531"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/35531","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Études in non-interactive zero-knowledge","abstract":"N a ZERO-KNOWLEDGE PROOF [GMR85], Prover interactively convinces Verifier that theorem 7r is true in such a way that (a) a corrupt Prover cannot convince Verifier of a false theorem and (b) a corrupt Verifier cannot \"learn\" anything other than the fact that r is true. In a NON-INTERACTIVE ZERO-KNOWLEDGE PROOF [BFM88], the Prover must do the above by sending only a single message to Verifier! To make this possible, Prover and Verifier are not tabula rasa, but rather born with some setup information. Much in the fashion of a musical TUDE, in this thesis, we explore several variations on the setup assumptions for non-interactive zero-knowledge in order to enjoy a richer understanding. Our labor brings forth * various unconditional characterizations of computational and statistical NIZK proofs, * new constructions that have practical applications to non-malleable encryption and CCAz encryption, * new constructions which form the building blocks of \"fair\" versions of interactive zero-knowledge and collusion-free multi-party computation protocols, * and conceptual contributions which underlie the recent works on how cryptography can be used to achieve equilibrium in game theory.","abstract_html":"N a ZERO-KNOWLEDGE PROOF [GMR85], Prover interactively convinces Verifier that theorem 7r is true in such a way that (a) a corrupt Prover cannot convince Verifier of a false theorem and (b) a corrupt Verifier cannot "learn" anything other than the fact that r is true. In a NON-INTERACTIVE ZERO-KNOWLEDGE PROOF [BFM88], the Prover must do the above by sending only a single message to Verifier! To make this possible, Prover and Verifier are not tabula rasa, but rather born with some setup information. Much in the fashion of a musical TUDE, in this thesis, we explore several variations on the setup assumptions for non-interactive zero-knowledge in order to enjoy a richer understanding. Our labor brings forth * various unconditional characterizations of computational and statistical NIZK proofs, * new constructions that have practical applications to non-malleable encryption and CCAz encryption, * new constructions which form the building blocks of "fair" versions of interactive zero-knowledge and collusion-free multi-party computation protocols, * and conceptual contributions which underlie the recent works on how cryptography can be used to achieve equilibrium in game theory.","abstract_has_math":false,"creators":["Shelat, Abhi"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Silvio Micali."],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006","date_published":"2006","updated_at":"2026-07-22T22:21:24Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/35531","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Silvio Micali."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Shelat, Abhi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2007-01-10T16:33:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2007-01-10T16:33:48Z"]},{"key":"dc:date.issued","label":"Date","values":["2006"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/35531"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006.","Includes bibliographical references (p. 72-76)."]},{"key":"dc:description.abstract","label":"Abstract","values":["N a ZERO-KNOWLEDGE PROOF [GMR85], Prover interactively convinces Verifier that theorem 7r is true in such a way that (a) a corrupt Prover cannot convince Verifier of a false theorem and (b) a corrupt Verifier cannot \"learn\" anything other than the fact that r is true. In a NON-INTERACTIVE ZERO-KNOWLEDGE PROOF [BFM88], the Prover must do the above by sending only a single message to Verifier! To make this possible, Prover and Verifier are not tabula rasa, but rather born with some setup information. Much in the fashion of a musical TUDE, in this thesis, we explore several variations on the setup assumptions for non-interactive zero-knowledge in order to enjoy a richer understanding. Our labor brings forth * various unconditional characterizations of computational and statistical NIZK proofs, * new constructions that have practical applications to non-malleable encryption and CCAz encryption, * new constructions which form the building blocks of \"fair\" versions of interactive zero-knowledge and collusion-free multi-party computation protocols, * and conceptual contributions which underlie the recent works on how cryptography can be used to achieve equilibrium in game theory."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Études in non-interactive zero-knowledge"]}]}],"canonical_facts":{"dc:contributor.advisor":["Silvio Micali."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Shelat, Abhi"],"dc:date.accessioned":["2007-01-10T16:33:48Z"],"dc:date.available":["2007-01-10T16:33:48Z"],"dc:date.issued":["2006"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2006.","Includes bibliographical references (p. 72-76)."],"dc:description.abstract":["N a ZERO-KNOWLEDGE PROOF [GMR85], Prover interactively convinces Verifier that theorem 7r is true in such a way that (a) a corrupt Prover cannot convince Verifier of a false theorem and (b) a corrupt Verifier cannot \"learn\" anything other than the fact that r is true. In a NON-INTERACTIVE ZERO-KNOWLEDGE PROOF [BFM88], the Prover must do the above by sending only a single message to Verifier! To make this possible, Prover and Verifier are not tabula rasa, but rather born with some setup information. Much in the fashion of a musical TUDE, in this thesis, we explore several variations on the setup assumptions for non-interactive zero-knowledge in order to enjoy a richer understanding. Our labor brings forth * various unconditional characterizations of computational and statistical NIZK proofs, * new constructions that have practical applications to non-malleable encryption and CCAz encryption, * new constructions which form the building blocks of \"fair\" versions of interactive zero-knowledge and collusion-free multi-party computation protocols, * and conceptual contributions which underlie the recent works on how cryptography can be used to achieve equilibrium in game theory."],"dc:description.degree":["Ph.D."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/35531"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Études in non-interactive zero-knowledge"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:24Z"}