The paper proposes a novel hardware-based private information retrieval （HWPIR） protocol. By partially reshuffling previously accessed items in each round, instead of frequently reshuffling the whole database, the s...The paper proposes a novel hardware-based private information retrieval （HWPIR） protocol. By partially reshuffling previously accessed items in each round, instead of frequently reshuffling the whole database, the scheme makes better use of shuffled data copies and achieves the computation overhead at O（/N/K）,where N and k are the sizes of the database and secure storage respectively. For securestorage with moderate size, e.g. k = O（/N）, the overhead is 0（4/N）. The result is much better than the state-of-art schemes （as compared to e.g. O（log2N））. Without increasing response time and communication cost, the proposed protocol is truly practicable regardless of the database size. The security and preformance of the protocol is formally analyzed.展开更多
The computational complexity of privacy information retrieval protocols is often linearly related to database size.When the database size is large,the efficiency of privacy information retrieval protocols is relativel...The computational complexity of privacy information retrieval protocols is often linearly related to database size.When the database size is large,the efficiency of privacy information retrieval protocols is relatively low.This paper designs an effective privacy information retrieval model based on hybrid fully homomorphic encryption.The assignment method is cleverly used to replace a large number of homomorphic encryption operations.At the same time,the multiplicative homomorphic encryption scheme is first used to deal with the large-scale serialization in the search,and then the fully homomorphic encryption scheme is used to deal with the remaining simple operations.The depth of operations supported by the fully homomorphic scheme no longer depends on the size of the database,but only needs to support the single homomorphic encryption scheme to decrypt the circuit depth.Based on this hybrid homomorphic encryption retrieval model,the efficiency of homomorphic privacy information retrieval model can be greatly improved.展开更多
针对云环境图像认证过程中潜在的泄露数据所有者及用户图像特征隐私的问题,提出了一种基于属性基隐私信息检索(private information retrieval,PIR)的隐私保护云图像认证算法,借助属性基PIR完成密态环境下的隐私图像认证。一方面,云服...针对云环境图像认证过程中潜在的泄露数据所有者及用户图像特征隐私的问题,提出了一种基于属性基隐私信息检索(private information retrieval,PIR)的隐私保护云图像认证算法,借助属性基PIR完成密态环境下的隐私图像认证。一方面,云服务器存储的由数据所有者提供的图像特征被加密,防止云服务器获取数据所有者隐私信息;另一方面,用户在认证时并不需要提供明文的数据特征,并且所提供的加密属性特征也经过泛化处理,最大程度地保护用户隐私。通过性能分析,在理论上证明了所提算法具有较好的隐私保护能力和算法执行效率;通过人脸和虹膜公共数据集进行了模拟实验测试,实验结果和成因分析证明了所提算法相比同类算法更为优越。展开更多
A new method to evaluate fuzzily user＇s relevance on the basis of cloud models has been proposed. All factors of personalized information retrieval system are taken into account in this method. So using this method f...A new method to evaluate fuzzily user＇s relevance on the basis of cloud models has been proposed. All factors of personalized information retrieval system are taken into account in this method. So using this method for personalized information retrieval （PIR） system can efficiently judge multi-value relevance, such as quite relevant, comparatively relevant, commonly relevant, basically relevant and completely non-relevant, and realize a kind of transform of qualitative concepts and quantity and improve accuracy of relevance judgements in PIR system. Experimental data showed that the method is practical and valid. Evaluation results are more accurate and approach to the fact better.展开更多
In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the dr...In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the drivers to determine the information about the parking lot in real time and book them depending on the requirement.But the existing smart parking systems necessitate the drivers to reveal their sensitive information that includes their mobile number,personal identity,and desired destination.This disclosure of sensitive information makes the existing centralized smart parking systems more vulnerable to service providers’security breaches,single points of failure,and bottlenecks.In this paper,an Improved Asymmetric Consortium Blockchain and Homomorphically Computing Univariate Polynomial-based private information retrieval(IACB-HCUPPIR)scheme is proposed to ensure parking lots’availability with transparency security in a privacy-preserving smart parking system.In specific,an improved Asymmetric Consortium Blockchain is used for achieving secure transactions between different parties interacting in the smart parking environment.It further adopted the method of Homomorphically Computing Univariate Polynomial-based private information retrieval(HCUPPIR)scheme for preserving the location privacy of drivers.The results of IACB-HCUPPIR confirmed better results in terms of minimized computation and communication overload with throughput,latency,and response time with maximized drivers’privacy preservation.Moreover,the proposed fully homomorphic algorithm(FHE)was compared against partial-homomorphic encryption(PHE)and technique without encryption and found that the proposed model has quick communication in allocating the parking slots starting with 24.3 s,whereas PHE starts allocating from 24.7 s and the technique without encryption starts at 27.4 s.Thus,we ensure the proposed model performs well in allocating parking slots with less time and high security with privacy preservation.展开更多
位置隐私和查询内容隐私是LBS兴趣点(point of interest,简称POI)查询服务中需要保护的两个重要内容,同时,在路网连续查询过程中,位置频繁变化会给LBS服务器带来巨大的查询处理负担,如何在保护用户隐私的同时,高效地获取精确查询结果,...位置隐私和查询内容隐私是LBS兴趣点(point of interest,简称POI)查询服务中需要保护的两个重要内容,同时,在路网连续查询过程中,位置频繁变化会给LBS服务器带来巨大的查询处理负担,如何在保护用户隐私的同时,高效地获取精确查询结果,是目前研究的难题.以私有信息检索中除用户自身外其他实体均不可信的思想为基本假设,基于Paillier密码系统的同态特性,提出了无需用户提供真实位置及查询内容的K近邻兴趣点查询方法,实现了对用户位置、查询内容隐私的保护及兴趣点的精确检索;同时,以路网顶点为生成元组织兴趣点分布信息,进一步解决了高强度密码方案在路网连续查询中因用户位置变化频繁导致的实用效率低的问题,减少了用户的查询次数,并能确保查询结果的准确性.最后从准确性、安全性及查询效率方面对本方法进行了分析,并通过仿真实验验证了理论分析结果的正确性.展开更多
围绕外包数据的安全性问题与用户隐私性问题,展开对加密数据库方案的研究,提出了一个面向多用户的多层嵌套数据库加密方案.该方案根据洋葱模型多层理论,采用多种不同类型的加密算法对用户的外包数据进行多层嵌套加密,实现了既保证数据...围绕外包数据的安全性问题与用户隐私性问题,展开对加密数据库方案的研究,提出了一个面向多用户的多层嵌套数据库加密方案.该方案根据洋葱模型多层理论,采用多种不同类型的加密算法对用户的外包数据进行多层嵌套加密,实现了既保证数据机密性又满足多种不同SQL查询类型的数据库加密方案.针对用户递交包含敏感信息的查询语句在一定程度上泄露用户自身的隐私这一问题,设计了基于单服务器私有信息检索(private information retrieval,PIR)技术的用户隐私保护机制,实现了用户匿名查询.安全性分析表明,该方案满足数据机密性与用户隐私性. Sysbench基准测试实验分析表明,该方案具有良好的查询处理效率、读写吞吐量以及健壮性.展开更多
文摘The paper proposes a novel hardware-based private information retrieval （HWPIR） protocol. By partially reshuffling previously accessed items in each round, instead of frequently reshuffling the whole database, the scheme makes better use of shuffled data copies and achieves the computation overhead at O（/N/K）,where N and k are the sizes of the database and secure storage respectively. For securestorage with moderate size, e.g. k = O（/N）, the overhead is 0（4/N）. The result is much better than the state-of-art schemes （as compared to e.g. O（log2N））. Without increasing response time and communication cost, the proposed protocol is truly practicable regardless of the database size. The security and preformance of the protocol is formally analyzed.
基金sponsored in part by the National Natural Science Foundation of China[Grant-Nos.61902428,6210071026,62202493].
文摘The computational complexity of privacy information retrieval protocols is often linearly related to database size.When the database size is large,the efficiency of privacy information retrieval protocols is relatively low.This paper designs an effective privacy information retrieval model based on hybrid fully homomorphic encryption.The assignment method is cleverly used to replace a large number of homomorphic encryption operations.At the same time,the multiplicative homomorphic encryption scheme is first used to deal with the large-scale serialization in the search,and then the fully homomorphic encryption scheme is used to deal with the remaining simple operations.The depth of operations supported by the fully homomorphic scheme no longer depends on the size of the database,but only needs to support the single homomorphic encryption scheme to decrypt the circuit depth.Based on this hybrid homomorphic encryption retrieval model,the efficiency of homomorphic privacy information retrieval model can be greatly improved.
文摘针对云环境图像认证过程中潜在的泄露数据所有者及用户图像特征隐私的问题,提出了一种基于属性基隐私信息检索(private information retrieval,PIR)的隐私保护云图像认证算法,借助属性基PIR完成密态环境下的隐私图像认证。一方面,云服务器存储的由数据所有者提供的图像特征被加密,防止云服务器获取数据所有者隐私信息;另一方面,用户在认证时并不需要提供明文的数据特征,并且所提供的加密属性特征也经过泛化处理,最大程度地保护用户隐私。通过性能分析,在理论上证明了所提算法具有较好的隐私保护能力和算法执行效率;通过人脸和虹膜公共数据集进行了模拟实验测试,实验结果和成因分析证明了所提算法相比同类算法更为优越。
文摘A new method to evaluate fuzzily user＇s relevance on the basis of cloud models has been proposed. All factors of personalized information retrieval system are taken into account in this method. So using this method for personalized information retrieval （PIR） system can efficiently judge multi-value relevance, such as quite relevant, comparatively relevant, commonly relevant, basically relevant and completely non-relevant, and realize a kind of transform of qualitative concepts and quantity and improve accuracy of relevance judgements in PIR system. Experimental data showed that the method is practical and valid. Evaluation results are more accurate and approach to the fact better.
基金The research was funded by the School of Information Technology and Engineering,Vellore Institute of Technology,Vellore 632014,Tamil Nadu,India.
文摘In crowded cities,searching for the availability of parking lots is a herculean task as it results in the wastage of drivers’time,increases air pollution,and traffic congestion.Smart parking systems facilitate the drivers to determine the information about the parking lot in real time and book them depending on the requirement.But the existing smart parking systems necessitate the drivers to reveal their sensitive information that includes their mobile number,personal identity,and desired destination.This disclosure of sensitive information makes the existing centralized smart parking systems more vulnerable to service providers’security breaches,single points of failure,and bottlenecks.In this paper,an Improved Asymmetric Consortium Blockchain and Homomorphically Computing Univariate Polynomial-based private information retrieval(IACB-HCUPPIR)scheme is proposed to ensure parking lots’availability with transparency security in a privacy-preserving smart parking system.In specific,an improved Asymmetric Consortium Blockchain is used for achieving secure transactions between different parties interacting in the smart parking environment.It further adopted the method of Homomorphically Computing Univariate Polynomial-based private information retrieval(HCUPPIR)scheme for preserving the location privacy of drivers.The results of IACB-HCUPPIR confirmed better results in terms of minimized computation and communication overload with throughput,latency,and response time with maximized drivers’privacy preservation.Moreover,the proposed fully homomorphic algorithm(FHE)was compared against partial-homomorphic encryption(PHE)and technique without encryption and found that the proposed model has quick communication in allocating the parking slots starting with 24.3 s,whereas PHE starts allocating from 24.7 s and the technique without encryption starts at 27.4 s.Thus,we ensure the proposed model performs well in allocating parking slots with less time and high security with privacy preservation.
文摘位置隐私和查询内容隐私是LBS兴趣点(point of interest,简称POI)查询服务中需要保护的两个重要内容,同时,在路网连续查询过程中,位置频繁变化会给LBS服务器带来巨大的查询处理负担,如何在保护用户隐私的同时,高效地获取精确查询结果,是目前研究的难题.以私有信息检索中除用户自身外其他实体均不可信的思想为基本假设,基于Paillier密码系统的同态特性,提出了无需用户提供真实位置及查询内容的K近邻兴趣点查询方法,实现了对用户位置、查询内容隐私的保护及兴趣点的精确检索;同时,以路网顶点为生成元组织兴趣点分布信息,进一步解决了高强度密码方案在路网连续查询中因用户位置变化频繁导致的实用效率低的问题,减少了用户的查询次数,并能确保查询结果的准确性.最后从准确性、安全性及查询效率方面对本方法进行了分析,并通过仿真实验验证了理论分析结果的正确性.
文摘围绕外包数据的安全性问题与用户隐私性问题,展开对加密数据库方案的研究,提出了一个面向多用户的多层嵌套数据库加密方案.该方案根据洋葱模型多层理论,采用多种不同类型的加密算法对用户的外包数据进行多层嵌套加密,实现了既保证数据机密性又满足多种不同SQL查询类型的数据库加密方案.针对用户递交包含敏感信息的查询语句在一定程度上泄露用户自身的隐私这一问题,设计了基于单服务器私有信息检索(private information retrieval,PIR)技术的用户隐私保护机制,实现了用户匿名查询.安全性分析表明,该方案满足数据机密性与用户隐私性. Sysbench基准测试实验分析表明,该方案具有良好的查询处理效率、读写吞吐量以及健壮性.
