東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Security and Privacy in Search Services.

Wang, Peng.

FindBook

Google Book

Amazon

博客來

Security and Privacy in Search Services.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Security and Privacy in Search Services./
作者:	Wang, Peng.
面頁冊數:	106 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.
Contained By:	Dissertation Abstracts International75-11B(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3630765
ISBN:	9781321088700

Security and Privacy in Search Services.
Wang, Peng.

Security and Privacy in Search Services. - 106 p.

Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.

Thesis (Ph.D.)--University of California, Riverside, 2014.

This item must not be sold to any third party vendors.

In the first part of this dissertation, we show how to execute range queries securely and efficiently on encrypted databases in the cloud. Current methods provide either security or efficiency, but not both. Many schemes even reveal the ordering of encrypted tuples, which, as we show, allows adversaries to estimate plaintext values accurately. We present the R&circ;-tree, a hierarchical encrypted index that may be securely placed in the cloud, and searched efficiently. It is based on a mechanism we design for encrypted halfspace range queries in Rd, using Asymmetric Scalar-product Preserving Encryption. Data owners can tune the R&circ;-tree parameters to achieve desired security-efficiency tradeoffs. We also present extensive experiments to evaluate R&circ;-tree performance. Our results show that R&circ;-tree queries are efficient on encrypted databases, and reveal far less information than competing methods. In the second part, we propose a new query obfuscation scheme to protect user privacy in key word search. Text-based search queries reveal user intent to the search engine, compromising privacy. Topical Intent Obfuscation (TIO) is a promising new approach to preserving user privacy. TIO masks topical intent by mixing real user queries with dummy queries matching various different topics. Dummy queries are generated using a Dummy Query Generation Algorithm (DGA). We demonstrate various shortcomings in current TIO schemes, and show how to correct them. Current schemes assume that DGA details are unknown to the adversary. We argue that this is a flawed assumption, and show how DGA details can be used to construct efficient attacks on TIO schemes, using an iterative DGA as an example. Our extensive experiments on real data sets show that our attacks can flag up to 80% of dummy queries. We also propose HDGA, a new DGA that we prove to be immune to the attacks based on DGA semantics that we describe.

ISBN: 9781321088700Subjects--Topical Terms:

626642
Computer Science.

Security and Privacy in Search Services.
LDR:02903nmm a2200301 4500 001 2057745
005 20150619125627.5
008 170521s2014 ||||||||||||||||| ||eng d
020 $a 9781321088700
035 $a (MiAaPQ)AAI3630765
035 $a AAI3630765
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wang, Peng. $3 1271684
245 1 0 $a Security and Privacy in Search Services.
300 $a 106 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.
500 $a Adviser: Chinya Ravishankar.
502 $a Thesis (Ph.D.)--University of California, Riverside, 2014.
506 $a This item must not be sold to any third party vendors.
520 $a In the first part of this dissertation, we show how to execute range queries securely and efficiently on encrypted databases in the cloud. Current methods provide either security or efficiency, but not both. Many schemes even reveal the ordering of encrypted tuples, which, as we show, allows adversaries to estimate plaintext values accurately. We present the R&circ;-tree, a hierarchical encrypted index that may be securely placed in the cloud, and searched efficiently. It is based on a mechanism we design for encrypted halfspace range queries in Rd, using Asymmetric Scalar-product Preserving Encryption. Data owners can tune the R&circ;-tree parameters to achieve desired security-efficiency tradeoffs. We also present extensive experiments to evaluate R&circ;-tree performance. Our results show that R&circ;-tree queries are efficient on encrypted databases, and reveal far less information than competing methods. In the second part, we propose a new query obfuscation scheme to protect user privacy in key word search. Text-based search queries reveal user intent to the search engine, compromising privacy. Topical Intent Obfuscation (TIO) is a promising new approach to preserving user privacy. TIO masks topical intent by mixing real user queries with dummy queries matching various different topics. Dummy queries are generated using a Dummy Query Generation Algorithm (DGA). We demonstrate various shortcomings in current TIO schemes, and show how to correct them. Current schemes assume that DGA details are unknown to the adversary. We argue that this is a flawed assumption, and show how DGA details can be used to construct efficient attacks on TIO schemes, using an iterative DGA as an example. Our extensive experiments on real data sets show that our attacks can flag up to 80% of dummy queries. We also propose HDGA, a new DGA that we prove to be immune to the attacks based on DGA semantics that we describe.
590 $a School code: 0032.
650 4 $a Computer Science. $3 626642
650 4 $a Information Science. $3 1017528
650 4 $a Engineering, General. $3 1020744
690 $a 0984
690 $a 0723
690 $a 0537
710 2 $a University of California, Riverside. $b Computer Science. $3 1680199
773 0 $t Dissertation Abstracts International $g 75-11B(E).
790 $a 0032
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3630765