Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

I-Ting Lien

dblp:130/0929 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 50% Cryptographic primitives and cryptanalysis · 33% Cryptographic protocols and secure computation · 17%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.212013
A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search · IEEE Trans. Inf. Forensics Secur. 2013
Privacy and data protection
k-nearest neighbor query
0.212013
A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search · IEEE Trans. Inf. Forensics Secur. 2013
Privacy and data protection
location privacy
0.212013
A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search · IEEE Trans. Inf. Forensics Secur. 2013
Cryptographic primitives and cryptanalysis › homomorphic encryption
paillier cryptosystem
0.212013
A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search · IEEE Trans. Inf. Forensics Secur. 2013
Privacy and data protection › location privacy
privacy-preserving location-based services
0.212013
A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search · IEEE Trans. Inf. Forensics Secur. 2013
Cryptographic protocols and secure computation
private query
0.212013
A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search · IEEE Trans. Inf. Forensics Secur. 2013

Methods — techniques the papers use, named apart from their topics

space-filling curve · 0.2secret circular shift · 0.2moore curve · 0.2homomorphic encryption · 0.2
YearPublicationVenuePosition
2013 A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for k-NN Search
abstract
Location-based service (LBS) is booming up in recent years with the rapid growth of mobile devices and the emerging of cloud computing paradigm. Among the challenges to establish LBS, the user privacy issue becomes the most important concern. A successful privacy-preserving LBS must be secure and provide accurate query [e.g., -nearest neighbor (NN)] results. In this work, we propose a private circular query protocol (PCQP) to deal with the privacy and the accuracy issues of privacy-preserving LBS. The protocol consists of a space filling curve and a public-key homomorphic cryptosystem. First, we connect the points of interest (POIs) on a map to form a circular structure with the aid of a Moore curve. And then the homomorphism of Paillier cryptosystem is used to perform secret circular shifts of POI-related information (POI-info), stored on the server side. Since the POI-info after shifting and the amount of shifts are encrypted, LBS providers (e.g., servers) have no knowledge about the user's location during the query process. The protocol can resist correlation attack and support a multiuser scenario as long as the predescribed secret circular shift is performed before each query; in other words, the robustness of the proposed protocol is the same as that of a one-time pad encryption scheme. As a result, the security level of the proposed protocol is close to perfect secrecy without the aid of a trusted third party and simulation results show that the k-NN query accuracy rate of the proposed protocol is higher than 90% even when is large.
I-Ting Lien, Yu-Hsun Lin, Jyh-Ren Shieh, Ja-Ling Wu
IEEE Trans. Inf. Forensics Secur.1