In modern society,it is necessary to perform some secure computations for private sets between different entities.For instance,two merchants desire to calculate the number of common customers and the total number of u...In modern society,it is necessary to perform some secure computations for private sets between different entities.For instance,two merchants desire to calculate the number of common customers and the total number of users without disclosing their own privacy.In order to solve the referred problem,a semi-quantum protocol for private computation of cardinalities of set based on Greenberger-Horne-Zeilinger(GHZ)states is proposed for the first time in this paper,where all the parties just perform single-particle measurement if necessary.With the assistance of semi-honest third party(TP),two semi-quantum participants can simultaneously obtain intersection cardinality and union cardinality.Furthermore,security analysis shows that the presented protocol can stand against some well-known quantum attacks,such as intercept measure resend attack,entangle measure attack.Compared with the existing quantum protocols of Private Set Intersection Cardinality(PSI-CA)and Private Set Union Cardinality(PSU-CA),the complicated oracle operations and powerful quantum capacities are not required in the proposed protocol.Therefore,it seems more appropriate to implement this protocol with current technology.展开更多
In this paper,we propose a novel fuzzy matching data sharing scheme named FADS for cloudedge communications.FADS allows users to specify their access policies,and enables receivers to obtain the data transmitted by th...In this paper,we propose a novel fuzzy matching data sharing scheme named FADS for cloudedge communications.FADS allows users to specify their access policies,and enables receivers to obtain the data transmitted by the senders if and only if the two sides meet their defined certain policies simultaneously.Specifically,we first formalize the definition and security models of fuzzy matching data sharing in cloud-edge environments.Then,we construct a concrete instantiation by pairing-based cryptosystem and the privacy-preserving set intersection on attribute sets from both sides to construct a concurrent matching over the policies.If the matching succeeds,the data can be decrypted.Otherwise,nothing will be revealed.In addition,FADS allows users to dynamically specify the policy for each time,which is an urgent demand in practice.A thorough security analysis demonstrates that FADS is of provable security under indistinguishable chosen ciphertext attack(IND-CCA)in random oracle model against probabilistic polynomial-time(PPT)adversary,and the desirable security properties of privacy and authenticity are achieved.Extensive experiments provide evidence that FADS is with acceptable efficiency.展开更多
With the rapid development of intelligent transportation, carpooling with the help of Vehicular Networks plays an important role in improving transportati<span>on efficiency and solving environmental problems. H...With the rapid development of intelligent transportation, carpooling with the help of Vehicular Networks plays an important role in improving transportati<span>on efficiency and solving environmental problems. However, attackers us</span>ually launch attacks and cause privacy leakage of carpooling users. In addition, the trust issue between unfamiliar vehicles and passengers reduces the efficiency of carpooling. To address these issues, this paper introduced a trusted and pr<span>ivacy-preserving carpooling matching scheme in Vehicular Networks (T</span>PCM). TPC<span>M scheme introduced travel preferences during carpooling matching, according to the passengers’ individual travel preferences needs, which adopt</span>ed th<span>e privacy set intersection technology based on the Bloom filter to match t</span>he passengers with the vehicles to achieve the purpose of protecting privacy an<span>d meeting the individual needs of passengers simultaneously. TPCM sch</span>eme adopted a multi-faceted trust management model, which calculated the trust val<span>ue of different travel preferences of vehicle based on passengers’ carp</span>ooling feedback to evaluate the vehicle’s trustworthiness from multi-faceted when carpooling matching. Moreover, a series of experiments were conducted to verify the effectiveness and robustness of the proposed scheme. The results show that the proposed scheme has high accuracy, lower computational and communication costs when compared with the existing carpooling schemes.展开更多
Searchable encryption(SE)enables data users to securely search encrypted data stored in untrusted cloud servers.However,most SE schemes allow for leakages of access and search patterns to maximize efficiency and funct...Searchable encryption(SE)enables data users to securely search encrypted data stored in untrusted cloud servers.However,most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality.Recent attacks have shown that adversaries can recover query keywords with prior knowledge of the database by exploiting these leakages.Unfortunately,the existing schemes that protect access and search patterns result in frequent communications and high computational costs.Furthermore,complex calculation processes also raise challenges for verifying search results.To address these concerns,we first design an efficient conjunctive SE scheme with search and access pattern privacy using private set intersection.In the proposed scheme,we utilize random numbers to obfuscate the values of polynomials and randomly divide the results into two parts,which simplifies the search process,improves search efficiency,and eliminates the need for time-consuming ciphertext multiplication operations.We also extend this scheme to support search result verifiability.Specifically,by embedding a random number as the root of the return polynomial,we achieve verifiability of search results.Furthermore,we prove the security of both schemes employing the simulation-based method.Finally,we implement the schemes in a real database and thorough performance analyses demonstrate their efficiency.展开更多
Oblivious Cross-Tags(OXT)[1]is the first efficient searchable encryption(SE)protocol for conjunctive queries in a single-writer single-reader framework.However,it also has a trade-off between security and efficiency b...Oblivious Cross-Tags(OXT)[1]is the first efficient searchable encryption(SE)protocol for conjunctive queries in a single-writer single-reader framework.However,it also has a trade-off between security and efficiency by leaking partial database information to the server.Recent attacks on these SE schemes show that the leakages from these SE schemes can be used to recover the content of queried keywords.To solve this problem,Lai et al.[2]propose Hidden Cross-Tags(HXT),which reduces the access pattern leakage from Keyword Pair Result Pattern(KPRP)to Whole Result Pattern(WRP).However,the WRP leakage can also be used to recover some additional contents of queried keywords.This paper proposes Improved Cross-Tags(IXT),an efficient searchable encryption protocol that achieves access and searches pattern hiding based on the labeled private set intersection.We also prove the proposed labeled private set intersection(PSI)protocol is secure against semi-honest adversaries,and IXT is-semi-honest secure(is leakage function).Finally,we do experiments to compare IXT with HXT.The experimental results show that the storage overhead and computation overhead of the search phase at the client-side in IXT is much lower than those in HXT.Meanwhile,the experimental results also show that IXT is scalable and can be applied to various sizes of datasets.展开更多
基金supported by the National Natural Science Foundation of China(61802118)Natural Science Foundation of Heilongjiang Province(YQ2020F013)supported by the Advanced Programs of Heilongjiang Province for the Overseas Scholars and the Outstanding Youth Fund of Heilongjiang University and the Heilongjiang University Innovation Fund(YJSCX2022-247HLJU)
文摘In modern society,it is necessary to perform some secure computations for private sets between different entities.For instance,two merchants desire to calculate the number of common customers and the total number of users without disclosing their own privacy.In order to solve the referred problem,a semi-quantum protocol for private computation of cardinalities of set based on Greenberger-Horne-Zeilinger(GHZ)states is proposed for the first time in this paper,where all the parties just perform single-particle measurement if necessary.With the assistance of semi-honest third party(TP),two semi-quantum participants can simultaneously obtain intersection cardinality and union cardinality.Furthermore,security analysis shows that the presented protocol can stand against some well-known quantum attacks,such as intercept measure resend attack,entangle measure attack.Compared with the existing quantum protocols of Private Set Intersection Cardinality(PSI-CA)and Private Set Union Cardinality(PSU-CA),the complicated oracle operations and powerful quantum capacities are not required in the proposed protocol.Therefore,it seems more appropriate to implement this protocol with current technology.
基金supported by the China Postdoctoral Science Foundation (Grant Nos. 2021TQ0042, 2021M700435, 2021TQ0041)the National Natural Science Foundation of China (Grant No. 62102027)the Shandong Provincial Key Research and Development Program (2021CXGC010106)
文摘In this paper,we propose a novel fuzzy matching data sharing scheme named FADS for cloudedge communications.FADS allows users to specify their access policies,and enables receivers to obtain the data transmitted by the senders if and only if the two sides meet their defined certain policies simultaneously.Specifically,we first formalize the definition and security models of fuzzy matching data sharing in cloud-edge environments.Then,we construct a concrete instantiation by pairing-based cryptosystem and the privacy-preserving set intersection on attribute sets from both sides to construct a concurrent matching over the policies.If the matching succeeds,the data can be decrypted.Otherwise,nothing will be revealed.In addition,FADS allows users to dynamically specify the policy for each time,which is an urgent demand in practice.A thorough security analysis demonstrates that FADS is of provable security under indistinguishable chosen ciphertext attack(IND-CCA)in random oracle model against probabilistic polynomial-time(PPT)adversary,and the desirable security properties of privacy and authenticity are achieved.Extensive experiments provide evidence that FADS is with acceptable efficiency.
文摘With the rapid development of intelligent transportation, carpooling with the help of Vehicular Networks plays an important role in improving transportati<span>on efficiency and solving environmental problems. However, attackers us</span>ually launch attacks and cause privacy leakage of carpooling users. In addition, the trust issue between unfamiliar vehicles and passengers reduces the efficiency of carpooling. To address these issues, this paper introduced a trusted and pr<span>ivacy-preserving carpooling matching scheme in Vehicular Networks (T</span>PCM). TPC<span>M scheme introduced travel preferences during carpooling matching, according to the passengers’ individual travel preferences needs, which adopt</span>ed th<span>e privacy set intersection technology based on the Bloom filter to match t</span>he passengers with the vehicles to achieve the purpose of protecting privacy an<span>d meeting the individual needs of passengers simultaneously. TPCM sch</span>eme adopted a multi-faceted trust management model, which calculated the trust val<span>ue of different travel preferences of vehicle based on passengers’ carp</span>ooling feedback to evaluate the vehicle’s trustworthiness from multi-faceted when carpooling matching. Moreover, a series of experiments were conducted to verify the effectiveness and robustness of the proposed scheme. The results show that the proposed scheme has high accuracy, lower computational and communication costs when compared with the existing carpooling schemes.
基金supported by the National Key Research and Development Program of China under Grant No.2022YFB4501500 and No.2022YFB4501503the National Natural Science Foundation of China(62072369)+3 种基金The Youth Innovation Team of Shaanxi Universities(23JP160)the Shaanxi Special Support Program Youth Top-notch Talent Programthe Technology Innovation Leading Program of Shaanxi(2023-YD-CGZH-31)the China Postdoctoral Science Foundation under Grant Number 2024T170080
文摘Searchable encryption(SE)enables data users to securely search encrypted data stored in untrusted cloud servers.However,most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality.Recent attacks have shown that adversaries can recover query keywords with prior knowledge of the database by exploiting these leakages.Unfortunately,the existing schemes that protect access and search patterns result in frequent communications and high computational costs.Furthermore,complex calculation processes also raise challenges for verifying search results.To address these concerns,we first design an efficient conjunctive SE scheme with search and access pattern privacy using private set intersection.In the proposed scheme,we utilize random numbers to obfuscate the values of polynomials and randomly divide the results into two parts,which simplifies the search process,improves search efficiency,and eliminates the need for time-consuming ciphertext multiplication operations.We also extend this scheme to support search result verifiability.Specifically,by embedding a random number as the root of the return polynomial,we achieve verifiability of search results.Furthermore,we prove the security of both schemes employing the simulation-based method.Finally,we implement the schemes in a real database and thorough performance analyses demonstrate their efficiency.
基金supported in part by the National Key Research and Development Program of China(2020YFA0712300)in part by the National Natural Science Foundation of China(Grant Nos.62172162,62132005)in part by the Shanghai Trusted Industry Internet Software Collaborative Innovation Center.
文摘Oblivious Cross-Tags(OXT)[1]is the first efficient searchable encryption(SE)protocol for conjunctive queries in a single-writer single-reader framework.However,it also has a trade-off between security and efficiency by leaking partial database information to the server.Recent attacks on these SE schemes show that the leakages from these SE schemes can be used to recover the content of queried keywords.To solve this problem,Lai et al.[2]propose Hidden Cross-Tags(HXT),which reduces the access pattern leakage from Keyword Pair Result Pattern(KPRP)to Whole Result Pattern(WRP).However,the WRP leakage can also be used to recover some additional contents of queried keywords.This paper proposes Improved Cross-Tags(IXT),an efficient searchable encryption protocol that achieves access and searches pattern hiding based on the labeled private set intersection.We also prove the proposed labeled private set intersection(PSI)protocol is secure against semi-honest adversaries,and IXT is-semi-honest secure(is leakage function).Finally,we do experiments to compare IXT with HXT.The experimental results show that the storage overhead and computation overhead of the search phase at the client-side in IXT is much lower than those in HXT.Meanwhile,the experimental results also show that IXT is scalable and can be applied to various sizes of datasets.
