Paper 2010/540
Rational Secret Sharing with Side Information in Point-to-Point Networks via Time-Delayed Encryption
Anna Lysyanskaya and Aaron Segal
Abstract
In this paper, we give the first construction of a rational secret
sharing protocol that is strict Nash (or Nash with respect to
trembles) in the computational sense, works in a standard
point-to-point network with loose synchronization (i.e. does not rely
on the availability of a broadcast channel), and can tolerate
players with arbitrary side information about the secret. Since this
has been proved impossible in the plain model, our protocol requires
us to make assumptions about upper and lower bounds on the
computational resources of the participants, and also to assume that
they are out of sync with each other by at most a known quantity
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Submitted to TCC 2011
- Keywords
- secret sharinggame theoryrational cryptographytime release cryptography
- Contact author(s)
- aaronak @ cs brown edu
- History
- 2010-10-25: received
- Short URL
- https://ia.cr/2010/540
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/540, author = {Anna Lysyanskaya and Aaron Segal}, title = {Rational Secret Sharing with Side Information in Point-to-Point Networks via Time-Delayed Encryption}, howpublished = {Cryptology {ePrint} Archive, Paper 2010/540}, year = {2010}, url = {https://eprint.iacr.org/2010/540} }