Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / secret sharing, entropy, idealness

Date: received 21 Nov 2014

Contact author: fltiplea at info uaic ro

Available format(s): PDF | BibTeX Citation

Version: 20141125:203501 (All versions of this report)

Short URL: ia.cr/2014/955

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]