An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials

DOI10.1142/S0129054111008775zbMATH Open1236.94082MaRDI QIDQ3173477FDOQ3173477

Huaxiong Wang, Yun Zhang, Christophe Tartary

Publication date: 10 October 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• An efficient rational secret sharing scheme based on the Chinese remainder theorem
• Rational multi-secret sharing scheme in standard point-to-point communication networks
• Purely Rational Secret Sharing (Extended Abstract)
• A rational secret sharing protocol with unconditional security in the synchronous setting
• Rational Secret Sharing, Revisited

zbMATH Keywords

bivariate polynomialsecret sharing schemeinformation-theoretical securityrational cryptography

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Non-cooperative games
• Algorithmic Game Theory
• How to share a secret
• Polynomial Codes Over Certain Finite Fields
• Title not available (Why is that?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Cited In (6)

• Fair quantum secret sharing based on symmetric bivariate polynomial
• An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
• RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Purely Rational Secret Sharing (Extended Abstract)
• A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial

This page was built for publication: An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173477)