You are looking at a specific version 20141125:203501 of this paper.
See the latest version.
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)
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- secret sharingentropyidealness
- Contact author(s)
- fltiplea @ info uaic ro
- History
- 2014-11-25: received
- Short URL
- https://ia.cr/2014/955
- License
-
CC BY