Efficient and Privacy-Preserving Ad Conversion for V2X-Assisted Proximity Marketing

Liu, Dongxiao; Ni, Jianbing; Li, Hongwei; Lin, Xiaodong; Shen, Xuemin

doi:10.1109/mass.2018.00014

Cited by 5 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can be solved using a PSI-CA (standing for Private Set Intersection CArdinality), which cannot be directly instantiated from classical PSI. Among the cryptographic building blocks that can be combined to develop a PSI-CA protocol, we can cite for instance homomorphic encryption, as seen in works like [7,19,14], oblivious transfer [11], using generic public key techniques described in [8,29], or even commutative encryption similar to the method outlined in [20]. In this latter approach, one party, P 1 , initiates the protocol by sending its own set of items X encrypted as Enc P K1 (X) to P 2 .…”

Section: Private Set Intersectionmentioning

confidence: 99%

Probonite

Azogagh

Delfour

Gambs

et al. 2022

Proceedings of the 10th Workshop on Encrypted Computing &Amp; Applied Homomorphic Cryptography

View full text Add to dashboard Cite

Graphs are a widely used data structure for collecting and analyzing relational data. However, when the graph structure is distributed across several parties, its analysis is particularly challenging. In particular, due to the sensitivity of the data each party might want to keep their partial knowledge of the graph private, while still willing to collaborate with the other parties for tasks of mutual benefit, such as data curation or the removal of poisoned data. To address this challenge, we propose Crypto'Graph, an efficient protocol for privacy-preserving link prediction on distributed graphs. More precisely, it allows parties partially sharing a graph with distributed links to infer the likelihood of formation of new links in the future. Through the use of cryptographic primitives, Crypto'Graph is able to compute the likelihood of these new links on the joint network without revealing the structure of the private individual graph of each party, even though they know the number of nodes they have, since they share the same graph but not the same links. Crypto'Graph improves on previous works by enabling the computation of a certain number of similarity metrics without any additional cost. The use of Crypto'Graph is illustrated for defense against graph poisoning attacks, in which it is possible to identify potential adversarial links without compromising the privacy of the graphs of individual parties. The effectiveness of Crypto'Graph in mitigating graph poisoning attacks and achieving high prediction accuracy on a graph neural network node classification task is demonstrated through extensive experimentation on a real-world dataset.

show abstract

Section: Private Set Intersectionmentioning

confidence: 99%

Probonite

Azogagh

Delfour

Gambs

et al. 2022

Proceedings of the 10th Workshop on Encrypted Computing &Amp; Applied Homomorphic Cryptography

View full text Add to dashboard Cite

show abstract

“…Recent research focus on developing security models that provide data confidentiality in V2X communications. For instance, Liu et al [3] designed a privacy-preserving ad conversion protocol for V2X-assisted proximity marketing that achieves input certification and output verifiability against malicious ad networks. Also, Ulybyshev et al [4] suggested a data exchange method for V2X communication systems, which provides data confidentiality and integrity.…”

Section: Introductionmentioning

confidence: 99%

Global Roaming Trust-based Model for V2X Communications

Alnasser

Sun

2019

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

View full text Add to dashboard Cite

Smart cities need to connect physical devices as a network to improve the efficiency of city operations and services. Intelligent Transportation System (ITS) is a key component of smart cities. ITS supports the communication between vehicles to improve the driving experience and achieve active transportation. The communication is provided using Vehicleto-Everything (V2X) communication technology. Cyber-security is currently one of the main challenges facing V2X technology. A V2X communication link is vulnerable to various cyberattacks including internal and external attacks. Internal attacks cannot be detected by traditional security schemes because the compromised nodes have valid credentials. Thus, a trust model is needed to defend against them. In this paper, a global roaming trust-based security model is proposed for V2X communication. Each vehicle has a global knowledge about malicious nodes in the network. In addition, we conduct various experiments with different percentage of malicious nodes to measure the performance of the proposed model. Simulation results show that the proposed model improves False Negative Rate (FNR) by 33.5% in comparison with the existing model.

show abstract

Online Advertising with Verifiable Fairness

Huang

et al. 2019

ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Efficient and Privacy-Preserving Ad Conversion for V2X-Assisted Proximity Marketing

Cited by 5 publications

References 25 publications

Probonite

Probonite

Global Roaming Trust-based Model for V2X Communications

Online Advertising with Verifiable Fairness

Contact Info

Product

Resources

About