Cheating identifiable secret sharing scheme using symmetric bivariate polynomial-Reference-Cited by-同舟云学术

Cheating identifiable secret sharing scheme using symmetric bivariate polynomial

Published:2018-07 Issue: Volume:453 Page:21-29
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Liu Yanxiao,Yang Chingnung,Wang Yichuan,Zhu Lei,Ji Wenjiang

Funder

National Natural Science Foundation of China

XI’AN University of Technology

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference23 articles.

1. Safeguarding cryptographic keys;Blakley,1979

2. Round-optimal and efficient verifiable secret sharing. Proc. of TCC2006, LNCS, vol.;Fitzi,2006

3. Comments on Harn–Lin’s cheating detection scheme.;Ghodosi;Des. Codes Cryptogr.,2011

4. (t, n) Muliti-secret sharing scheme based on bivariate polynomial.;Harn;Wirel. Pers. Commun.,2017

5. Detection and identification of cheaters in (t, n) secret sharing scheme.;Harn;Des. Codes Cryptogr.,2009

Cited by 56 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient cheating-detectable secret image sharing scheme with smaller share sizes;Journal of Information Security and Applications;2024-03

2. Secret sharing: A comprehensive survey, taxonomy and applications;Computer Science Review;2024-02

3. A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes;International Journal of Foundations of Computer Science;2023-11-29

4. A Verifiable Secret Sharing Scheme using Elliptic Curve Cryptography;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06

5. A hybrid approach combining data hiding with visual cryptography for secure extraction of data hiding;Journal of Information Security and Applications;2023-06