Advertisement
Published in:
2011 | OriginalPaper | Chapter
Unconditionally Secure Rational Secret Sharing in Standard Communication Networks
Authors : Zhifang Zhang, Mulan Liu
Published in: Information Security and Cryptology - ICISC 2010
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Rational secret sharing protocols in both the two-party and multi-party settings are proposed. These protocols are built in standard communication networks and with unconditional security. Namely, the protocols run over standard point-to-point networks without requiring physical assumptions or simultaneous channels, and even a computationally unbounded player cannot gain more than
ε
by deviating from the protocol. More precisely, for the 2-out-of-2 protocol the
ε
is a negligible function in the size of the secret, which is caused by the information-theoretic MACs used for authentication. The
t
-out-of-
n
protocol is (
t
− 1)-resilient and the
ε
is exponentially small in the number of participants. Although secret recovery cannot be guaranteed in this setting, a participant can at least reduce the Shannon entropy of the secret to less than 1 after the protocol. When the secret-domain is large, every rational player has great incentive to participate in the protocol.