Research on the fair (t,r,n) threshold secret sharing scheme

YingJie Shi

doi:10.1117/12.2636522

6 May 2022 Research on the fair (t,r,n) threshold secret sharing scheme

YingJie Shi

Proceedings Volume 12176, International Conference on Algorithms, Microchips and Network Applications; 1217621 (2022) https://doi.org/10.1117/12.2636522
Event: International Conference on Algorithms, Microchips, and Network Applications 2022, 2022, Zhuhai, China

Abstract

As an important branch of modern cryptography, secret sharing can diversify security risks and effectively ensure the security of information. The exchange of secret shares is an important part of secret sharing. How to ensure that the secret shares submitted by each participant does not affect fairness is an important topic to be studied in the field of secret sharing. This scheme proposes a fair (t, r, n) threshold secret sharing scheme, in which honest participants can recover the plaintext, while cheaters cannot recover the plaintext, and can resist collusion attacks by participants to ensure the fairness of the scheme.

Citation Download Citation

YingJie Shi "Research on the fair (t,r,n) threshold secret sharing scheme", Proc. SPIE 12176, International Conference on Algorithms, Microchips and Network Applications, 1217621 (6 May 2022); https://doi.org/10.1117/12.2636522

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available