2012
DOI: 10.1109/msp.2011.155
|View full text |Cite
|
Sign up to set email alerts
|

Usable, Secure, Private Search

Abstract: It is a common requirement in real world applications for untrusting parties to be able to share sensitive information securely. We describe a secure anonymous database search scheme (SADS) that provides exact keyword match capability. Using a new primitive,re-routable encryption, and the ideas of Bloom filters [1] and deterministic encryption [7], SADS allows multiple parties to efficiently execute exact match queries over distributed encrypted database in a controlled manner. We further consider a more gener… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(12 citation statements)
references
References 11 publications
0
11
0
Order By: Relevance
“…(4) The time complexity of trapdoor generation in PECDK-1 is independent with , while that in PECDK-2 is linear with ( ). The trapdoor generation algorithm in PECDK-1 still needs much less time cost than that in PECDK-2 with the same reason described in (2). (1) The time costs of trapdoor generation in PECDK-1 and PECDK-2 are both linear with ( ), which is shown in Figure 3(a).…”
Section: Time Overheadmentioning
confidence: 94%
See 1 more Smart Citation
“…(4) The time complexity of trapdoor generation in PECDK-1 is independent with , while that in PECDK-2 is linear with ( ). The trapdoor generation algorithm in PECDK-1 still needs much less time cost than that in PECDK-2 with the same reason described in (2). (1) The time costs of trapdoor generation in PECDK-1 and PECDK-2 are both linear with ( ), which is shown in Figure 3(a).…”
Section: Time Overheadmentioning
confidence: 94%
“…Based on many researchers' work these years, SSE can support advanced query conditions like Boolean keywords search, multikeywords rank search, and top-similarity keywords search. Works [1][2][3] dealt with multikeywords search, where the query condition contains more than one keyword. Considering the fact that it is not practical to return all the search results, more recent works like [4][5][6] focused on the multikeywords rank search.…”
Section: Introductionmentioning
confidence: 99%
“…To resolve the searchable problem of encrypted files in a cloud storage server, we can use the searchable encryption technology in the literature [2,3,4,5,6,7,8,9]. A user can store its files in encrypted form at an untrusted cloud server by using these searchable encryption schemes, and delegate the cloud server to search over its files by issuing a trapdoor (i.e.…”
Section: Motivationmentioning
confidence: 99%
“…In order to meet these objectives, TA1 performers used novel cryptographic techniques that enabled queries to be executed directly on an encrypted copy of the database held by a third party [2,9]. A variety of query types were supported, including equality, range, keyword, stem, string wildcards and substrings, ranking, and XML queries, as well as boolean combinations of the above types (and, or, and threshold).…”
Section: Spar Program Overviewmentioning
confidence: 99%