Paper 2010/249

Rational Secret Sharing without Broadcast

Amjed Shareef

Abstract

We consider the concept of rational secret sharing, which was initially introduced by Halpern and Teague \cite{ht04}, where players' preferences are that they prefer to learn the secret than not, and moreover they prefer that as few others learn the secret as possible. This paper is an attempt to introduce a rational secret sharing scheme which defers from previous RSS schemes in that this scheme does not rely on broadcast to send messages but instead uses point to point transmissions. Not only that, but the protocol will not rely on any cryptographic primitives and is coalition resilient except for when the short player colludes with a long player.

Metadata
Available format(s)
PDF PS
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Rational Cryptography
Contact author(s)
amjedshareef @ gmail com
History
2010-05-02: received
Short URL
https://ia.cr/2010/249
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/249,
      author = {Amjed Shareef},
      title = {Rational Secret Sharing without Broadcast},
      howpublished = {Cryptology ePrint Archive, Paper 2010/249},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/249}},
      url = {https://eprint.iacr.org/2010/249}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.