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 GreenbergerHo...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.展开更多
Very recently,Lee et al.proposed a secure quantum teleportation protocol to transfer shared quantum secret between multiple parties in a network[Phys.Rev.Lett.124060501(2020)].This quantum network is encoded with a ma...Very recently,Lee et al.proposed a secure quantum teleportation protocol to transfer shared quantum secret between multiple parties in a network[Phys.Rev.Lett.124060501(2020)].This quantum network is encoded with a maximally entangled GHZ state.In this paper,we consider a partially entangled GHZ state as the entanglement channel,where it can achieve,probabilistically,unity fidelity transfer of the state.Two kinds of strategies are given.One arises when an auxiliary particle is introduced and a general evolution at any receiver's location is then adopted.The other one involves performing a single generalized Bell-state measurement at the location of any sender.This could allow the receivers to recover the transmitted state with a certain probability,in which only the local Pauli operators are performed,instead of introducing an auxiliary particle.In addition,the successful probability is provided,which is determined by the degree of entanglement of the partially multipartite entangled state.Moreover,the proposed protocol is robust against the bit and phase flip noise.展开更多
At present,most quantum secret sharing(QSS)protocols are more or less designed with the incorporation of classical secret sharing schemes.With the increasing maturity of quantum technology,QSS protocols based on pure ...At present,most quantum secret sharing(QSS)protocols are more or less designed with the incorporation of classical secret sharing schemes.With the increasing maturity of quantum technology,QSS protocols based on pure quantum mechanics are becoming more important.Classical secret sharing schemes cannot achieve absolute security,and their involvement can compromise the security of QSS protocols.This paper proposes a QSS scheme based on Greenberger-Horn-Zeilinger(GHZ)basis measurement and quantum entanglement exchange.In this protocol,the secret sender stores the secret information using Pauli operations.Participants obtain their shares by measuring the product state sequentially.Finally,participants complete the secret reconstruction through quantum entanglement exchange and other related quantum operations.In addition,the particles held by participants in the protocol do not contain any secret information.Each participant's particles are in a state of maximum entanglement,and no participant can deduce the particle information of other participants through their own particles.At the same time,the protocol is based on pure quantum mechanics and does not involve classical schemes,which avoids the problem of reduced security of the protocol.Security analysis indicates that the protocol is not vulnerable to retransmission interception and collusion attacks.Moreover,it is capable of detecting and terminating the protocol promptly when facing with attacks from dishonest participants.展开更多
The rational secret sharing cannot be realized in the case of being played only once, and some punishments in the one-time rational secret sharing schemes turn out to be empty threats. In this paper, after modeling 2-...The rational secret sharing cannot be realized in the case of being played only once, and some punishments in the one-time rational secret sharing schemes turn out to be empty threats. In this paper, after modeling 2-out-of-2 rational secret sharing based on Bayesian game and considering different classes of protocol parties, we propose a 2-out-of-2 secret sharing scheme to solve cooperative problem of a rational secret sharing scheme being played only once. Moreover, we prove that the strategy is a perfect Bayesian equilibrium, adopted only by the parties in their decision-making according to their belief system （denoted by the probability distribution） and Bayes rule, without requiring simultaneous channels.展开更多
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...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.展开更多
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,...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.展开更多
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 nove...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.展开更多
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 a...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.展开更多
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 wit...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.展开更多
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.展开更多
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 prob...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.展开更多
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-pho...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.展开更多
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 s...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.展开更多
This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GH...This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.展开更多
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 parti...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.展开更多
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 distrib...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.展开更多
In this paper we propose a novel and efficient quantum secret sharing protocol using d-level single particle,which it can realize a general access structure via the thought of concatenation. In addition, Our scheme in...In this paper we propose a novel and efficient quantum secret sharing protocol using d-level single particle,which it can realize a general access structure via the thought of concatenation. In addition, Our scheme includes all advantages of Tavakoli's scheme [Phys. Rev. A 92 (2015) 030302(R)]. In contrast to Tavakoli's scheme, the efficiency of our scheme is 1 for the same situation, and the access structure is more general and has advantages in practical significance. Furthermore, we also analyze the security of our scheme in the primary quantum attacks.展开更多
A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none d...A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.展开更多
A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encode...A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.展开更多
This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet al （2002 Phys. Rev. A 65 022304） and the quantum secret sha...This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet al （2002 Phys. Rev. A 65 022304） and the quantum secret sharing scheme by Deng et al （2008 Phys. Lett. A 372 1957）. Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstei^Podolsky-l^osen pairs in d-dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 21bd bits of information, and almost all the pairs can be used for carrying useful information.展开更多
基金Supported by National Natural Science Foundation of China under Grant Nos.60878059,11004033Natural Science Foundation of Fujian Province under Grant No.2010J01002
文摘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.
基金Project supported by the Open Fund of Advanced Cryptography and System Security Key Laboratory of Sichuan Province,China(Grant No.SKLACSS-202108)the Open Research Fund of Key Laboratory of Cryptography of Zhejiang Province,China(Grant No.ZCL21006)+3 种基金the National Natural Science Foundation of China(Grant Nos.U1636106,92046001,61671087,61962009,and 61170272)the BUPT Excellent Ph.D.Students Foundation(Grant No.CX2020310)Natural Science Foundation of Beijing Municipality,China(Grant No.4182006)the Fundamental Research Funds for the Central Universities,China(Grant No.2019XD-A02).
文摘Very recently,Lee et al.proposed a secure quantum teleportation protocol to transfer shared quantum secret between multiple parties in a network[Phys.Rev.Lett.124060501(2020)].This quantum network is encoded with a maximally entangled GHZ state.In this paper,we consider a partially entangled GHZ state as the entanglement channel,where it can achieve,probabilistically,unity fidelity transfer of the state.Two kinds of strategies are given.One arises when an auxiliary particle is introduced and a general evolution at any receiver's location is then adopted.The other one involves performing a single generalized Bell-state measurement at the location of any sender.This could allow the receivers to recover the transmitted state with a certain probability,in which only the local Pauli operators are performed,instead of introducing an auxiliary particle.In addition,the successful probability is provided,which is determined by the degree of entanglement of the partially multipartite entangled state.Moreover,the proposed protocol is robust against the bit and phase flip noise.
基金Project supported by the National Natural Science Foundation of China(Grant No.62002105)the Key Research and Development Program of Hubei,China(Grant No.2021BEA163)。
文摘At present,most quantum secret sharing(QSS)protocols are more or less designed with the incorporation of classical secret sharing schemes.With the increasing maturity of quantum technology,QSS protocols based on pure quantum mechanics are becoming more important.Classical secret sharing schemes cannot achieve absolute security,and their involvement can compromise the security of QSS protocols.This paper proposes a QSS scheme based on Greenberger-Horn-Zeilinger(GHZ)basis measurement and quantum entanglement exchange.In this protocol,the secret sender stores the secret information using Pauli operations.Participants obtain their shares by measuring the product state sequentially.Finally,participants complete the secret reconstruction through quantum entanglement exchange and other related quantum operations.In addition,the particles held by participants in the protocol do not contain any secret information.Each participant's particles are in a state of maximum entanglement,and no participant can deduce the particle information of other participants through their own particles.At the same time,the protocol is based on pure quantum mechanics and does not involve classical schemes,which avoids the problem of reduced security of the protocol.Security analysis indicates that the protocol is not vulnerable to retransmission interception and collusion attacks.Moreover,it is capable of detecting and terminating the protocol promptly when facing with attacks from dishonest participants.
基金Supported by the Major National Science and Technology program (2011ZX03005-002)the National Natural Science Foundation of China (60872041, 61072066, 60963023, 60970143)the Fundamental Research Funds for the Central Universities (JY10000903001, JY10000901034)
文摘The rational secret sharing cannot be realized in the case of being played only once, and some punishments in the one-time rational secret sharing schemes turn out to be empty threats. In this paper, after modeling 2-out-of-2 rational secret sharing based on Bayesian game and considering different classes of protocol parties, we propose a 2-out-of-2 secret sharing scheme to solve cooperative problem of a rational secret sharing scheme being played only once. Moreover, we prove that the strategy is a perfect Bayesian equilibrium, adopted only by the parties in their decision-making according to their belief system （denoted by the probability distribution） and Bayes rule, without requiring simultaneous channels.
基金This work was supported by the National Key Basic Research Program of China （NO. 2007CB311106）, Beijing Municipal Natural Science Foundation.（No. 1102003） and Youth Science Foundation of Henan Normal University （No. 525198）.
文摘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.
基金Project supported by the National Fundamental Research Program （Grant No 001CB309308）, China National Natural Science Foundation （Grant Nos 60433050, 10325521, 10447106）, the Hang-Tian Science Fund, the SRFDP program of Education Ministry of China and Beijing Education Committee （Grant No XK100270454）.
文摘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.
基金Project supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘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.
文摘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.
基金Project supported by the National High Technology Research and Development Program of China (Grant No 2006AA01Z419)the Major Research Plan of the National Natural Science Foundation of China (Grant Nos 90604023, 60873191 and 60821001)+2 种基金the National Laboratory for Modern Communications Science Foundation of China (Grant No 9140C1101010601)the Natural Science Foundation of Beijing, China (Grant No 4072020)the Integrated Service Network Open Foundation
文摘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.
基金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.
基金Project supported by the National Natural Science Foundation of China （Grant No 60261002） and the Science Foundation of Yanbian University （Grant No 2005-20）.
文摘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.
基金The project supported by National Natural Science Foundation of China under Grant No. 10304022, the Science-Technology Fund of Anhui Province for 0utstanding Youth under Grant No. 06042087, the General Fund of the Educational Committee of Anhui Province under Grant No. 2006KJ260B, and the Key Fund of the Ministry of Education of China under Grant No. 206063. We are very grateful to Prof. ZHANG Zhan-Jun for his detailed instructions and help.
文摘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.
文摘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.
基金Supported by the National Science Council,Taiwan,China,under the Contract No.NSC 98-2221-E-006-097-MY3
文摘This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.
基金This project was supported by Liuhui Applied Mathematics Center of Nankai University .
文摘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.
基金Supported by the National Natural Science Foundation of China under Grant No.60902044Ph.D.Programs Foundation of Ministry of Education of China under Grant No.20090162120070+2 种基金Postdoctoral Science Foundation of China under Grant No.200801341State Key Laboratory of Advanced Optical Communication Systems and Networks under Grant No.2008SH01in part by the Second stage of Brain Korea 21 programs,Chonbuk National University,Korea
文摘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.
基金Sponsored by the National Natural Science Foundation of China under Grant Nos.61373150 and 61602291Industrial Research and Development Project of Science and Technology of Shaanxi Province under Grant No.2013k0611
文摘In this paper we propose a novel and efficient quantum secret sharing protocol using d-level single particle,which it can realize a general access structure via the thought of concatenation. In addition, Our scheme includes all advantages of Tavakoli's scheme [Phys. Rev. A 92 (2015) 030302(R)]. In contrast to Tavakoli's scheme, the efficiency of our scheme is 1 for the same situation, and the access structure is more general and has advantages in practical significance. Furthermore, we also analyze the security of our scheme in the primary quantum attacks.
基金This project was partially supported by the National Natural Science Foundation of China (60273049, 90104005).
文摘A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.
基金supported in part by National Natural Science Foundation of China under Grant Nos.60573127,60773012,and 60873082Natural Science Foundation of Hunan Province under Grant Nos.07JJ3128 and 2008RS4016+1 种基金Scientific Research Fund of Hunan Provincial Education Department under Grant No.08B011Postdoctoral Science Foundation of China under Grant Nos.20070420184 and 200801341
文摘A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.
基金Project supported by the National Natural Science Foundation (NSF) of China (Grant No 10847147)the NSF of Jiangsu Province, China (Grant No BK2008437)+1 种基金Jiangsu Provincial Universities (Grant No 07KJB510066)the Science Foundation of NUIST, China
文摘This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet al （2002 Phys. Rev. A 65 022304） and the quantum secret sharing scheme by Deng et al （2008 Phys. Lett. A 372 1957）. Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstei^Podolsky-l^osen pairs in d-dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 21bd bits of information, and almost all the pairs can be used for carrying useful information.
