On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme

Constantin Catalin Dragan; Ferucio Laurentiu Tiplea

Paper 2014/955

On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme

Constantin Catalin Dragan and Ferucio Laurentiu Tiplea

Abstract

A necessary and sufficient condition for the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme is proposed. Apart from this, a comprehensive analysis of the known variants of the Asmuth-Bloom threshold secret sharing scheme is provided, clarifying the security properties achieved by each of them.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: secret sharing entropy idealness
Contact author(s): fltiplea @ info uaic ro
History: 2014-11-25: received
Short URL: https://ia.cr/2014/955
License: CC BY

BibTeX

@misc{cryptoeprint:2014/955,
      author = {Constantin Catalin Dragan and Ferucio Laurentiu Tiplea},
      title = {On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2014/955},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/955}},
      url = {https://eprint.iacr.org/2014/955}
}