arXiv subjects

Keju Meng

Publications and source records attributed to Keju Meng.

3 recordsLinked to original sources

arXiv2022

Realize General Access Structure Based On Single Share

Traditional threshold secret sharing cannot realizing all access structures of secret sharing. So, Ito introduced the concept of Secret sharing scheme realizing general access structure. But Its scheme has to send multiple shares to each trustee. In this paper, we proposed two new secret sharing schemes realizing general access structures by only assigning one share to each trustee. Our proposed second scheme is a perfect secret sharing scheme. Furthermore, our schemes can realize any access structures.

cs.CR↗

arXiv2021

Threshold Changeable Secret Sharing Scheme and Its Application to Group Authentication

Group oriented applications are getting more and more popular in mobile Internet and call for secure and efficient secret sharing (SS) scheme to meet their requirements. A $(t,n)$ threshold SS scheme divides a secret into $n$ shares such that any $t$ or more than $t$ shares can recover the secret while less than $t$ shares cannot. However, an adversary, even without a valid share, may obtain the secret by impersonating a shareholder to recover the secret with $t$ or more legal shareholders. Therefore, this paper uses linear code to propose a threshold changeable secret sharing (TCSS) scheme, in which threshold should increase from $t$ to the exact number of all participants during secret reconstruction. The scheme does not depend on any computational assumption and realizes asymptotically perfect security. Furthermore, based on the proposed TCSS scheme, a group authentication scheme is constructed, which allows a group user to authenticate whether all users are legal group members at once and thus provides efficient and flexible m-to-m authentication for group oriented applications.

cs.CR↗

arXiv2018

Verifiable Threshold Quantum Secret Sharing with Sequential Communication

A ($t$, $n$) threshold quantum secret sharing (QSS) is proposed based on a single $d$-level quantum system. It enables the ($t$, $n$) threshold structure based on Shamir's secret sharing and simply requires sequential communication in $d$-level quantum system to recover secret. Besides, the scheme provides a verification mechanism which employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. Moreover, the scheme is salable in participant number and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new ($t$, $n$) threshold QSS schemes based on $d$-level quantum system from other classical threshold secret sharing.

quant-ph↗