On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- Submitting institution
-
The University of Surrey
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9025525_2
- Type
- D - Journal article
- DOI
-
10.1016/j.ins.2018.06.046
- Title of journal
- Information Sciences
- Article number
- -
- First page
- 75
- Volume
- 463-464
- Issue
- 0
- ISSN
- 0020-0255
- Open access status
- Deposit exception
- Month of publication
- -
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 5
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work provides the first formal security proof and the only sufficient and necessary condition to achieve asymptotic idealness for the Asmuth-Bloom threshold secret-sharing scheme. This is significant as secret sharing schemes are fundamental building blocks used to design secure systems, and the security of this scheme had been an open problem for 35 years (by date of publication) - with many other secure variants being proposed. Moreover, this result corrects and strengthens all existing real-world and academic applications that use this construction, e.g. e-voting (Iftene), threshold cryptography (Kaya and Selcuk), wireless ad-hoc networks (Deng, Sarkar), and cloud computing (Tchernykh).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -