Multi-dimensional multiplexing optical secret sharing framework with cascaded liquid crystal holograms

Secret sharing is a promising technology for information encryption by splitting the secret information into different shares.However,the traditional scheme suffers from information leakage in decryption process since the amount of available information channels is limited.Herein,we propose and demonstrate an optical secret sharing framework based on the multi-dimensional multiplexing liquid crystal(LC)holograms.The LC holograms are used as spatially separated shares to carry secret images.The polarization of the incident light and the distance between different shares are served as secret keys,which can significantly improve the information security and capacity.Besides,the decryption condition is also restricted by the applied external voltage due to the variant diffraction efficiency,which further increases the information security.In implementation,an artificial neural network(ANN)model is developed to carefully design the phase distribution of each LC hologram.With the advantage of high security,high capacity and simple configuration,our optical secret sharing framework has great potentials in optical encryption and dynamic holographic display.

Cryptanalysis of efficient semi-quantum secret sharing protocol using single particles

In paper[Chin.Phys.B 32070308(2023)],Xing et al.proposed a semi-quantum secret sharing protocol by using single particles.We study the security of the proposed protocol and find that it is not secure,that is,the three dishonest agents,Bob,Charlie and Emily can collude to obtain Alice's secret without the help of David.

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.

Blockchain-Based Key Management Scheme Using Rational Secret Sharing

Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of failure.Therefore,decentralized threshold key management schemes have become a research focus for blockchain private key protection.The security of private keys for blockchain user wallet is highly related to user identity authentication and digital asset security.The threshold blockchain private key management schemes based on verifiable secret sharing have made some progress,but these schemes do not consider participants’self-interested behavior,and require trusted nodes to keep private key fragments,resulting in a narrow application scope and low deployment efficiency,which cannot meet the needs of personal wallet private key escrow and recovery in public blockchains.We design a private key management scheme based on rational secret sharing that considers the self-interest of participants in secret sharing protocols,and constrains the behavior of rational participants through reasonable mechanism design,making it more suitable in distributed scenarios such as the public blockchain.The proposed scheme achieves the escrow and recovery of personal wallet private keys without the participation of trusted nodes,and simulate its implementation on smart contracts.Compared to other existing threshold wallet solutions and keymanagement schemes based on password-protected secret sharing(PPSS),the proposed scheme has a wide range of applications,verifiable private key recovery,low communication overhead,higher computational efficiency when users perform one-time multi-key escrow,no need for trusted nodes,and personal rational constraints and anti-collusion attack capabilities.

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.

A verifiable essential secret image sharing scheme based on HLRs(VESIS-(t,s,k,n))

In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to use essential secret image sharing schemes.In this article,a verifiable essential secret image sharing scheme based on HLRs is proposed.Shareholder's share consists of two parts.The first part is produced by the shareholders,which prevents the fraud of dealers.The second part is a shadow image that is produced by using HLRs and the first part of share.The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps.Also,for verifying shadow images,Bloom Filters are used for the first time.The proposed scheme is more efficient than similar schemes,and for the first part of the shares,has formal security.

A Key Recovery System Based on Password-Protected Secret Sharing in a Permissioned Blockchain

In today’s fourth industrial revolution,various blockchain technologies are being actively researched.A blockchain is a peer-to-peer data-sharing structure lacking central control.If a user wishes to access stored data,she/he must employ a private key to prove ownership of the data and create a transaction.If the private key is lost,blockchain data cannot be accessed.To solve such a problem,public blockchain users can recover the key using a wallet program.However,key recovery in a permissioned blockchain(PBC)has been but little studied.The PBC server is Honest-but-Curious(HBC),and should not be able to learn anything of the user;the server should simply recover and store the key.The server must also be resistant to malicious attacks.Therefore,key recovery in a PBC must satisfy various security requirements.Here,we present a password-protected secret sharing(PPSS)key recovery system,protected by a secure password from a malicious key storage server of a PBC.We describe existing key recovery schemes and our PPSS scheme.

A Secret Sharing Featured Secure Communication System Based on Dual Synchronization of Chaos in Colpitts Circuits

A novel digital secure communication system employing dual synchronization of chaos in two pairs of Colpitts circuits is proposed. The binary information to be transmitted is firstly modulated by digital modulation scheme, and then mixed together with two chaotic waveforms generated by two Colpitts circuits with different circuit parameters. Thus the combined （and encrypted） signal is transmitted through an additive white Gauss noise （AWGN） channel. In the receiver, the binary message can he recovered only when the parameters of the two Colpitts circuits are known. If the parameters of the two Colpitts circuits are owned by two different users, this can be viewed as a （2,2） threshold scheme. Based on large amount of simulations, the bit error rate （BER） performance of this communication scheme is presented.

High-dimension multiparty quantum secret sharing scheme with Einstein-Podolsky-Rosen pairs

In this paper a high-dimension multiparty quantum secret sharing scheme is proposed by using Einstein-Podolsky-Rosen pairs and local unitary operators. This scheme has the advantage of not only having higher capacity, but also saving storage space. The security analysis is also given.

A New Rational Secret Sharing Scheme

In this paper,we propose a new approach for rational secret sharing in game theoretic settings.The trusted center is eliminated in the secret reconstruction phase.Every player doesn’t know current round is real round or fake round.The gain of following the protocol is more than the gain of deviating,so rational player has an incentive to abide the protocol.Finally,every player can obtain the secret fairly.Our scheme is verifiable and any player’s cheating can not work.Furthermore the proposed scheme is immune to backward induction and satisfies resilient equilibrium.No player of the coalition C can do better,even if the whole coalition C cheats.Our scheme can withstand the conspiracy attack with at most m-1 players.

Measurement-device-independent quantum secret sharing with hyper-encoding

Quantum secret sharing(QSS) is a typical multi-party quantum communication mode, in which the key sender splits a key into several parts and the participants can obtain the key by cooperation. Measurement-device-independent quantum secret sharing(MDI-QSS) is immune to all possible attacks from measurement devices and can greatly enhance QSS's security in practical applications. However, previous MDI-QSS's key generation rate is relatively low. Here, we adopt the polarization-spatial-mode hyper-encoding technology in the MDI-QSS, which can increase single photon's channel capacity. Meanwhile, we use the cross-Kerr nonlinearity to realize the complete hyper-entangled Greenberger-Horne-Zeilinger state analysis. Both above factors can increase MDI-QSS's key generation rate by about 10^(3). The proposed hyper-encoded MDI-QSS protocol may be useful for future multiparity quantum communication applications.

Participant attack on quantum secret sharing based on entanglement swapping

The security of quantum secret sharing based on entanglement swapping is revisited and a participant attack is presented. In this attack two dishonest agents together can illegally recover the secret quantum state without the help of any other controller, and it will not be detected by any other users. Furthermore, by modifying the distribution process of particles and adding a detection step after each distribution process, we propose an improved protocol which can resist this kind of attack.

Dynamic quantum secret sharing protocol based on two-particle transform of Bell states

To solve the problems of updating sub-secrets or secrets as well as adding or deleting agents in the quantum secret sharing protocol, we propose a two-particle transform of Bell states, and consequently present a novel dynamic quantum secret sharing protocol. The new protocol can not only resist some typical attacks, but also be more efficient than the existing protocols. Furthermore, we take advantage of the protocol to establish the dynamic secret sharing of a quantum state protocol for two-particle maximum entangled states.

Robust Multiparty Quantum Secret Key Sharing Over Two Collective-Noise Channels via Three-Photon Mixed States

We present a robust （n, n）-threshold scheme for multiparty quantum secret sharing of key over two collectivenoise channels （i.e., the collective dephasing channel and the collective rotating channel） via three-photon mixed states, In our scheme, only if all the sharers collaborate together can they establish a joint key with the message sender and extract the secret message from the sender＇s encrypted message. This scheme can be implemented using only a Bell singlet, a one-qubit state and polarization identification of single photon, so it is completely feasible according to the present-day technique.

Secret sharing of quantum information via entanglement swapping

Based on entanglement swapping, a scheme for the secret sharing of an arbitrary two-particle entangled state is proposed. If the controllers do not co-operate with the eavesdropper, the eavesdropper＇s successful probability decreases with the number of the controllers increasing. In addition, only the Bell-state measurements are required to realize the secret sharing scheme.

Verifiable Secret Redistribution for Proactive Secret Sharing Schemes

A new scheme to verifiably redistribute a secret from the old to new shareholders without reconstruction of the secret is presented in this paper. The scheme allows redistribution between different access structures and between different threshold schemes. A point worth mentioning is that this verifiable secret redistribution (VSR) scheme can identify dishonest old shareholders during redistribution without any assumption. A certain technique is adopted to verify the correctness of the old shares of the secret. As a result, the scheme is very efficient. It can be applied to proactive secret sharing (PSS) schemes to construct more flexible and practical proactive secret sharing schemes.

Multiparty Quantum Secret Sharing Using Two-Photon Three-Dimensional Bell States

We present a two-photon three-dimensional multiparty quantum secret sharing scheme.The secret messagesare encoded by performing local operations.This is different from those quantum secret sharing protocols that all sharersmust make a state measurement.The merit of our protocol is the high capacity.

Quantum Secret Sharing Based on Chinese Remainder Theorem

A novel quantum secret sharing （QSS） scheme is proposed on the basis of Chinese Remainder Theorem （CRT）. In the scheme, the classical messages are mapped to secret sequences according to CRT equations, and distributed to different receivers by different dimensional superdense-coding respectively. CRT＇s secret sharing function, together with high-dimensional superdense-eoding, provide convenience, security, and large capability quantum channel for secret distribution and recovering. Analysis shows the security of the scheme.

Improved Multipartite Quantum Secret Sharing Protocol Using Preshared Greenberger-Horne-Zeilinger States

Inspired by the protocol presented by Bagherinezhad and Karimipour[Phys.Rev.A 67(2003) 044302], which will be shown to be insecure,we present a multipartite quantum secret sharing protocol using reusable GreenbergerHorne -Zeilinger(GHZ) states.This protocol is robust against eavesdropping and could be used for the circumstance of many parties.