In the paper [2010 Chin. Phys. B 19 050306], Yang et al. put forward a novel three-party quantum secret sharing protocol of secure direct communication based on x-type entangled states, they claimed that the scheme is...In the paper [2010 Chin. Phys. B 19 050306], Yang et al. put forward a novel three-party quantum secret sharing protocol of secure direct communication based on x-type entangled states, they claimed that the scheme is secure. However, in this paper, we study the security of the protocol and find that it is insecure. Applying intercept and resend attack, the agent Bob can obtain Alice＇s secret without the help from the other agent Charlie. In the end, we give our effective modification for its improvement.展开更多
As cloud computing is becoming prevalent, data owners are motivated to delegate complex data managements to the commercial cloud for economic savings. Sensitive data is usually encrypted before being uploaded to the c...As cloud computing is becoming prevalent, data owners are motivated to delegate complex data managements to the commercial cloud for economic savings. Sensitive data is usually encrypted before being uploaded to the cloud, which unfortunately makes the frequently-used search function a challenging problem. In this paper, we present a new multi-keyword dynamic search scheme with result ranking to make search over encrypted data more secure and practical. In the scheme, we employ a powerful function-hiding inner product encryption to enhance the security by preventing the leakage of search pattern. For the concern of efficiency, we adopt a tree-based index structure to facilitate the searching process and updating operations. A comprehensive security analysis is provided and experiments over the real world data show that our scheme is efficient.展开更多
Certificateless one-round key exchange(CL-ORKE)protocols enable each participant to share a common key with only one round of communication which greatly saves communication cost.CLORKE protocols can be applied to sce...Certificateless one-round key exchange(CL-ORKE)protocols enable each participant to share a common key with only one round of communication which greatly saves communication cost.CLORKE protocols can be applied to scenarios with limited communication,such as space communication.Although CL-ORKE protocols have been researched for years,lots of them only consider what secrets can be compromised but ignore the time when the secrets have been corrupted.In CL-ORKE protocols,the reveal of the long-term key attacks can be divided into two different attacks according to the time of the long-term key revealed:the attack to weak Forward Security(wFS)and the attack to strong Forward Security(sFS).Many CLKE protocols did not take into account the sFS property or considered sFS as wFS.In this paper,we first propose a new security model for CL-ORKE protocols which considers the sFS property as well as the Ephemeral Key Reveal attack.Then,we give a CL-ORKE protocol which is called CLORKE-SFS.CLORKE-SFS is provably secure under the proposed model provided the Elliptic Curve Computational Diffie-Hellman(ECCDH)and the Bilinear Computational Diffie-Hellman problem(BCDH)assumption hold.The security model and the protocol may give inspiration for constructing oneround key exchange protocols with perfect forward security in certificateless scenarios.展开更多
This paper proposes a protocol for multi-party quantum secret sharing utilizing four non-orthogonal two-particle entangled states following some ideas in the schemes proposed by Liu et al. （2006 Chin. Phys. Lett. 23 ...This paper proposes a protocol for multi-party quantum secret sharing utilizing four non-orthogonal two-particle entangled states following some ideas in the schemes proposed by Liu et al. （2006 Chin. Phys. Lett. 23 3148） and Zhang et al. （2009 Chin. Phys. B 18 2149） respectively. The theoretical efficiency for qubits of the new protocol is improved from 50% to approaching 100%. All the entangled states can be used for generating the private key except those used for the eavesdropping check. The validity of a probable attack called opaque cheat attack to this kind of protocols is considered in the paper for the first time.展开更多
By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Ni...By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos 60773135, 90718007 and 60970140, the National High-Tech Research and Development Program of China under Grant Nos 2007AA01Z427 and 2007AA01Z450.
基金Project supported by the National Natural Science Foundation of China(Grant No.60970140)
文摘In the paper [2010 Chin. Phys. B 19 050306], Yang et al. put forward a novel three-party quantum secret sharing protocol of secure direct communication based on x-type entangled states, they claimed that the scheme is secure. However, in this paper, we study the security of the protocol and find that it is insecure. Applying intercept and resend attack, the agent Bob can obtain Alice＇s secret without the help from the other agent Charlie. In the end, we give our effective modification for its improvement.
基金supported in part by the National Natural Science Foundation of China (61272481, 61572460, 61402352)the National Key Research and Development Project (2016YFB0800703)+2 种基金the National Information Security Special Projects of National Developmentthe Reform Commission of China [(2012)1424]China 111 Project (No. B16037)
文摘As cloud computing is becoming prevalent, data owners are motivated to delegate complex data managements to the commercial cloud for economic savings. Sensitive data is usually encrypted before being uploaded to the cloud, which unfortunately makes the frequently-used search function a challenging problem. In this paper, we present a new multi-keyword dynamic search scheme with result ranking to make search over encrypted data more secure and practical. In the scheme, we employ a powerful function-hiding inner product encryption to enhance the security by preventing the leakage of search pattern. For the concern of efficiency, we adopt a tree-based index structure to facilitate the searching process and updating operations. A comprehensive security analysis is provided and experiments over the real world data show that our scheme is efficient.
基金This work was supported by the National Natural Science Foundation of China(NSFC)under Grant(61902049,31960119)Joint Special Fund for Basic Research of Local Undergraduate Universities(Parts)in Yunnan Province under Grant(2018FH001-063,2018FH001-106)Dali University Innovation Team Project(ZKLX2020308).
文摘Certificateless one-round key exchange(CL-ORKE)protocols enable each participant to share a common key with only one round of communication which greatly saves communication cost.CLORKE protocols can be applied to scenarios with limited communication,such as space communication.Although CL-ORKE protocols have been researched for years,lots of them only consider what secrets can be compromised but ignore the time when the secrets have been corrupted.In CL-ORKE protocols,the reveal of the long-term key attacks can be divided into two different attacks according to the time of the long-term key revealed:the attack to weak Forward Security(wFS)and the attack to strong Forward Security(sFS).Many CLKE protocols did not take into account the sFS property or considered sFS as wFS.In this paper,we first propose a new security model for CL-ORKE protocols which considers the sFS property as well as the Ephemeral Key Reveal attack.Then,we give a CL-ORKE protocol which is called CLORKE-SFS.CLORKE-SFS is provably secure under the proposed model provided the Elliptic Curve Computational Diffie-Hellman(ECCDH)and the Bilinear Computational Diffie-Hellman problem(BCDH)assumption hold.The security model and the protocol may give inspiration for constructing oneround key exchange protocols with perfect forward security in certificateless scenarios.
基金supported by the Key Program of the National Natural Science Foundation of China (Grant No. 90718007)the National Natural Science Foundation of China (Grant Nos. 60773135 and 60970140)
文摘This paper proposes a protocol for multi-party quantum secret sharing utilizing four non-orthogonal two-particle entangled states following some ideas in the schemes proposed by Liu et al. （2006 Chin. Phys. Lett. 23 3148） and Zhang et al. （2009 Chin. Phys. B 18 2149） respectively. The theoretical efficiency for qubits of the new protocol is improved from 50% to approaching 100%. All the entangled states can be used for generating the private key except those used for the eavesdropping check. The validity of a probable attack called opaque cheat attack to this kind of protocols is considered in the paper for the first time.
基金supported by National Natural Science Foundation of China(Grant Nos.61272481 and 61402352)the China Scholarship Council,Beijing Natural Science Foundation(Grant No.4122089)+1 种基金National Development and Reform Commission(Grant No.20121424)the Norwegian Research Council
文摘By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.
