scholarly journals A New Efficient and Secure Secret Reconstruction Scheme (SSRS) with Verifiable Shares Based on a Symmetric Bivariate Polynomial

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Chingfang Hsu ◽  
Lein Harn ◽  
Shan Wu ◽  
Lulu Ke
Keyword(s):  
Secret Sharing ◽  
Bivariate Polynomials ◽  
Verification Scheme ◽  
Reconstruction Scheme ◽  
Computer Communications ◽  
Communications Systems ◽  
Exchange Information ◽  
New Type ◽  
Secret Reconstruction ◽  
Novel Design

Secret sharing (SS) schemes have been widely used in secure computer communications systems. Recently, a new type of SS scheme, called the secure secret reconstruction scheme (SSRS), was proposed, which ensures that the secret can only be recovered by participants who present valid shares. In other words, if any outside adversary participated in the secret reconstruction without knowing any valid share, the secret cannot be recovered by anyone including the adversary. However, the proposed SSRS can only prevent an active attacker from obtaining the recovered secret, but cannot prevent a passive attacker from obtaining the secret since exchange information among participants is unprotected. In this paper, based on bivariate polynomials, we propose a novel design for the SSRS that can prevent both active and passive attackers. Furthermore, we propose a verification scheme which can verify all shares at once, i.e., it allows all shareholders to efficiently verify that their shares obtained from the dealer are generated consistently without revealing their shares and the secret. The proposed scheme is really attractive for efficient and secure secret reconstruction in communications systems.

scholarly journals How to Share Secret Efficiently over Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-6 ◽  
Author(s):  
Lein Harn ◽  
Ching-Fang Hsu ◽  
Zhe Xia ◽  
Junwei Zhou
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Key Establishment ◽  
Sharing Scheme ◽  
Security Properties ◽  
New Type ◽  
Shared Key ◽  
Secret Reconstruction ◽  
Threshold Cryptosystems ◽  
Secure Channels

In a secret-sharing scheme, the secret is shared among a set of shareholders, and it can be reconstructed if a quorum of these shareholders work together by releasing their secret shares. However, in many applications, it is undesirable for nonshareholders to learn the secret. In these cases, pairwise secure channels are needed among shareholders to exchange the shares. In other words, a shared key needs to be established between every pair of shareholders. But employing an additional key establishment protocol may make the secret-sharing schemes significantly more complicated. To solve this problem, we introduce a new type of secret-sharing, calledprotected secret-sharing(PSS), in which the shares possessed by shareholders not only can be used to reconstruct the original secret but also can be used to establish the shared keys between every pair of shareholders. Therefore, in the secret reconstruction phase, the recovered secret is only available to shareholders but not to nonshareholders. In this paper, an information theoretically secure PSS scheme is proposed, its security properties are analyzed, and its computational complexity is evaluated. Moreover, our proposed PSS scheme also can be applied to threshold cryptosystems to prevent nonshareholders from learning the output of the protocols.

A Novel Design on Uniform Heating Wire Coil of Induction Cooker

2014 ◽  
Vol 496-500 ◽  
pp. 1044-1047 ◽  
Author(s):  
Jia Xiong Zhu ◽  
Qiang Tong
Keyword(s):  
Eddy Current ◽  
Optimization Design ◽  
Equivalent Circuit Model ◽  
Circuit Modeling ◽  
Uniform Heating ◽  
Heating Wire ◽  
New Type ◽  
Wire Coil ◽  
The Common ◽  
Novel Design

In this paper, based on the principle of induction heating and eddy current fields working, the equivalent circuit model of induction cooker heating was proposed and analyzed. By using the finite element numerical analysis software, the optimization design and model simulations of induction cooker were implemented. Finally, a new design of induction cooker with the uniform heating-coil was proposed, and the magnetic circuit modeling and simulation of new type induction cooker heating was carried out, the eddy current loss density distribution in the common wire coil and the improved wire coil was separately calculated and compared. The results shown the new wire coil had higher energy efficiency and more uniform heating characteristics, which provided a reference for the future optimization design and development of induction cooker.

scholarly journals A Publicly Verifiable Multi-Secret Sharing Scheme With Outsourcing Secret Reconstruction

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 70666-70673 ◽  
Author(s):  
Changlu Lin ◽  
Huidan Hu ◽  
Chin-Chen Chang ◽  
Shaohua Tang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Multi Secret Sharing ◽  
Secret Reconstruction

Threshold changeable secret sharing with secure secret reconstruction

2020 ◽  
Vol 157 ◽  
pp. 105928 ◽  
Author(s):  
Keju Meng ◽  
Fuyou Miao ◽  
Wenchao Huang ◽  
Yan Xiong
Keyword(s):  
Secret Sharing ◽  
Secret Reconstruction

Ramp secret sharing with cheater identification in presence of rushing cheaters

2019 ◽  
Vol 11 (2) ◽  
pp. 103-113
Author(s):  
Jyotirmoy Pramanik ◽  
Avishek Adhikari
Keyword(s):  
Secret Sharing ◽  
Private Information ◽  
Information Storage ◽  
Small Positive Number ◽  
Secret Sharing Schemes ◽  
Security Model ◽  
Image Sharing ◽  
Secure Information ◽  
Unlimited Time ◽  
Secret Reconstruction

Abstract Secret sharing allows one to share a piece of information among n participants in a way that only qualified subsets of participants can recover the secret whereas others cannot. Some of these participants involved may, however, want to forge their shares of the secret(s) in order to cheat other participants. Various cheater identifiable techniques have been devised in order to identify such cheaters in secret sharing schemes. On the other hand, Ramp secret sharing schemes are a practically efficient variant of usual secret sharing schemes with reduced share size and some loss in security. Ramp secret sharing schemes have many applications in secure information storage, information-theoretic private information retrieval and secret image sharing due to producing relatively smaller shares. However, to the best of our knowledge, there does not exist any cheater identifiable ramp secret sharing scheme. In this paper we define the security model for cheater identifiable ramp secret sharing schemes and provide two constructions for cheater identifiable ramp secret sharing schemes. In addition, the second construction is secure against rushing cheaters who are allowed to submit their shares during secret reconstruction after observing other participants’ responses in one round. Also, we do not make any computational assumptions for the cheaters, i.e., cheaters may be equipped with unlimited time and resources, yet, the cheating probability would be bounded above by a very small positive number.

Secret sharing with secure secret reconstruction

2020 ◽  
Vol 519 ◽  
pp. 1-8 ◽  
Author(s):  
Lein Harn ◽  
Zhe Xia ◽  
Chingfang Hsu ◽  
Yining Liu
Keyword(s):  
Secret Sharing ◽  
Secret Reconstruction

scholarly journals Anticollusion Attack Strategy Combining Trust Metrics and Secret Sharing for Friendships Protection

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Junfeng Tian ◽  
Yue Li
Keyword(s):  
Social Networks ◽  
Secret Sharing ◽  
Online Social Networks ◽  
Instant Messaging ◽  
Online Interaction ◽  
Collusion Attacks ◽  
New Type ◽  
Trust Metric ◽  
Trust Metrics ◽  
Attack Strategy

Online social networks provide users with services such as online interaction, instant messaging, and information sharing. The friend search engine, a new type of social application, provides users with the service for querying the list of other individuals’ friends. Currently, the existing research focuses on independent attacks for friend search engines while ignoring the more complicated collusion attacks, which can expose more friendships that users are not willing to share. Compared with independent attackers, collusion attackers share query results by cooperating with each other. In this article, we propose a resistance strategy against collusion attacks to protect the friendship privacy. The proposed trust metric is based on users’ behaviors and is combined with Shamir’s secret sharing system, which can transform friendships into secrets. Through secret distribution and reconfiguration, only the participants who meet the query requirements can successfully reconstruct the secret, while the participants who do not meet the query conditions cannot successfully obtain the secret fragments even if they obtain the secret fragments. Experiments are conducted to verify the effectiveness of the proposed strategy and proved that this strategy can greatly limit the number of malicious attackers, greatly reduce the probability of successful collusion attacks, and reduce the number of victims.

Thrust Study of a Novel PM Linear Synchronous Motor

2015 ◽  
Vol 764-765 ◽  
pp. 408-412
Author(s):  
Wan Tsun Tseng ◽  
Yi Chang Wu ◽  
Li Iau Su
Keyword(s):  
Synchronous Motor ◽  
The Finite Element Method ◽  
Linear Synchronous Motor ◽  
Tooth Width ◽  
New Findings ◽  
New Type ◽  
Core Sets ◽  
Parameter Values ◽  
High Thrust ◽  
Novel Design

This paper presents an analysis of a new type of permanent magnet excited transverse flux linear synchronous motor (PMTFLSM). This linear motor achieves a high thrust from its novel design and fabric. Its translator consists of cross-shaped core sets. Considering parameters such as magnet dimension, pole pitch, and tooth width of the translator, the effected thrust is analyzed and simulated with a 2D model of our PMTFLSM using the finite element method. Extensive simulations were conducted to investigate how the motor performs under a variety of parameter settings. Accordingly, motor characteristics are identified whereby an optimal combination of parameter values can be found. The new findings are then fed back to our motor design to validate performance improvement.

Sign in / Sign up

Export Citation Format

Share Document