Anzeige
Erschienen in:
31.03.2022
A new fair multi-secret sharing scheme based on asymmetric bivariate polynomial
Erschienen in: Cryptography and Communications | Ausgabe 5/2022
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In a (t, n) secret sharing scheme, cheating identification provides a very effective way to protect the security of the secret. In this paper, we propose a fair multi-secret deception identification sharing scheme. The binary polynomials are used to generate k secrets and establish pairs of keys between groups, respectively. During the reconstruction phase, the attackers can be identified and eliminated in a black box by deception verification based on the characteristic equation of n-order matrix with multiple roots. Participants in our scheme cannot directly own useful information, only those who are verified as honest by the black box can get necessary values encrypted by the key, and then multi-secret can be reconstructed successfully. The analysis results show that our scheme can resist both external and internal attacks.