In order to relvedy the security weaknesses of a robust user authentication framework for wireless sensor networks, an enhanced user authentication framework is presented. The enhanced scheme requires proof of the pos...In order to relvedy the security weaknesses of a robust user authentication framework for wireless sensor networks, an enhanced user authentication framework is presented. The enhanced scheme requires proof of the possession of both a password and a snort card, and provides more security guarantees in two aspects： 1） it addresses the untmceability property so that any third party accessing the communication channel cannot link two authentication sessions originated from the same user, and 2） the use of a smart card prevents offiine attacks to guess passwords. The security and efficiency analyses indicate that our enhanced scheme provides the highest level of security at reasonable computational costs. Therefore, it is a practical authentication scheme with attractive security features for wireless sensor networks.展开更多
In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single...In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single PU in their frameworks. In this paper, we will consider a more complicated scenario with multiple PUs and try to investigate the cooperative jamming between multiple PUs and a single SU. When there are multiple PUs in CRN, in order to obtain more spectrum for data transmission, SU will cooperate with multiple PUs at the same time. Considering that both PU and SU are rational and selfish individuals, the interaction between PUs and SU is formulated as a multi-leaders and single-follower Stackelberg game, wherein PU is the leader and SU is the follower. And the Stackelberg Equilibrium(SE) is considered as the final decisions accepted by all PUs and SU. Furthermore, we also prove that when a specific condition is satisfied, the existence of SE can be guaranteed. And a Gauss-Jacobi iterative algorithm is proposed to compute a SE. Finally, simulation results are given to verify the performance and demonstrate that both of the PUs' secrecy rate and the SU's transmission rate can be improved through cooperation.展开更多
With the rapid development of location-aware devices such as smart phones,Location-Based Services(LBSs) are becoming increasingly popular. Users can enjoy convenience by sending queries to LBS servers and obtaining se...With the rapid development of location-aware devices such as smart phones,Location-Based Services(LBSs) are becoming increasingly popular. Users can enjoy convenience by sending queries to LBS servers and obtaining service information that is nearby.However, these queries may leak the users' locations and interests to the un-trusted LBS servers, leading to serious privacy concerns. In this paper, we propose a Privacy-Preserving Pseudo-Location Updating System(3PLUS) to achieve k-anonymity for mobile users using LBSs. In 3PLUS, without relying on a third party, each user keeps pseudo-locations obtained from both the history locations and the encountered users, and randomly exchanges one of them with others when encounters occur. As a result, each user's buffer is disordered. A user can obtain any k locations from the buffer to achieve k-anonymity locally. The security analysis shows the security properties and our evaluation results indicate that the user's privacy is significantly improved.展开更多
Attribute-based encryption(ABE) supports the fine-grained sharing of encrypted data.In some common designs,attributes are managed by an attribute authority that is supposed to be fully trustworthy.This concept implies...Attribute-based encryption(ABE) supports the fine-grained sharing of encrypted data.In some common designs,attributes are managed by an attribute authority that is supposed to be fully trustworthy.This concept implies that the attribute authority can access all encrypted data,which is known as the key escrow problem.In addition,because all access privileges are defined over a single attribute universe and attributes are shared among multiple data users,the revocation of users is inefficient for the existing ABE scheme.In this paper,we propose a novel scheme that solves the key escrow problem and supports efficient user revocation.First,an access controller is introduced into the existing scheme,and then,secret keys are generated corporately by the attribute authority and access controller.Second,an efficient user revocation mechanism is achieved using a version key that supports forward and backward security.The analysis proves that our scheme is secure and efficient in user authorization and revocation.展开更多
To enhance the security of user data in the clouds,we present an adaptive and dynamic data encryption method to encrypt user data in the mobile phone before it is uploaded.Firstly,the adopted data encryption algorithm...To enhance the security of user data in the clouds,we present an adaptive and dynamic data encryption method to encrypt user data in the mobile phone before it is uploaded.Firstly,the adopted data encryption algorithm is not static and uniform.For each encryption,this algorithm is adaptively and dynamically selected from the algorithm set in the mobile phone encryption system.From the mobile phone's character,the detail encryption algorithm selection strategy is confirmed based on the user's mobile phone hardware information,personalization information and a pseudo-random number.Secondly,the data is rearranged with a randomly selected start position in the data before being encrypted.The start position's randomness makes the mobile phone data encryption safer.Thirdly,the rearranged data is encrypted by the selected algorithm and generated key.Finally,the analysis shows this method possesses the higher security because the more dynamics and randomness are adaptively added into the encryption process.展开更多
Due to its characteristics distribution and virtualization, cloud storage also brings new security problems. User＇s data is stored in the cloud, which separated the ownership from management. How to ensure the securi...Due to its characteristics distribution and virtualization, cloud storage also brings new security problems. User＇s data is stored in the cloud, which separated the ownership from management. How to ensure the security of cloud data, how to increase data availability and how to improve user privacy perception are the key issues of cloud storage research, especially when the cloud service provider is not completely trusted. In this paper, a cloud storage ciphertext retrieval scheme based on AES and homomorphic encryption is presented. This ciphertext retrieval scheme will not only conceal the user retrieval information, but also prevent the cloud from obtaining user access pattern such as read-write mode, and access frequency, thereby ensuring the safety of the ciphertext retrieval and user privacy. The results of simulation analysis show that the performance of this ciphertext retrieval scheme requires less overhead than other schemes on the same security level.展开更多
基金This work was supported by the Program for Changjiang Scholars and Innovative Research Team in University under Grant No. IRT1078 the Key Program of NSFC-Guangdong Union Foundation under Grant No.U1135002+3 种基金 the Major National S＆T Program under Grant No.2011ZX03005-002 the National Natural Science Foundation of China under Grants No. 61072066, No.61173135, No.61100230, No.61100233, No.61202389, No.61202390 the Natural Science Basic Research Plan in Shaanxi Province of China under Grants No.2012JQ8043, No. 2012JM8030, No. 2012JM8025, No2011JQ8003 the Fundamental Research Funds for the Central Universities under Cxants No. JY10000903001, No. K50511030004. The authors would like to thank the anonymous reviewers and the editor for their constructive comments that have helped us to improve this paper.
文摘In order to relvedy the security weaknesses of a robust user authentication framework for wireless sensor networks, an enhanced user authentication framework is presented. The enhanced scheme requires proof of the possession of both a password and a snort card, and provides more security guarantees in two aspects： 1） it addresses the untmceability property so that any third party accessing the communication channel cannot link two authentication sessions originated from the same user, and 2） the use of a smart card prevents offiine attacks to guess passwords. The security and efficiency analyses indicate that our enhanced scheme provides the highest level of security at reasonable computational costs. Therefore, it is a practical authentication scheme with attractive security features for wireless sensor networks.
基金supported in part by the National Key Research and Development Program of China under Grant 2016QY01W0204in part by Key Industrial Innovation Chain in Industrial Domain under Grant 2016KTZDGY-02in part by National High-Level TalentsSpecial Support Program of China under Grant CS31117200001
文摘In cognitive radio networks(CRNs), through recruiting secondary user(SU) as friendly jammer, the secrecy rate obtained by primary user(PU) can be improved. Previous work only considered a simple scenario with a single PU in their frameworks. In this paper, we will consider a more complicated scenario with multiple PUs and try to investigate the cooperative jamming between multiple PUs and a single SU. When there are multiple PUs in CRN, in order to obtain more spectrum for data transmission, SU will cooperate with multiple PUs at the same time. Considering that both PU and SU are rational and selfish individuals, the interaction between PUs and SU is formulated as a multi-leaders and single-follower Stackelberg game, wherein PU is the leader and SU is the follower. And the Stackelberg Equilibrium(SE) is considered as the final decisions accepted by all PUs and SU. Furthermore, we also prove that when a specific condition is satisfied, the existence of SE can be guaranteed. And a Gauss-Jacobi iterative algorithm is proposed to compute a SE. Finally, simulation results are given to verify the performance and demonstrate that both of the PUs' secrecy rate and the SU's transmission rate can be improved through cooperation.
基金supported by the National Natural Science Foundation of China under Grants No.61003300,No.61272457the Fundamental Research Funds for the Central Universities under Grant No.K5051201041the China 111 Project under Grant No.B08038
文摘With the rapid development of location-aware devices such as smart phones,Location-Based Services(LBSs) are becoming increasingly popular. Users can enjoy convenience by sending queries to LBS servers and obtaining service information that is nearby.However, these queries may leak the users' locations and interests to the un-trusted LBS servers, leading to serious privacy concerns. In this paper, we propose a Privacy-Preserving Pseudo-Location Updating System(3PLUS) to achieve k-anonymity for mobile users using LBSs. In 3PLUS, without relying on a third party, each user keeps pseudo-locations obtained from both the history locations and the encountered users, and randomly exchanges one of them with others when encounters occur. As a result, each user's buffer is disordered. A user can obtain any k locations from the buffer to achieve k-anonymity locally. The security analysis shows the security properties and our evaluation results indicate that the user's privacy is significantly improved.
基金supported by the NSFC(61173141,U1536206,61232016, U1405254,61373133,61502242,61572258)BK20150925+3 种基金Fund of Jiangsu Engineering Center of Network Monitoring(KJR1402)Fund of MOE Internet Innovation Platform(KJRP1403)CICAEETthe PAPD fund
文摘Attribute-based encryption(ABE) supports the fine-grained sharing of encrypted data.In some common designs,attributes are managed by an attribute authority that is supposed to be fully trustworthy.This concept implies that the attribute authority can access all encrypted data,which is known as the key escrow problem.In addition,because all access privileges are defined over a single attribute universe and attributes are shared among multiple data users,the revocation of users is inefficient for the existing ABE scheme.In this paper,we propose a novel scheme that solves the key escrow problem and supports efficient user revocation.First,an access controller is introduced into the existing scheme,and then,secret keys are generated corporately by the attribute authority and access controller.Second,an efficient user revocation mechanism is achieved using a version key that supports forward and backward security.The analysis proves that our scheme is secure and efficient in user authorization and revocation.
文摘To enhance the security of user data in the clouds,we present an adaptive and dynamic data encryption method to encrypt user data in the mobile phone before it is uploaded.Firstly,the adopted data encryption algorithm is not static and uniform.For each encryption,this algorithm is adaptively and dynamically selected from the algorithm set in the mobile phone encryption system.From the mobile phone's character,the detail encryption algorithm selection strategy is confirmed based on the user's mobile phone hardware information,personalization information and a pseudo-random number.Secondly,the data is rearranged with a randomly selected start position in the data before being encrypted.The start position's randomness makes the mobile phone data encryption safer.Thirdly,the rearranged data is encrypted by the selected algorithm and generated key.Finally,the analysis shows this method possesses the higher security because the more dynamics and randomness are adaptively added into the encryption process.
基金the National Natural Science Foundation of China under Grant，the Fundamental Research Funds for the Central Universities under Grant No.FRF-TP-14-046A2
文摘Due to its characteristics distribution and virtualization, cloud storage also brings new security problems. User＇s data is stored in the cloud, which separated the ownership from management. How to ensure the security of cloud data, how to increase data availability and how to improve user privacy perception are the key issues of cloud storage research, especially when the cloud service provider is not completely trusted. In this paper, a cloud storage ciphertext retrieval scheme based on AES and homomorphic encryption is presented. This ciphertext retrieval scheme will not only conceal the user retrieval information, but also prevent the cloud from obtaining user access pattern such as read-write mode, and access frequency, thereby ensuring the safety of the ciphertext retrieval and user privacy. The results of simulation analysis show that the performance of this ciphertext retrieval scheme requires less overhead than other schemes on the same security level.
