2015 IEEE Global Communications Conference (GLOBECOM) 2014
DOI: 10.1109/glocom.2014.7417743
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient, Privacy-Preserving, and Verifiable Online Auction Mechanism for Ad Exchanges

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…In the privacy preserving integer comparison protocol, there are two major entities: a prover P and a verifier V. The prover P knows two non-negative integers x 1 and x 2 as well as their comparison relation, e.g., x 1 ≥ x 2 . The main goal of the prover P is to convince the verifier V that the declared comparison relation is true without disclosing x 1 and x 2 2 . Here, we note that if x 1 < x 2 holds in fact, it is computationally infeasible for the prover P to generate a witness to x 1 ≥ x 2 .…”
Section: Privacy Preserving Integer Comparisonmentioning
confidence: 99%
“…In the privacy preserving integer comparison protocol, there are two major entities: a prover P and a verifier V. The prover P knows two non-negative integers x 1 and x 2 as well as their comparison relation, e.g., x 1 ≥ x 2 . The main goal of the prover P is to convince the verifier V that the declared comparison relation is true without disclosing x 1 and x 2 2 . Here, we note that if x 1 < x 2 holds in fact, it is computationally infeasible for the prover P to generate a witness to x 1 ≥ x 2 .…”
Section: Privacy Preserving Integer Comparisonmentioning
confidence: 99%