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 i...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.展开更多
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...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.展开更多
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...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.展开更多
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...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.展开更多
Semi-quantum secret sharing(SQSS)is a branch of quantum cryptography which only requires the dealer to have quantum capabilities,reducing the difficulty of protocol implementation.However,the efficiency of the SQSS pr...Semi-quantum secret sharing(SQSS)is a branch of quantum cryptography which only requires the dealer to have quantum capabilities,reducing the difficulty of protocol implementation.However,the efficiency of the SQSS protocol still needs to be further studied.In this paper,we propose a semi-quantum secret sharing protocol,whose efficiency can approach 100%as the length of message increases.The protocol is based on single particles to reduce the difficulty of resource preparation.Particle reordering,a simple but effective operation,is used in the protocol to improve efficiency and ensure security.Furthermore,our protocol can share specific secrets while most SQSS protocols could not.We also prove that the protocol is secure against common attacks.展开更多
The aim of quantum secret sharing,as one of most promising components of quantum cryptograph,is one-tomultiparty secret communication based on the principles of quantum mechanics.In this paper,an efficient multiparty ...The aim of quantum secret sharing,as one of most promising components of quantum cryptograph,is one-tomultiparty secret communication based on the principles of quantum mechanics.In this paper,an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed.Each participant's shadow is encoded on a single qudit via a measuring basis encryption method,which avoids the waste of qudits caused by basis reconciliation.Security analysis indicates that the proposed protocol is immune to general attacks,such as the measure-resend attack,entangle-and-measure attack and Trojan horse attack.Compared to former protocols,the proposed protocol only needs to perform the single-qudit measurement operation,and can share the predetermined dits instead of random bits or dits.展开更多
With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA)....With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA).A modified version of the traditional N-Th Degree Truncated Polynomial Ring(NTRU)cryptosystem called NTRU Prime has been developed to reduce the attack surface.In this paper,the Signcryption scheme was proposed,and it is most efficient than others since it reduces the complexity and runs the time of the code execution,and at the same time,provides a better security degree since it ensures the integrity of the sent message,confidentiality of the data,forward secrecy when using refreshed parameters for each session.Unforgeability to prevent the man-in-the-middle attack from being active or passive,and non-repudiation when the sender can’t deny the recently sent message.This study aims to create a novel NTRU cryptography algorithm system that takes advantage of the security features of curve fitting operations and the valuable characteristics of chaotic systems.The proposed algorithm combines the(NTRU Prime)and Shamir’s Secret Sharing(SSS)features to improve the security of the NTRU encryption and key generation stages that rely on robust polynomial generation.Based on experimental results and a comparison of the time required for crucial exchange between NTRU-SSS and the original NTRU,this study shows a rise in complexity with a decrease in execution time in the case when compared to the original NTRU.It’s encouraging to see signs that the suggested changes to the NTRU work to increase accuracy and efficiency.展开更多
In this paper, the concepts of topological space and differential manifold are introduced, and it is proved that the surface determined by function F (x<sub>2</sub>, x<sub>2</sub>, …, x<sub...In this paper, the concepts of topological space and differential manifold are introduced, and it is proved that the surface determined by function F (x<sub>2</sub>, x<sub>2</sub>, …, x<sub>t</sub>) of class C<sup>r</sup> in Euelidean R<sup>t</sup> is a differential manifold. Using the intersection of the tangent plane and the hypernormal of the differential manifold to construct the shared master key of participants, an intuitive, secure and complete (t,n)-threshold secret sharing scheme is designed. The paper is proved to be safe, and the probability of successful attack of attackers is only 1/p<sup>t</sup><sup>-1</sup>. When the prime number p is sufficiently large, the probability is almost 0. The results show that this scheme has the characteristics of single-parameter representation of the master key in the geometric method, and is more practical and easy to implement than the Blakley threshold secret sharing scheme.展开更多
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. Thi...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.展开更多
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 selec...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.展开更多
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-indep...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.展开更多
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 da...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.展开更多
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 sec...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/<em>p</em> (where <em>p</em> is a large prime).展开更多
QR codes are applied widely on the Internet and mobile devices in recent years.Its open standards and the characteristics of easy to generate lead to anyone can generate their QR code easily.Also,the QR code does not ...QR codes are applied widely on the Internet and mobile devices in recent years.Its open standards and the characteristics of easy to generate lead to anyone can generate their QR code easily.Also,the QR code does not have the ability of hiding information,which leads to everyone can get access to read the content in any QR code,including those hiding some secret content in the bytes of QR code.Therefore,in recent years,information tampering and information leakage cases caused by poor security of two-dimensional code occur frequently,especially in the financial field and multi-party verification scenarios.QR codes are almost impossible to use in these scenarios.Therefore,this paper proposes a distributed information sharing method based on information hiding QR code.This method can make secret code in QR code safer and robust,and the secret shared between receivers can be used for decryption and attacking detection.Therefore,on the one hand,the information hiding method can maximize the capacity of embedded secret information,on the other hand,it can prevent attacks by disguised attackers and recover hidden secret information through reconstruction.This paper illustrates the feasibility of this scheme through the form of theoretical proof.展开更多
With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response...With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response(QR)code has been widely researched in IoT.However,the security of privacy data in IoT is also a very important issue.At the same time,because IoT is developing towards low-power devices in order to be applied to more fields,the technology protecting the security of private needs to have the characteristics of low computational complexity.Visual Secret Sharing(VSS),with its features of safety and low computational cost,can fully meet the requirements of communication security in IoT.Therefore,a VSS scheme with QR code(VSS-QR)was proposed and has been applied to some extent.In VSS-QR,the secret is shared into a series of shares.These shares are usually common QR codes,which cannot cause the attention of the attacker.However,if there is dishonesty among participants,the secret cannot be recovered,which will lead to VSS-QR cannot be widely used due to its inadequate security.In this paper,we propose a visual secret sharing scheme with authentication based on QR code(VSSA-QR).Both the reconstructed secret QR code and shares can be verified whether they are forged by attackers.The above-mentioned operations conveniently are performed on low-power QR scanning devices.Not only does the proposed scheme prevent some dishonest participants or attackers from cheating,but also prevent all participants from conspiring.In addition,the payload is the QR code itself,which is higher than other schemes.Theoretical analysis and experiments prove that the proposed scheme is effective.展开更多
The main purpose of verifiable secret sharing scheme is to solve the honesty problem of participants. In this paper, the concept of nonzero <em>k</em>-submatrix and theresidual vector of system of hyperpla...The main purpose of verifiable secret sharing scheme is to solve the honesty problem of participants. In this paper, the concept of nonzero <em>k</em>-submatrix and theresidual vector of system of hyperplane intersecting line equations is proposed. Based on certain projective transformations in projective space, a verifiable (<em>t</em>, <em>n</em>)-threshold secret sharing scheme is designed by using the structure of solutions of linear equations and the difficulty of solving discrete logarithm problems. The results show that this scheme can verify the correctness of the subkey provided by each participant before the reconstruction of the master key, and can effectively identify the fraudster. The fraudster can only cheat by guessing and the probability of success is only 1/<em>p</em>. The design of the scheme is exquisite and the calculation complexity is small. Each participant only needs to hold a subkey, which is convenient for management and use. The analysis shows that the scheme in this paper meets the security requirements and rules of secret sharing, and it is a computationally secure and effective scheme with good practical value.展开更多
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 u...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.展开更多
Quantum secret sharing(QSS)is one of the basic communication primitives in future quantum networks which addresses part of the basic cryptographic tasks of multiparty communication and computation.Nevertheless,it is a...Quantum secret sharing(QSS)is one of the basic communication primitives in future quantum networks which addresses part of the basic cryptographic tasks of multiparty communication and computation.Nevertheless,it is a challenge to provide a practical QSS protocol with security against general attacks.A QSS protocol that balances security and practicality is still lacking.Here,we propose a QSS protocol with simple phase encoding of coherent states among three parties.Removing the requirement of impractical entangled resources and the need for phase randomization,our protocol can be implemented with accessible technology.We provide the finite-key analysis against coherent attacks and implement a proof-of-principle experiment to demonstrate our scheme’s feasibility.Our scheme achieves a key rate of 85.3 bps under a 35 d B channel loss.Combined with security against general attacks and accessible technology,our protocol is a promising candidate for practical multiparty quantum communication networks.展开更多
This study presents enhancing images authentication by securing watermarking hidden data via shares generated from counting-based secret sharing.The trustfulness of shares utilised secret-sharing as an applicable priv...This study presents enhancing images authentication by securing watermarking hidden data via shares generated from counting-based secret sharing.The trustfulness of shares utilised secret-sharing as an applicable privacy creation tool for the authentication of real-life complex platforms.This research adjusts embedding the watermarking data over the images by innovative redistribution of shares to be embedded spread over all the images.The anticipated watermarking technique guaranteed to scatter the share bits implanting at different least significant bits of image pixels as boosting up the trust overall authentication practicality.The paper experimentation performance analysis shows that this improved image watermarking authentication(capacity)is averagely better by 33%–67%than other related exclusive-OR oriented and octagon approaches.Interestingly,these measurement improvements did not degrade the robustness and security of the system,inspiring our research for opening novel track of related future counting-based secret-sharing authentication progresses to come.展开更多
Image secret sharing(ISS)is gaining popularity due to the importance of digital images and its wide application to cloud-based distributed storage and multiparty secure computing.Shadow image authentication generally ...Image secret sharing(ISS)is gaining popularity due to the importance of digital images and its wide application to cloud-based distributed storage and multiparty secure computing.Shadow image authentication generally includes shadow image detection and identification,and plays an important role in ISS.However,traditional dealer-participatory methods,which suffer from significant pixel expansion or storing auxiliary information,authenticate the shadow image mainly during the decoding phase,also known as unidirectional authentication.The authentication of the shadow image in the distributing(encoding)phase is also important for the participant.In this study,we introduce a public key based bidirectional shadow image authentication method in ISS without pixel expansion for a(k,n)threshold.When the dealer distributes each shadow image to a corresponding participant,the participant can authenticate the received shadow image with his/her private key.In the decoding phase,the dealer can authenticate each received shadow image with a secret key;in addition,the dealer can losslessly decode the secret image with any k or more shadow images.The proposed method is validated using theoretical analyses,illustrations,and comparisons.展开更多
基金supported by RUSA PHASE 2.0,Alagappa University,Karaikudi,India。
文摘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.
基金Project supported by the Offline Course Program of“Experiment of College Physics”in the 2022-year Anhui Provincial Quality Engineering Program (Grant No.2022xxkc134)the Program for Academic Leader Reserve Candidates in Tongling University (Grant Nos.2020tlxyxs43 and 2014tlxyxs30)+1 种基金the Talent Scientific Research Foundation of Tongling University (Grant No.2015tlxyrc01)the 2014 year Program for Excellent Youth Talents in University of Anhui Province。
文摘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.
基金the State’s Key Project of Research and Development Plan under Grant 2022YFB2701400in part by the National Natural Science Foundation of China under Grants 62272124 and 62361010+4 种基金in part by the Science and Technology Planning Project of Guizhou Province under Grant[2020]5017in part by the Research Project of Guizhou University for Talent Introduction underGrant[2020]61in part by theCultivation Project of Guizhou University under Grant[2019]56in part by the Open Fund of Key Laboratory of Advanced Manufacturing Technology,Ministry of Education under Grant GZUAMT2021KF[01]the Science and Technology Program of Guizhou Province(No.[2023]371).
文摘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.
基金support from the National Natural Science Foundation of China (No.62005164,62222507,62175101,and 62005166)the Shanghai Natural Science Foundation (23ZR1443700)+3 种基金Shuguang Program of Shanghai Education Development Foundation and Shanghai Municipal Education Commission (23SG41)the Young Elite Scientist Sponsorship Program by CAST (No.20220042)Science and Technology Commission of Shanghai Municipality (Grant No.21DZ1100500)the Shanghai Municipal Science and Technology Major Project,and the Shanghai Frontiers Science Center Program (2021-2025 No.20).
文摘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.
基金Project supported by the National Key Research and Development Program of China(Grant No.2020YFB1805405)the 111 Project(Grant No.B21049),the National Natural Science Foundation of China(Grant No.62272051)+1 种基金the Foundation of Guizhou Provincial Key Laboratory of Public Big Data(Grant No.2019BDKFJJ014)the Fundamental Research Funds for the Central Universities of China(Grant Nos.2019XD-A02 and 2020RC38).
文摘Semi-quantum secret sharing(SQSS)is a branch of quantum cryptography which only requires the dealer to have quantum capabilities,reducing the difficulty of protocol implementation.However,the efficiency of the SQSS protocol still needs to be further studied.In this paper,we propose a semi-quantum secret sharing protocol,whose efficiency can approach 100%as the length of message increases.The protocol is based on single particles to reduce the difficulty of resource preparation.Particle reordering,a simple but effective operation,is used in the protocol to improve efficiency and ensure security.Furthermore,our protocol can share specific secrets while most SQSS protocols could not.We also prove that the protocol is secure against common attacks.
基金Project supported by the Doctoral Funding of Nanchang Hangkong University(Grant No.EA202204231)the National Natural Science Foundation of China(Grant Nos.61866027and 6217070290)+1 种基金the Key research project of Jiangxi Province(Grant No.20212BBE53017)the Shanghai Science and Technology Project(Grant Nos.21JC1402800 and20040501500)。
文摘The aim of quantum secret sharing,as one of most promising components of quantum cryptograph,is one-tomultiparty secret communication based on the principles of quantum mechanics.In this paper,an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed.Each participant's shadow is encoded on a single qudit via a measuring basis encryption method,which avoids the waste of qudits caused by basis reconciliation.Security analysis indicates that the proposed protocol is immune to general attacks,such as the measure-resend attack,entangle-and-measure attack and Trojan horse attack.Compared to former protocols,the proposed protocol only needs to perform the single-qudit measurement operation,and can share the predetermined dits instead of random bits or dits.
文摘With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA).A modified version of the traditional N-Th Degree Truncated Polynomial Ring(NTRU)cryptosystem called NTRU Prime has been developed to reduce the attack surface.In this paper,the Signcryption scheme was proposed,and it is most efficient than others since it reduces the complexity and runs the time of the code execution,and at the same time,provides a better security degree since it ensures the integrity of the sent message,confidentiality of the data,forward secrecy when using refreshed parameters for each session.Unforgeability to prevent the man-in-the-middle attack from being active or passive,and non-repudiation when the sender can’t deny the recently sent message.This study aims to create a novel NTRU cryptography algorithm system that takes advantage of the security features of curve fitting operations and the valuable characteristics of chaotic systems.The proposed algorithm combines the(NTRU Prime)and Shamir’s Secret Sharing(SSS)features to improve the security of the NTRU encryption and key generation stages that rely on robust polynomial generation.Based on experimental results and a comparison of the time required for crucial exchange between NTRU-SSS and the original NTRU,this study shows a rise in complexity with a decrease in execution time in the case when compared to the original NTRU.It’s encouraging to see signs that the suggested changes to the NTRU work to increase accuracy and efficiency.
文摘In this paper, the concepts of topological space and differential manifold are introduced, and it is proved that the surface determined by function F (x<sub>2</sub>, x<sub>2</sub>, …, x<sub>t</sub>) of class C<sup>r</sup> in Euelidean R<sup>t</sup> is a differential manifold. Using the intersection of the tangent plane and the hypernormal of the differential manifold to construct the shared master key of participants, an intuitive, secure and complete (t,n)-threshold secret sharing scheme is designed. The paper is proved to be safe, and the probability of successful attack of attackers is only 1/p<sup>t</sup><sup>-1</sup>. When the prime number p is sufficiently large, the probability is almost 0. The results show that this scheme has the characteristics of single-parameter representation of the master key in the geometric method, and is more practical and easy to implement than the Blakley threshold secret sharing scheme.
文摘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.
基金Supported by the 973 Project of China(G19990358?04)
文摘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.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11974189 and 12175106)。
文摘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.
基金This research was supported by the MSIT(Ministry of Science and ICT),Korea,under the ITRC(Information Technology Research Center)support program(IITP-2020-2015-0-00403)supervised by the IITP(Institute for Information&communications Technology Planning&Evaluation)This research was supported by the Soonchunhyang University Research Fund.
文摘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.
文摘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/<em>p</em> (where <em>p</em> is a large prime).
基金This work was partially supported by the National Natural Science Foundation of China(61876089,61876185,61902281,61375121)the Opening Project of Jiangsu Key Laboratory of Data Science and Smart Software(No.2019DS301)+1 种基金the Engineering Research Center of Digital Forensics,Ministry of Education,the Science and Technology Program of Jiangsu Province Construction System(2020JH08)the Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘QR codes are applied widely on the Internet and mobile devices in recent years.Its open standards and the characteristics of easy to generate lead to anyone can generate their QR code easily.Also,the QR code does not have the ability of hiding information,which leads to everyone can get access to read the content in any QR code,including those hiding some secret content in the bytes of QR code.Therefore,in recent years,information tampering and information leakage cases caused by poor security of two-dimensional code occur frequently,especially in the financial field and multi-party verification scenarios.QR codes are almost impossible to use in these scenarios.Therefore,this paper proposes a distributed information sharing method based on information hiding QR code.This method can make secret code in QR code safer and robust,and the secret shared between receivers can be used for decryption and attacking detection.Therefore,on the one hand,the information hiding method can maximize the capacity of embedded secret information,on the other hand,it can prevent attacks by disguised attackers and recover hidden secret information through reconstruction.This paper illustrates the feasibility of this scheme through the form of theoretical proof.
基金This work was supported in part by the Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology under Grant 2016r055in part by the Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions.
文摘With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response(QR)code has been widely researched in IoT.However,the security of privacy data in IoT is also a very important issue.At the same time,because IoT is developing towards low-power devices in order to be applied to more fields,the technology protecting the security of private needs to have the characteristics of low computational complexity.Visual Secret Sharing(VSS),with its features of safety and low computational cost,can fully meet the requirements of communication security in IoT.Therefore,a VSS scheme with QR code(VSS-QR)was proposed and has been applied to some extent.In VSS-QR,the secret is shared into a series of shares.These shares are usually common QR codes,which cannot cause the attention of the attacker.However,if there is dishonesty among participants,the secret cannot be recovered,which will lead to VSS-QR cannot be widely used due to its inadequate security.In this paper,we propose a visual secret sharing scheme with authentication based on QR code(VSSA-QR).Both the reconstructed secret QR code and shares can be verified whether they are forged by attackers.The above-mentioned operations conveniently are performed on low-power QR scanning devices.Not only does the proposed scheme prevent some dishonest participants or attackers from cheating,but also prevent all participants from conspiring.In addition,the payload is the QR code itself,which is higher than other schemes.Theoretical analysis and experiments prove that the proposed scheme is effective.
文摘The main purpose of verifiable secret sharing scheme is to solve the honesty problem of participants. In this paper, the concept of nonzero <em>k</em>-submatrix and theresidual vector of system of hyperplane intersecting line equations is proposed. Based on certain projective transformations in projective space, a verifiable (<em>t</em>, <em>n</em>)-threshold secret sharing scheme is designed by using the structure of solutions of linear equations and the difficulty of solving discrete logarithm problems. The results show that this scheme can verify the correctness of the subkey provided by each participant before the reconstruction of the master key, and can effectively identify the fraudster. The fraudster can only cheat by guessing and the probability of success is only 1/<em>p</em>. The design of the scheme is exquisite and the calculation complexity is small. Each participant only needs to hold a subkey, which is convenient for management and use. The analysis shows that the scheme in this paper meets the security requirements and rules of secret sharing, and it is a computationally secure and effective scheme with good practical value.
文摘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.
基金supported by the National Natural Science Foundation of China(Grant No.12274223)the Natural Science Foundation of Jiangsu Province(Grant No.BK20211145)+3 种基金the Fundamental Research Funds for the Central Universities(Grant No.020414380182)the Key Research and Development Program of Nanjing Jiangbei New Aera(Grant No.ZDYD20210101)the Program for Innovative Talents and Entrepreneurs in Jiangsu(Grant No.JSSCRC2021484)the Program of Songshan Laboratory(Included in the management of Major Science and Technology Program of Henan Province)(Grant No.221100210800)。
文摘Quantum secret sharing(QSS)is one of the basic communication primitives in future quantum networks which addresses part of the basic cryptographic tasks of multiparty communication and computation.Nevertheless,it is a challenge to provide a practical QSS protocol with security against general attacks.A QSS protocol that balances security and practicality is still lacking.Here,we propose a QSS protocol with simple phase encoding of coherent states among three parties.Removing the requirement of impractical entangled resources and the need for phase randomization,our protocol can be implemented with accessible technology.We provide the finite-key analysis against coherent attacks and implement a proof-of-principle experiment to demonstrate our scheme’s feasibility.Our scheme achieves a key rate of 85.3 bps under a 35 d B channel loss.Combined with security against general attacks and accessible technology,our protocol is a promising candidate for practical multiparty quantum communication networks.
文摘This study presents enhancing images authentication by securing watermarking hidden data via shares generated from counting-based secret sharing.The trustfulness of shares utilised secret-sharing as an applicable privacy creation tool for the authentication of real-life complex platforms.This research adjusts embedding the watermarking data over the images by innovative redistribution of shares to be embedded spread over all the images.The anticipated watermarking technique guaranteed to scatter the share bits implanting at different least significant bits of image pixels as boosting up the trust overall authentication practicality.The paper experimentation performance analysis shows that this improved image watermarking authentication(capacity)is averagely better by 33%–67%than other related exclusive-OR oriented and octagon approaches.Interestingly,these measurement improvements did not degrade the robustness and security of the system,inspiring our research for opening novel track of related future counting-based secret-sharing authentication progresses to come.
基金Project supported by the National Natural Science Foundation of China(No.62271496)。
文摘Image secret sharing(ISS)is gaining popularity due to the importance of digital images and its wide application to cloud-based distributed storage and multiparty secure computing.Shadow image authentication generally includes shadow image detection and identification,and plays an important role in ISS.However,traditional dealer-participatory methods,which suffer from significant pixel expansion or storing auxiliary information,authenticate the shadow image mainly during the decoding phase,also known as unidirectional authentication.The authentication of the shadow image in the distributing(encoding)phase is also important for the participant.In this study,we introduce a public key based bidirectional shadow image authentication method in ISS without pixel expansion for a(k,n)threshold.When the dealer distributes each shadow image to a corresponding participant,the participant can authenticate the received shadow image with his/her private key.In the decoding phase,the dealer can authenticate each received shadow image with a secret key;in addition,the dealer can losslessly decode the secret image with any k or more shadow images.The proposed method is validated using theoretical analyses,illustrations,and comparisons.
