Proposes OLBSQ scheme for privacy-preserving LBS without TTP, with constant query costs, service provider learns only query size, and security reduced to complexity assumptions.
Short signatures without random oracles and the sdh assumption in bilinear groups
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Oblivious Location-Based Service Query
Proposes OLBSQ scheme for privacy-preserving LBS without TTP, with constant query costs, service provider learns only query size, and security reduced to complexity assumptions.