Paper Info
Title
Purely Rational Secret Sharing (Extended Abstract)
Abstract
Rational secret sharing is a problem at the intersection of cryptography and game theory. In essence, a dealer wishes to engineer a communication game that, when rationally played, guarantees that each of the players learns the dealer's secret. Yet, all solutions proposed so far did not rely solely on the players' rationality, but also on their beliefs , and were also quite inefficient. After providing a more complete definition of the problem, we exhibit a very efficient and purely rational solution to it with a verifiable trusted channel.
Year
DOI
Venue
2009
10.1007/978-3-642-00457-5_4
TCC
Keywords
Field
DocType
extended abstract,purely rational secret,communication game,rational secret sharing,complete definition,rational solution,game theory,secret sharing
Discrete mathematics,Secure multi-party computation,Secret sharing,Computer science,Computer security,Theoretical computer science,Verifiable secret sharing,Game theory,Solution concept,Security parameter,Nash equilibrium,Non-cooperative game
Conference
Volume
ISSN
Citations 
5444
0302-9743
16
PageRank 
References 
Authors
0.66
11
2
Name
Order
Citations
PageRank
Silvio Micali1114342581.31
Abhi Shelat2122170.23