Fair secret reconstruction in (t, n) secret sharing

Harn, Lein; Lin, Changlu; Li, Yong

doi:10.1016/j.jisa.2015.07.001

Cited by 16 publications

(10 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, our protocol could accurately check the malicious behavior of the participants or the server and does not require multiple interactions between the participants and the server, which applies to cloud computing environments and mobile networks. Maleka et al [29] Harn et al [30] Pilaram and Eghlidos [10] Traverso et al […”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Outsourcing Hierarchical Threshold Secret Sharing Scheme Based on Reputation

Zhang

Zhu

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

Secret sharing is a basic tool in modern communication, which protects privacy and provides information security. Among the secret sharing schemes, fairness is a vital and desirable property. To achieve fairness, the existing secret sharing schemes either require a trusted third party or the execution of a multiround protocol, which are impractical. Moreover, the classic scheme requires expensive computing in the secret verification phase. In this work, we provide an outsourcing hierarchical threshold secret sharing (HTSS) protocol based on reputation. In the scheme, participants from different levels can fairly reconstruct the secret, and the protocol only needs to run for one round. A cloud service provider (CSP) uses powerful computing resources to help participants complete homomorphic encryption and complex verification operations, and the CSP cannot be aware of any valuable information. The participants can obtain the secret with a small number of operations. To avoid collusion, we suppose that participants have their own reputation value, and they are punished or rewarded according to their behavior. The reputation value of a participant who deviates from the protocol will decrease; therefore, the participant will choose a cooperative strategy to obtain better payoffs. Lastly, our scheme is proved to be secure, and experiments indicate that our scheme is feasible and efficient.

show abstract

Section: Resultsmentioning

confidence: 99%

“…But this scheme requires a trusted third party. In order to achieve desire of fairness, Harn et al [30] proposed a fair secret sharing scheme, but the scheme requires multiple protocol rounds and cannot be effectively applied to devices with poor computing capabilities.…”

Section: Performance Analysismentioning

confidence: 99%

Outsourcing Hierarchical Threshold Secret Sharing Scheme Based on Reputation

Zhang

Zhu

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…The scheme in reference [11] cannot completely resist asynchronous attacks and synchronous collusion attacks. The schemes in references [14,15] only consider the fairness of secret reconstruction in an asynchronous environment but do not consider CAS and NCAS. And the schemes do not meet complete fairness, and both need a hash function to ensure security.…”

Section: Scheme Comparison and Performance Analysismentioning

confidence: 99%

“…From the perspective of scheme complexity, the scheme reconfiguration protocol in this section requires θðvÞ a round of secret reconfiguration protocols to achieve fairness, which is the same as the fair secret sharing scheme proposed in references [11,[14][15][16]19]. From the perspective of each round of reconfiguration protocol, each participant in this scheme receives k elements on GFðpÞ from D, and additional 2ðn − 1Þ elements, FðID i , yÞ mod p containing t elements for generating the session key, there are k + t + 2ðn − 1Þ in total.…”

Section: Scheme Comparison and Performance Analysismentioning

confidence: 99%

See 1 more Smart Citation

Binary Symmetric Polynomial-Based Protected Fair Secret Sharing and Secure Communication over Satellite Networks

Guo

Pan

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The rapid establishment of the low Earth orbit (LEO) satellite network in orbit has promoted the development of satellite communication technology. However, with the reduction of access conditions of satellite networks, the problems of data protection and secure communication have attracted extensive attention. A secret sharing scheme is a cryptographic technology that can disperse risks and tolerate intrusion by dividing and storing secrets. Using secret sharing technology in satellite communication can realize information security and data confidentiality. However, if there are cheaters among the participants, existing secret sharing schemes cannot prevent cheaters from sharing secrets exclusively, even if they can detect attacks. For this reason, this paper proposes a satellite based on binary symmetric polynomials protected fair secret sharing and secure communication scheme. In satellite secret refactoring, this scheme can produce a shared session key between two participants, no other key agreement processes, and reduce the scheme in the shared secret and the actual communication satellite application complexity. Users use the session key to encrypt communication to improve security and resist external attacks. The safety and fairness of the scheme are proved against the four attack models. Compared with the existing schemes, the scheme has a lower cost of deception identification on the premise of satisfying security and fairness. This scheme does not require any cryptographic assumptions and is unconditionally secure.

show abstract

Quantum Secret Reconstruction

Ma,

Gao,

Cai

et al. 2023

Adv Quantum Tech

View full text Add to dashboard Cite

In addition to secret splitting, secret reconstruction is another important component of secret sharing. In this paper, the first quantum secret reconstruction protocol is proposed to protect the reconstruction process. Before the protocol, a classical secret is divided into multiple shares that are distributed to the shareholds, respectively. In the presented protocol, the dealer utilizes the secret to encrypt a privacy quantum state, and sends the encrypted state to a combiner who is chosen by the dealer within the shareholders. With the help of other shareholders, the combiner utilizes the properties of cluster states to recover the privacy quantum state. It is shown that the proposed protocol is secure against several common attacks, including external and internal attacks. Compared with classical secret reconstruction protocols, this protocol not only achieves information‐theoretic security of all shares, but is also more efficient due to the reduced distribution and computation cost. To demonstrate the feasibility of the protocol, a corresponding simulation quantum experiment is conducted on the IBM Q. Furthermore, in conjunction with quantum fingerprinting, it can be directly applied to achieve the task of quantum multiple secrets sharing, since the classical shares can be reused in the proposed protocol.

show abstract

Fair secret reconstruction in (t, n) secret sharing

Cited by 16 publications

References 25 publications

Outsourcing Hierarchical Threshold Secret Sharing Scheme Based on Reputation

Outsourcing Hierarchical Threshold Secret Sharing Scheme Based on Reputation

Binary Symmetric Polynomial-Based Protected Fair Secret Sharing and Secure Communication over Satellite Networks

Quantum Secret Reconstruction

Contact Info

Product

Resources

About