An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem

DOI10.1007/978-3-642-22497-3_17zbMath1295.94166OpenAlexW1267745471MaRDI QIDQ3012992

Christophe Tartary, Yun Zhang, Huaxiong Wang

Publication date: 7 July 2011

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22497-3_17

zbMATH Keywords

rational cryptographyAsmuth-Bloom sharing schemecomputational strict Nash equilibriumstability with respect to trembles

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Scalable mechanisms for rational secret sharing

This page was built for publication: An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem