A New Double Layer Multi-Secret Sharing Scheme

Cryptography is deemed to be the optimum strategy to secure the data privacy in which the data is encoded ahead of time before sharing it.Visual Secret Sharing(VSS)is an encryption method in which the secret message is split into at least two trivial images called’shares’to cover it.However,such message are always targeted by hackers or dishonest members who attempt to decrypt the message.This can be avoided by not uncovering the secret message without the universal share when it is presented and is typically taken care of,by the trusted party.Hence,in this paper,an optimal and secure double-layered secret image sharing scheme is proposed.The proposed share creation process contains two layers such as threshold-based secret sharing in the first layer and universal share based secret sharing in the second layer.In first layer,Genetic Algorithm(GA)is applied to find the optimal threshold value based on the randomness of the created shares.Then,in the second layer,a novel design of universal share-based secret share creation method is proposed.Finally,Opposition Whale Optimization Algorithm(OWOA)-based optimal key was generated for rectange block cipher to secure each share.This helped in producing high quality reconstruction images.The researcher achieved average experimental outcomes in terms of PSNR and MSE values equal to 55.154225 and 0.79365625 respectively.The average PSNRwas less(49.134475)and average MSE was high(1)in case of existing methods.

Verifiable quantum secret sharing scheme based on orthogonal product states

In the domain of quantum cryptography,the implementation of quantum secret sharing stands as a pivotal element.In this paper,we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques.This protocol is initiated by the dealer Alice,who initially prepares a quantum product state,selected from a predefined set of orthogonal product states within the C~d■C~d framework.Subsequently,the participants execute unitary operations on this product state to recover the underlying secret.Furthermore,we subject the protocol to a rigorous security analysis,considering both eavesdropping attacks and potential dishonesty from the participants.Finally,we conduct a comparative analysis of our protocol against existing schemes.Our scheme exhibits economies of scale by exclusively employing quantum product states,thereby realizing significant cost-efficiency advantages.In terms of access structure,we adopt a(t, n)-threshold architecture,a strategic choice that augments the protocol's practicality and suitability for diverse applications.Furthermore,our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.

Improvement and security analysis of multi-ring discrete modulation continuous variable quantum secret sharing scheme

In order to avoid the complexity of Gaussian modulation and the problem that the traditional point-to-point communication DM-CVQKD protocol cannot meet the demand for multi-user key sharing at the same time, we propose a multi-ring discrete modulation continuous variable quantum key sharing scheme(MR-DM-CVQSS). In this paper, we primarily compare single-ring and multi-ring M-symbol amplitude and phase-shift keying modulations. We analyze their asymptotic key rates against collective attacks and consider the security key rates under finite-size effects. Leveraging the characteristics of discrete modulation, we improve the quantum secret sharing scheme. Non-dealer participants only require simple phase shifters to complete quantum secret sharing. We also provide the general design of the MR-DM-CVQSS protocol.We conduct a comprehensive analysis of the improved protocol's performance, confirming that the enhancement through multi-ring M-PSK allows for longer-distance quantum key distribution. Additionally, it reduces the deployment complexity of the system, thereby increasing the practical value.

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

Special secret sharing scheme with the function of assignment

A concept of secret sharing scheme with the function of assignment is proposed. It provides great capabilities for many practical applications. In this scheme, the dealer can randomly assign one or more than one participant to get the secret at any time, but these participants can get nothing about the secret before that moment. At the same time, the other participants cannot get anything about the secret by stealing the secret value when it is transferred. However, if the dealer is lost, a certain number or more partidtmnts of them can reoonstruct the secret by ccoperating. In order to clear this concept, an illustrating scheme with geometry method and a practical scheme with algebra method is given.

Secret sharing scheme with inherited characteristic

To assure the shareholders can look for their ＂legal＂ attorneys to renew the secret, once the secret sharing scheme is initialized, a secret sharing scheme with inherited characteristic is constructed. In this scheme, each shareholder can produce a new share by his algorithm, which is equivalent to the primary one. Together with other shares, the primary secret can be renewed. Since this scheme is constructed not by replacing the primary share with a new share produced by the dealer in his primitive secret sharing scheme, so no matter how much shares the shareholder produces, these shares can not be gathered together to renew the secret in this scheme. Compared with the existing secret sharing schemes, this scheme provides more agility for the shareholders by investing each of them a function but not affect its security.

A Secure and Efficient (t, n) Multi-Secret Sharing Scheme

Based on Shamir's secret sharing, a (t, n) multi-secret sharing scheme isproposed in this paper p secrets can be shared among n participants, and t or more participants canco-operate to reconstruct these secrets at the same time, but t— 1 or fewerparticipants can derivenothing about these secrets. Each participant's secret shadow is as short as each secret. Comparedwith the existing schemes, the proposed scheme is characterized by the lower complexity of thesecret reconstruction and less public information. The security of this scheme is the same as thatof Shamir' a threshold scheme. Analyses show that this scheme is an efficient, computationallysecure scheme.

AN EFFICIENT AND SECURE (t, n) THRESHOLD SECRET SHARING SCHEME

Based on Shamir’s threshold secret sharing scheme and the discrete logarithm problem, a new (t, n) threshold secret sharing scheme is proposed in this paper. In this scheme, each participant’s secret shadow is selected by the participant himself, and even the secret dealer cannot gain anything about his secret shadow. All the shadows are as short as the shared secret. Each participant can share many secrets with other partici- pants by holding only one shadow. Without extra equations and information designed for verification, each participant is able to check whether another participant provides the true information or not in the recovery phase. Unlike most of the existing schemes, it is unnecessary to maintain a secure channel between each par- ticipant and the dealer. Therefore, this scheme is very attractive, especially under the circumstances that there is no secure channel between the dealer and each participant at all. The security of this scheme is based on that of Shamir’s threshold scheme and the difficulty in solving the discrete logarithm problem. Analyses show that this scheme is a computationally secure and efficient scheme.

NEW SECRET SHARING SCHEME BASED ON LINEAR CODE

A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.

A Multi-Secret Sharing Scheme with Many Keys Based on Hermite Interpolation

A secret sharing scheme is one of cryptographies. A threshold scheme, which is introduced by Shamir in 1979, is very famous as a secret sharing scheme. We can consider that this scheme is based on Lagrange's interpolation formula. A secret sharing scheme has one key. On the other hand, a multi-secret sharing scheme has more than one keys;that is, a multi-secret sharing scheme has p (≥2) keys. Dealers distribute shares of keys among n participants. Gathering t (≤n) participants, keys can be reconstructed. In this paper, we give a scheme of a (t,n) multi-secret sharing based on Hermite interpolation, in the case of p≤t.

An Efficient Multiparty Quantum-State Sharing Scheme

An efficient multipaxty quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret by performing the operations of quantum-controlled-not and Hadamard gate. The participants perform the single-particle measurements on their particles, and then can cooperate to recover the original quantum state. In our scheme, both the dealer and the participants do not need to perform the entanglement measurement. Compared with the existing schemes, our scheme is simpler and more efficient.

Verifiable Secret Sharing Scheme Based on the Plane Parametric Curve

Verifiable secret sharing is a special kind of secret sharing. In this paper, A secure and efficient threshold secret sharing scheme is proposed by using the plane parametric curve on the basis of the principle of secret sharing. And the performance of this threshold scheme is analyzed. The results reveal that the threshold scheme has its own advantage of one-parameter representation for a master key, and it is a perfect ideal secret sharing scheme. It can easily detect cheaters by single operation in the participants so that the probability of valid cheating is less than 1/p (where p is a large prime).

A Trust Value Sharing Scheme in Heterogeneous Identity Federation Topologies

Recent developments in heterogeneous identity federation systems have heightened the need for the related trust management system.The trust management system evaluates,manages,and shares users’trust values.The service provider(SP)members of the federation system rely on users’trust values to determine which type and quality of service will be provided to the users.While identity federation systems have the potential to help federated users save time and energy and improve service experience,the benefits also come with significant privacy risks.So far,there has been little discussion about the privacy protection of users in heterogeneous identity federation systems.In this paper,we propose a trust value sharing scheme based on a proxy ring signature for the trust management system in heterogeneous identity federation topologies.The ring signature schemes can ensure the validity of the data and hide the original signer,thereby protecting privacy.Moreover,no group manager participating in the ring signature,which naturally matches with our decentralized heterogeneous identity federation topologies.The proxy signature can reduce the workload of the private key owner.The proposed scheme shortens the calculation time for verifying the signature and then reduces the overall time consumption in the process of trust sharing.Our studies prove that the proposed scheme is privacy-preserving,efficient,and effective.

Efficient Data Integrity Using Enhanced Secret Sharing Scheme for MANET

Mobile Ad Hoc Networks consist of nodes which are wireless and get organized based on the transmission requirement. These nodes are mobile nodes, so they communicate with each other without any fixed access point. This type of network faces several attacks because of its mobility nature. In MANET, black hole attacks may cause packet dropping or misrouting of packets during transmission from sender to receiver. This may lead to performance degradation in the network. To surmount this issue, we propose the modified secret sharing scheme to provide the data protection from unauthorized nodes, consistency of data and genuineness. In this algorithm, initially the identification of black hole attacks is achieved and followed by data protection from malicious nodes and also this scheme checks for the reality of the data. Here, we detect the misbehaviour that is dropping or misrouting using verifiable secret sharing scheme. The proposed algorithm achieves the better packet delivery ratio, misbehaviour detection efficiency, fewer packets overhead and end-to-end delay than the existing schemes. These can be viewed in the simulation results.

Building a Community with a Shared Future for Mankind: a Chinese Scheme of Global Human Rights Governance

Sponsored by the China Society for Human Rights Studies and the Publicity Department of the Tianjin Municipal Committee,the symposium on building a Community with a Shared Future for Mankind and Global Human Rights Governance starts today at Nankai University.On behalf of the China Society for Human Rights Studies,I would like to extend my warm congratulations to the conveners of conference,and

信控交叉口公交专用车道动态共享实时控制方法

针对目前交叉口拥堵、公交专用车道利用率低的问题,提出一种信控交叉口公交专用车道动态共享实时控制方法。利用GPS定位实时获取交叉口处公交车的位置,并通过交通检测设备获取专用道内小汽车车辆数,结合主信号显示情况综合计算当前时刻公交专用道共享前后交叉口车辆总延误。将延误大小判断结果反馈给车道信号,车道信号显示红灯或绿灯以提醒司机是否能够进入公交专用道。引入受影响车辆概念,建立以减少交叉口车辆总延误为目标的公交专用车道共享控制模型。通过对当前时刻主信号显示红灯和显示绿灯两种情况分析,提出一种综合考虑车辆司乘系数、受影响车辆的交叉口延误计算方法,得到共享公交专用车道前后交叉口车辆总延误差值的表达式。利用示例数值模拟在多种不同场景下车道信号的显示情况,分析了专用道内已有车辆、公交车位置以及主信号显示情况对车道共享的影响。结果表明:该控制方法较符合实际情况,并能有效提高公交专用车道利用率,能够充分利用交叉口绿灯时间,为解决公交专用车道的动态共享、缓解道路拥堵提供了一种新的思路。