In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every cipherte...In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every ciphertext is specified with an access policy,a decryptor can access the data if and only if his secret key matches with the access policy.However,the FE cannot be directly applied to construct access control scheme due to the exposure of the access policy which may contain sensitive information.In this paper,we deal with the policy privacy issue and present a mechanism named multi-authority vector policy(MAVP) which provides hidden and expressive access policy for FE.Firstly,each access policy is encoded as a matrix and decryptors can only obtain the matched result from the matrix in MAVP.Then,we design a novel function encryption scheme based on the multi-authority spatial policy(MAVPFE),which can support privacy-preserving yet non-monotone access policy.Moreover,we greatly improve the efficiency of encryption and decryption in MAVP-FE by shifting the major computation of clients to the outsourced server.Finally,the security and performance analysis show that our MAVP-FE is secure and efficient in practice.展开更多
Projections of climate change are essential to guide sustainable development plans in the tropical Andean countries such as Peru. This study assessed the projections of precipitation and potential evaporation, rain er...Projections of climate change are essential to guide sustainable development plans in the tropical Andean countries such as Peru. This study assessed the projections of precipitation and potential evaporation, rain erosive potential, and precipitation concentration in the Mantaro River Basin, in the Peruvian Andes, which is important for agriculture and energy production in Peru. We assumed the Intergovernmental Panel on Climate Change (IPCC) AIB greenhouse gas emission scenario and simulated the global climate change by the HadCM3 global climate model. Due to the steepness of the mountain slopes and the narrowness of the river valley, this study uses the downscaling of the global model simulations by the regional Eta model down to 2o-km resolution. The downscaling projections show decrease in the monthly precipitation with respect to the baseline period, especially during the rainy season, between February and April, until the end of the 21st century. Meanwhile, a progressive increase in the monthly evaporation from the baseline period is projected. The Modified Fournier Index (MFI) shows a statistically significant downward trend in the Mantaro River Basin, whieh suggests a possible reduction in the rain erosive potential. The Precipitation Concentration Index (PCI) shows a statistically significant increasing trend, which indicates increasingly more irregular temporal distribution of precipitation towards the end of the century. The results of this study allow us to conclude that there should be a gradual increase in water deficit and precipitation concentration. Both changes can be negative for agriculture, power generation, and water supply in the Mantaro River Basin in Peru.展开更多
The sender shares six-particle maximally entangled states as quantum channel with the receiver. If the quantum channel is secure, the sender performs projective measurements and tells the measurement outcome to the re...The sender shares six-particle maximally entangled states as quantum channel with the receiver. If the quantum channel is secure, the sender performs projective measurements and tells the measurement outcome to the receiver. The receiver performs the unitary transformations and makes projective measurements on his particles to obtain the secret information. Using teleportation, the transmission of three-qubit secret information can be completed in each quantum channel展开更多
Certificate Authority (CA) is the core of public key infrastructure. However, the traditional structure of CA is either hierarchical or reticular, and none of them is suitable for security require-nients come from the...Certificate Authority (CA) is the core of public key infrastructure. However, the traditional structure of CA is either hierarchical or reticular, and none of them is suitable for security require-nients come from the new trend in enterprise cooperation, namely virtual enterprise (VE). In this paper a new idea - virtual certificate authority (VCA), is proposed, as well as its implemen-tation. The goal of VCA is to provide global certificate service over vital enterprise while keeping CA of each participant intact as much as possible. Unlike PEM, PGP, and BCA, by using secret sharing scheme, virtual CA avoids the need for TTP and supports virtual enterprise's feature of dynamical construction and destruction.展开更多
A theoretical protocol of quantum dialogue is proposed,which uses a class of three-photon W states asquantum channel.After two-step security check,four-bit secret message can be transmitted to each other by transmitti...A theoretical protocol of quantum dialogue is proposed,which uses a class of three-photon W states asquantum channel.After two-step security check,four-bit secret message can be transmitted to each other by transmittingof single photon with the aid of two-bit classical information.展开更多
The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, pr...The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.展开更多
In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 (2006) 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 (...In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 (2006) 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 (2006) 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.展开更多
With the ( k, n )-threshold scheme of secret sharing in the field of information security technology as an application background, the concept of set ( k, n )-exact cover is presented in this paper. It is a modifi...With the ( k, n )-threshold scheme of secret sharing in the field of information security technology as an application background, the concept of set ( k, n )-exact cover is presented in this paper. It is a modification of the original concept of set covering problem. It is also different from the concept of exact cover defined by J.E. Hopcmft. Some properties of (k, n ) -exact cover are investigated; a sufficient condition for a set to be ( k, n ) -exactly coverable is given. It follows that a feasible assignment scheme of a set for the ( k, n) -exact eover is obtained if this set satisfies the sufficient condition.展开更多
Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every lin...Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey's secret sharing scheme.展开更多
In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised...In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.展开更多
This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt's protocol which works ...This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt's protocol which works in synchronous model. Compared with the method of using secret share protocol m times to share m secrets, our protocol is quite efficient. The protocol can be used to improve the efficiency of secure multi-party computation (MPC) greatly in asynchronous network.展开更多
We proposed a novel and efficient multiparty quantum secret sharing scheme using entangled state which in that the number of parties can be arbitrary large.The state which we used,has special properties that make our ...We proposed a novel and efficient multiparty quantum secret sharing scheme using entangled state which in that the number of parties can be arbitrary large.The state which we used,has special properties that make our scheme simple and safe.The operations which are needed to recover secret message,are only exclusive-or addition and complement operation.Moreover it is shown that this scheme is secure against eavesdropping.Also this scheme provides the best quantum bit efficiency compared with some famous quantum secret sharing schemes.展开更多
By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which e...By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which employs unitary transformations to encode information. On the basis of the fact that the unitary transformations used in a QSDC protocol are secret and independent, a novel quantum covert channel protocol is proposed to transfer secret messages with unconditional security. The performance, including the imperceptibility, capacity and security of the proposed protocol are analyzed in detail.展开更多
基金supported by the National Science Foundation of China (No.61373040,No.61173137)The Ph.D.Pro-grams Foundation of Ministry of Education of China(20120141110073)Key Project of Natural Science Foundation of Hubei Province (No.2010CDA004)
文摘In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every ciphertext is specified with an access policy,a decryptor can access the data if and only if his secret key matches with the access policy.However,the FE cannot be directly applied to construct access control scheme due to the exposure of the access policy which may contain sensitive information.In this paper,we deal with the policy privacy issue and present a mechanism named multi-authority vector policy(MAVP) which provides hidden and expressive access policy for FE.Firstly,each access policy is encoded as a matrix and decryptors can only obtain the matched result from the matrix in MAVP.Then,we design a novel function encryption scheme based on the multi-authority spatial policy(MAVPFE),which can support privacy-preserving yet non-monotone access policy.Moreover,we greatly improve the efficiency of encryption and decryption in MAVP-FE by shifting the major computation of clients to the outsourced server.Finally,the security and performance analysis show that our MAVP-FE is secure and efficient in practice.
基金FAPEMIG (PPM X 45-16)CNPqpartially funded by CNPq 308035/2013-5
文摘Projections of climate change are essential to guide sustainable development plans in the tropical Andean countries such as Peru. This study assessed the projections of precipitation and potential evaporation, rain erosive potential, and precipitation concentration in the Mantaro River Basin, in the Peruvian Andes, which is important for agriculture and energy production in Peru. We assumed the Intergovernmental Panel on Climate Change (IPCC) AIB greenhouse gas emission scenario and simulated the global climate change by the HadCM3 global climate model. Due to the steepness of the mountain slopes and the narrowness of the river valley, this study uses the downscaling of the global model simulations by the regional Eta model down to 2o-km resolution. The downscaling projections show decrease in the monthly precipitation with respect to the baseline period, especially during the rainy season, between February and April, until the end of the 21st century. Meanwhile, a progressive increase in the monthly evaporation from the baseline period is projected. The Modified Fournier Index (MFI) shows a statistically significant downward trend in the Mantaro River Basin, whieh suggests a possible reduction in the rain erosive potential. The Precipitation Concentration Index (PCI) shows a statistically significant increasing trend, which indicates increasingly more irregular temporal distribution of precipitation towards the end of the century. The results of this study allow us to conclude that there should be a gradual increase in water deficit and precipitation concentration. Both changes can be negative for agriculture, power generation, and water supply in the Mantaro River Basin in Peru.
基金supported by the National Natural Science Foundation of China under Grant No.10704011the Research Programs of the Educational Office of Liaoning Province under Grant No.2008006
文摘The sender shares six-particle maximally entangled states as quantum channel with the receiver. If the quantum channel is secure, the sender performs projective measurements and tells the measurement outcome to the receiver. The receiver performs the unitary transformations and makes projective measurements on his particles to obtain the secret information. Using teleportation, the transmission of three-qubit secret information can be completed in each quantum channel
基金the High Technoeogy Research and Debelopment Program of China
文摘Certificate Authority (CA) is the core of public key infrastructure. However, the traditional structure of CA is either hierarchical or reticular, and none of them is suitable for security require-nients come from the new trend in enterprise cooperation, namely virtual enterprise (VE). In this paper a new idea - virtual certificate authority (VCA), is proposed, as well as its implemen-tation. The goal of VCA is to provide global certificate service over vital enterprise while keeping CA of each participant intact as much as possible. Unlike PEM, PGP, and BCA, by using secret sharing scheme, virtual CA avoids the need for TTP and supports virtual enterprise's feature of dynamical construction and destruction.
基金Supported by the National Natural Science Foundation of China under Grant No.10704011the Research Programs of the Educational Office of Liaoning Province under Grant No.2008006
文摘A theoretical protocol of quantum dialogue is proposed,which uses a class of three-photon W states asquantum channel.After two-step security check,four-bit secret message can be transmitted to each other by transmittingof single photon with the aid of two-bit classical information.
基金supported by the National Natural Science Foundation of China(Grant No.41371402)the National Basic Research Program of China("973"Program)(Grant No.2011CB302306)the Fundamental Research Funds for the Central University(Grant No.2015211020201 and No.211274230)
文摘The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.
基金Supported by National Natural Science Foundation of China under Grant No.60903152National Laboratory for Modern Communications Science Foundation of China under Grant No.9140C1101010601+3 种基金the Beijing Natural Science Foundation under Grant No.4072020a Key Project of Fujian Provincial Universities - Information Technology Research Based on Mathematics the Fujian Province Natural Science Foundation under Grant No.2008J0013the Foundation of Fujian Education Bureau under Grant No.JA08044
文摘In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 (2006) 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 (2006) 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.
基金Supported by the National Natural Science Foundation of China (No. 60673053 90718011 )
文摘With the ( k, n )-threshold scheme of secret sharing in the field of information security technology as an application background, the concept of set ( k, n )-exact cover is presented in this paper. It is a modification of the original concept of set covering problem. It is also different from the concept of exact cover defined by J.E. Hopcmft. Some properties of (k, n ) -exact cover are investigated; a sufficient condition for a set to be ( k, n ) -exactly coverable is given. It follows that a feasible assignment scheme of a set for the ( k, n) -exact eover is obtained if this set satisfies the sufficient condition.
文摘Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey's secret sharing scheme.
基金Supported in part by an International Macquarie University Research Excellence Scholarship(i MQRES),Australian Research Council Grant DP0987734also supported by the National Basic Research Program of China(973 Program)under Grant No.2010CB923200+2 种基金the National Natural Science Foundation of China under No.61377067Fund of State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications,China,National Natural Science Foundation of China under Grant Nos.61202362,61262057,61472433China Postdoctora Science Foundation under Grant No.2013M542560
文摘In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.
基金the National Natural Science Foundation of China(No.60803146)
文摘This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt's protocol which works in synchronous model. Compared with the method of using secret share protocol m times to share m secrets, our protocol is quite efficient. The protocol can be used to improve the efficiency of secure multi-party computation (MPC) greatly in asynchronous network.
文摘We proposed a novel and efficient multiparty quantum secret sharing scheme using entangled state which in that the number of parties can be arbitrary large.The state which we used,has special properties that make our scheme simple and safe.The operations which are needed to recover secret message,are only exclusive-or addition and complement operation.Moreover it is shown that this scheme is secure against eavesdropping.Also this scheme provides the best quantum bit efficiency compared with some famous quantum secret sharing schemes.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61170272, 61272514, 61003287, and 61070163Asia Foresight Program under National Natural Science Foundation of China under Grant No.61161140320+4 种基金the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.20100005120002the Fok Ying Tong Education Foundation under Grant No.131067the Shandong Provincial Natural Science Foundation, China under Grant No.ZR2011FM023the Shandong Province Outstanding Research Award Fund for Young Scientists of China under Grant No.BS2011DX034the Fundamental Research Funds for the Central Universities under Grant No.BUPT2012RC0221
文摘By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which employs unitary transformations to encode information. On the basis of the fact that the unitary transformations used in a QSDC protocol are secret and independent, a novel quantum covert channel protocol is proposed to transfer secret messages with unconditional security. The performance, including the imperceptibility, capacity and security of the proposed protocol are analyzed in detail.