We present a(t,n)threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubitquantum state between two remote parties.The unknown m-qubit quantum state can be recovered by the receiver underc...We present a(t,n)threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubitquantum state between two remote parties.The unknown m-qubit quantum state can be recovered by the receiver undercontrol of a subset of the n controllers if the number of the subset is larger than or equal to a threshold,say,t,but not forany t —1 or fewer controllers.Our scheme seems to be more practical and more flexible than other existing protocols.Thequantum resource required is just m Einstein-Podolsky-Rosen(EPR)pairs plus some single photons.The techniquesrequired are only Bell state measurement,single-qubit unitary operation and von Neumann measurement.So our schemeis also feasible with present-day technique.展开更多
We present a new quantum protocol for solving detectable Byzantine agreement problem between threeparties by employing one quantum key distribution protocol.The protocol is suggested by a special four-qubit entangleds...We present a new quantum protocol for solving detectable Byzantine agreement problem between threeparties by employing one quantum key distribution protocol.The protocol is suggested by a special four-qubit entangledstate instead of singlet states,which shows that singlet states are not necessary to achieve detectable Byzantine agreement.展开更多
Multi-proxy signature is a scheme that an original signer delegates his or her signing capability to a proxy group. In the scheme, only the cooperation of all proxy signers in the proxy group can create a signature on...Multi-proxy signature is a scheme that an original signer delegates his or her signing capability to a proxy group. In the scheme, only the cooperation of all proxy signers in the proxy group can create a signature on behalf of the original signer. Jin and Wen firstly defined the formal security model of certificateless multi-proxy signature (CLMPS) and proposed a concrete CLMPS scheme. However, their construction model is inaccurate, the concrete signature scheme has has three problems: the definition of the strengthened security a security flaw, and the proof of the security is imperfect. With further consideration, a remedial strengthened security model is redefined, and an improved scheme is also proposed, which is existentially unforgeable against adaptively chosen-warrant, chosen-message and chosen-identity attacks in the random oracles. In this condition, the computational Diffie-Hellman (CDH) assumption is used to prove full security for our CLMPS scheme.展开更多
A quantum secret sharing (QSS) protocol between multiparty and multiparty is proposed, based on Greenberger-Horne- Zeilinger (GHZ) state. The protocol utilizes quantum Fourier transform and entanglement swapping t...A quantum secret sharing (QSS) protocol between multiparty and multiparty is proposed, based on Greenberger-Horne- Zeilinger (GHZ) state. The protocol utilizes quantum Fourier transform and entanglement swapping to achieve a high intrinsic efficiency and source capacity. Then, the security of this protocol against some possible eavesdropping strategies has been analyzed. Furthermore, the presented protocol is generalized to the d-level case.展开更多
In this article, a protocol for the teleportation of an unknown two-panicle entanglement is proposed. The feature of the present protocol is that we utilize an asymmetric threeparticle entangled state as the quantum c...In this article, a protocol for the teleportation of an unknown two-panicle entanglement is proposed. The feature of the present protocol is that we utilize an asymmetric threeparticle entangled state as the quantum channel. The optimal discrimination between two nonorthogonal quantum states is adopted. It is shown that an unknown two-particle entangled state can be probabilistically teleported from the sender to the remote receiver on condition that the co-sender successfully collaborates. The fidelity in this protocol is one. In addition, the probability of the successful teleportation is calculated and all kinds of transformations performed by the sender and the receiver are provided in detail.展开更多
A scheme for teleporting an unknown two-particle entangled state is proposed. In comparison with the recent protocol (Cola et al., Phys. Lett. A 337 (2005)), the entangled state as quantum channel required by this...A scheme for teleporting an unknown two-particle entangled state is proposed. In comparison with the recent protocol (Cola et al., Phys. Lett. A 337 (2005)), the entangled state as quantum channel required by this scheme is a single, partially entangled pair, which is much easier to prepare and maintain. Furthermore, a positive operator valued measure (POVM) is adopted and all kinds of transformations performed by sender and receiver are given in detail. It is shown that the probability of successful teleportation is twice the modulus square of the smaller Schmidt coefficient of the two-particle entangled state, and the fidelity can reach one.展开更多
Algebraic immunity is an important cryptographic property of Boolean functions. In this paper, odd-variable balanced Boolean functions with optimal algebraic immunity are obtained by m-sequence and consequently, we ge...Algebraic immunity is an important cryptographic property of Boolean functions. In this paper, odd-variable balanced Boolean functions with optimal algebraic immunity are obtained by m-sequence and consequently, we get bases with special constructions of vector space. Furthermore, through swapping some vectors of these two bases, we establish all kinds of odd-variable balanced Boolean functions with optimal algebraic immunity.展开更多
The timing and Hamming weight attacks on the data encryption standard (DES) cryptosystem for minimal cost encryption scheme is presented in this article. In the attack, timing information on encryption processing is...The timing and Hamming weight attacks on the data encryption standard (DES) cryptosystem for minimal cost encryption scheme is presented in this article. In the attack, timing information on encryption processing is used to select and collect effective plaintexts for attack. Then the collected plaintexts are utilized to infer the expanded key differences of the secret key, from which most bits of the expanded secret key are recovered. The remaining bits of the expanded secret key are deduced by the correlations between Hamming weight values of the input of the S-boxes in the first-round. Finally, from the linear relation of the encryption time and the secret key's Hamming weight, the entire 56 bits of the secret key are thoroughly recovered. Using the attack, the minimal cost encryption scheme can be broken with 2^23 known plaintexts and about 2^21 calculations at a success rate a 〉 99%. The attack has lower computing complexity, and the method is more effective than other previous methods.展开更多
Bent functions in trace forms play an important role in the constructions of generalized binary Bent se-quences.Trace representation of some degree two Bent functions are presented in this paper.A sufficient and nec-e...Bent functions in trace forms play an important role in the constructions of generalized binary Bent se-quences.Trace representation of some degree two Bent functions are presented in this paper.A sufficient and nec-essary condition is derived to determine whether the sum of the combinations of Gold functions,tr1^(n)(x^(2+1)),1≤i≤n−1,over finite fields 2n F(n be even)in addition to another term tr1^(n/2)(x^(2n/2+1))is a Bent function.Similar to the result presented by Khoo et al.,the condition can be verified by polynominal greatest common divisor(GCD)computation.A similar result also holds in the case n pF(n be even,p be odd prime).Using the constructed Bent functions and Niho type Bent functions given by Dobbertin et al.,many new generalized binary Bent sequences are obtained.展开更多
基金Supported by the National Basic Research Program of China (973 Program) under Grant No.2007CB311100the National Natural Science Foundation of China under Grant No.60873191+3 种基金the National High Technology Research and Development Program of China under Grant No.2006AA01Z419the Major Research plan of the National Natural Science Foundation of China under Grant No.90604023the Scientific Research Common Program of Beijing Municipal Commission of Education under Grant No.KM200810005004the Scientific Research Foundation for the Youth of Beijing University of Technology under Grant No.97007016200701
文摘We present a(t,n)threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubitquantum state between two remote parties.The unknown m-qubit quantum state can be recovered by the receiver undercontrol of a subset of the n controllers if the number of the subset is larger than or equal to a threshold,say,t,but not forany t —1 or fewer controllers.Our scheme seems to be more practical and more flexible than other existing protocols.Thequantum resource required is just m Einstein-Podolsky-Rosen(EPR)pairs plus some single photons.The techniquesrequired are only Bell state measurement,single-qubit unitary operation and von Neumann measurement.So our schemeis also feasible with present-day technique.
基金Supported by National Natural Science Foundation of China under Grant Nos.60873191,60903152,and 60821001SRFDP under Grant No.200800131016+5 种基金Beijing Nova Program under Grant No.2008B51Key Project of Chinese Ministry of Education under Grant No.109014Beijing Natural Science Foundation under Grant No.4072020China Postdoctoral Science Foundation under Grant No.20090450018National Laboratory for Modern Communications Science Foundation of China under Grant No.9140C1101010601ISN Open Foundation
文摘We present a new quantum protocol for solving detectable Byzantine agreement problem between threeparties by employing one quantum key distribution protocol.The protocol is suggested by a special four-qubit entangledstate instead of singlet states,which shows that singlet states are not necessary to achieve detectable Byzantine agreement.
基金supported by the National Natural Science Foundation of China (61170270,61100203,60903152,61003286,61121061)the Fundamental Research Funds for the Central Universities (BUPT2011YB01,BUPT2011RC0505,2011PTB-00-29,2011RCZJ15,2012RC0612)
文摘Multi-proxy signature is a scheme that an original signer delegates his or her signing capability to a proxy group. In the scheme, only the cooperation of all proxy signers in the proxy group can create a signature on behalf of the original signer. Jin and Wen firstly defined the formal security model of certificateless multi-proxy signature (CLMPS) and proposed a concrete CLMPS scheme. However, their construction model is inaccurate, the concrete signature scheme has has three problems: the definition of the strengthened security a security flaw, and the proof of the security is imperfect. With further consideration, a remedial strengthened security model is redefined, and an improved scheme is also proposed, which is existentially unforgeable against adaptively chosen-warrant, chosen-message and chosen-identity attacks in the random oracles. In this condition, the computational Diffie-Hellman (CDH) assumption is used to prove full security for our CLMPS scheme.
基金the Hi-Tech Research and Development Program of China (2006AA01Z419)the National Natural Science Foundation of China (90604023, 60873191, 60821001)+2 种基金the National Laboratory for Modern Communications Science Foundation of China (9140C1101010601)the Natural Science Foundation of Beijing (4072020)the Foundation of Fujian Education Bureau (JA08044)
文摘A quantum secret sharing (QSS) protocol between multiparty and multiparty is proposed, based on Greenberger-Horne- Zeilinger (GHZ) state. The protocol utilizes quantum Fourier transform and entanglement swapping to achieve a high intrinsic efficiency and source capacity. Then, the security of this protocol against some possible eavesdropping strategies has been analyzed. Furthermore, the presented protocol is generalized to the d-level case.
基金the Hi-Tech Research and Development Program of China(2006AA01Z419)the National Natural Science Foundation of China(90604023)+2 种基金the National Laboratory for Modem Communications Science Foundation of China(9140C1101010601)the Natural Science Foundation of Beijing(4072020)the ISN Open Foundation.
文摘In this article, a protocol for the teleportation of an unknown two-panicle entanglement is proposed. The feature of the present protocol is that we utilize an asymmetric threeparticle entangled state as the quantum channel. The optimal discrimination between two nonorthogonal quantum states is adopted. It is shown that an unknown two-particle entangled state can be probabilistically teleported from the sender to the remote receiver on condition that the co-sender successfully collaborates. The fidelity in this protocol is one. In addition, the probability of the successful teleportation is calculated and all kinds of transformations performed by the sender and the receiver are provided in detail.
基金National Natural Science Foundation of China (60373059) Major Research plan of the National Natural Science Foundation of China (90604023)+1 种基金 National Laboratory for Modem Communications Science Foundation of China (51436020103DZA001) National Research Foundation for the Doctoral Program of Higher Education of China (20040013007), ISN 0pen Foundation.
文摘A scheme for teleporting an unknown two-particle entangled state is proposed. In comparison with the recent protocol (Cola et al., Phys. Lett. A 337 (2005)), the entangled state as quantum channel required by this scheme is a single, partially entangled pair, which is much easier to prepare and maintain. Furthermore, a positive operator valued measure (POVM) is adopted and all kinds of transformations performed by sender and receiver are given in detail. It is shown that the probability of successful teleportation is twice the modulus square of the smaller Schmidt coefficient of the two-particle entangled state, and the fidelity can reach one.
基金supported by the National Natural Science Foundation of China (61102093, 61170270, 61121061)The Fundamental Research for the Central Universities (BUPT 2012RC0710)
文摘Algebraic immunity is an important cryptographic property of Boolean functions. In this paper, odd-variable balanced Boolean functions with optimal algebraic immunity are obtained by m-sequence and consequently, we get bases with special constructions of vector space. Furthermore, through swapping some vectors of these two bases, we establish all kinds of odd-variable balanced Boolean functions with optimal algebraic immunity.
基金supported by the National Basic Research Program of China (2007CB807902, 2007CB807903)the Education Innovation Foundation of Institution and University of Beijing (2004).
文摘The timing and Hamming weight attacks on the data encryption standard (DES) cryptosystem for minimal cost encryption scheme is presented in this article. In the attack, timing information on encryption processing is used to select and collect effective plaintexts for attack. Then the collected plaintexts are utilized to infer the expanded key differences of the secret key, from which most bits of the expanded secret key are recovered. The remaining bits of the expanded secret key are deduced by the correlations between Hamming weight values of the input of the S-boxes in the first-round. Finally, from the linear relation of the encryption time and the secret key's Hamming weight, the entire 56 bits of the secret key are thoroughly recovered. Using the attack, the minimal cost encryption scheme can be broken with 2^23 known plaintexts and about 2^21 calculations at a success rate a 〉 99%. The attack has lower computing complexity, and the method is more effective than other previous methods.
基金supported by the National Natural Science Foundation of China(No.60373059)the National Research Foundation for the Doctoral Program of Higher Education of China(No.20040013007)the Research Foundation of the State Key Laboratory of Information Security.
文摘Bent functions in trace forms play an important role in the constructions of generalized binary Bent se-quences.Trace representation of some degree two Bent functions are presented in this paper.A sufficient and nec-essary condition is derived to determine whether the sum of the combinations of Gold functions,tr1^(n)(x^(2+1)),1≤i≤n−1,over finite fields 2n F(n be even)in addition to another term tr1^(n/2)(x^(2n/2+1))is a Bent function.Similar to the result presented by Khoo et al.,the condition can be verified by polynominal greatest common divisor(GCD)computation.A similar result also holds in the case n pF(n be even,p be odd prime).Using the constructed Bent functions and Niho type Bent functions given by Dobbertin et al.,many new generalized binary Bent sequences are obtained.