AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS

DOI10.1142/S0129054111008775zbMath1236.94082MaRDI QIDQ3173477

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)

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)

Related Items (1)

RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS

Cites Work

• Unnamed Item
• Non-cooperative games
• How to share a secret
• Polynomial Codes Over Certain Finite Fields
• Algorithmic Game Theory
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS