Rational secret sharing

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.

Bibliographic Details
Main Author: Reyzin, Alissa Natanovna
Other Authors: Silvio Micali.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2009
Subjects:
Online Access:http://hdl.handle.net/1721.1/46511
_version_ 1826193321552248832
author Reyzin, Alissa Natanovna
author2 Silvio Micali.
author_facet Silvio Micali.
Reyzin, Alissa Natanovna
author_sort Reyzin, Alissa Natanovna
collection MIT
description Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
first_indexed 2024-09-23T09:37:08Z
format Thesis
id mit-1721.1/46511
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T09:37:08Z
publishDate 2009
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/465112019-04-12T16:00:44Z Rational secret sharing Reyzin, Alissa Natanovna 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 (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. Includes bibliographical references (p. 59-60). Recent work has attempted to bridge the fields of Cryptography and Game Theory in order to create more robust protocols that allow for a variety of player types. A keystone functionality used in cryptography is Secret Sharing. While there are several well known, efficient protocols that implement Secret Sharing in the Cryptographic model, designing a Rational Secret Sharing protocol which works in the Game Theoretic model has proved challenging. In this thesis, we contrast several recently proposed protocols for Rational Secret Sharing based on their channel models, utility tolerances, equilibrium types, and efficiencies. We also discuss two more general results bridging Cryptography and Game Theory that can be used to construct Rational Secret Sharing protocols. Finally, we highlight several issues of context that influence the ways in which Rational Secret Sharing protocols might be used. by Alissa Natanovna Reyzin. M.Eng. 2009-08-26T16:39:16Z 2009-08-26T16:39:16Z 2007 2007 Thesis http://hdl.handle.net/1721.1/46511 404129222 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 60 p. application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Reyzin, Alissa Natanovna
Rational secret sharing
title Rational secret sharing
title_full Rational secret sharing
title_fullStr Rational secret sharing
title_full_unstemmed Rational secret sharing
title_short Rational secret sharing
title_sort rational secret sharing
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/46511
work_keys_str_mv AT reyzinalissanatanovna rationalsecretsharing