File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-17517-6_8
- Scopus: eid_2-s2.0-78650924347
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Anonymous fuzzy identity-based encryption for similarity search
Title | Anonymous fuzzy identity-based encryption for similarity search |
---|---|
Authors | |
Keywords | anonymous fuzzy IBE inner-product encryption predicate encryption |
Issue Date | 2010 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 21st International Symposium on Algorithms and Computation (ISAAC 2010), Jeju Island, Korea, 15-17 December 2010. In Lecture Notes in Computer Science, 2010, v. 6506, pt. 1, p. 61-72 How to Cite? |
Abstract | In this paper, we consider the problem of predicate encryption and focus on the predicate for testing whether the Hamming distance between the attribute X of a data item and a target V is equal to (or less than) a threshold t where X and V are of length m. Existing solutions either do not provide attribute protection or produce a big ciphertext of size O(2 m ). For the equality version of the problem, we provide a scheme which is match-concealing (MC) secure and the sizes of the ciphertext and token are both O(m). For the inequality version of the problem, we give a practical scheme, also achieving MC security, which produces a ciphertext with size O(m tmax) if the maximum value of t, t max , is known in advance and is a constant. We also show how to update the ciphertext if the user wants to increase t max without constructing the ciphertext from scratch. © 2010 Springer-Verlag. |
Description | LNCS v. 6506 is conference proceedings of ISAAC 2010 |
Persistent Identifier | http://hdl.handle.net/10722/137646 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheung, DW | en_HK |
dc.contributor.author | Mamoulis, N | en_HK |
dc.contributor.author | Wong, WK | en_HK |
dc.contributor.author | Yiu, SM | en_HK |
dc.contributor.author | Zhang, Y | en_HK |
dc.date.accessioned | 2011-08-26T14:30:30Z | - |
dc.date.available | 2011-08-26T14:30:30Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | The 21st International Symposium on Algorithms and Computation (ISAAC 2010), Jeju Island, Korea, 15-17 December 2010. In Lecture Notes in Computer Science, 2010, v. 6506, pt. 1, p. 61-72 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/137646 | - |
dc.description | LNCS v. 6506 is conference proceedings of ISAAC 2010 | - |
dc.description.abstract | In this paper, we consider the problem of predicate encryption and focus on the predicate for testing whether the Hamming distance between the attribute X of a data item and a target V is equal to (or less than) a threshold t where X and V are of length m. Existing solutions either do not provide attribute protection or produce a big ciphertext of size O(2 m ). For the equality version of the problem, we provide a scheme which is match-concealing (MC) secure and the sizes of the ciphertext and token are both O(m). For the inequality version of the problem, we give a practical scheme, also achieving MC security, which produces a ciphertext with size O(m tmax) if the maximum value of t, t max , is known in advance and is a constant. We also show how to update the ciphertext if the user wants to increase t max without constructing the ciphertext from scratch. © 2010 Springer-Verlag. | en_HK |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science | en_HK |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | anonymous fuzzy IBE | en_HK |
dc.subject | inner-product encryption | en_HK |
dc.subject | predicate encryption | en_HK |
dc.title | Anonymous fuzzy identity-based encryption for similarity search | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0302-9743&volume=6506&issue=pt. 1&spage=61&epage=72&date=2010&atitle=Anonymous+fuzzy+identity-based+encryption+for+similarity+search | - |
dc.identifier.email | Cheung, DW:dcheung@cs.hku.hk | en_HK |
dc.identifier.email | Mamoulis, N:nikos@cs.hku.hk | en_HK |
dc.identifier.email | Yiu, SM:smyiu@cs.hku.hk | en_HK |
dc.identifier.authority | Cheung, DW=rp00101 | en_HK |
dc.identifier.authority | Mamoulis, N=rp00155 | en_HK |
dc.identifier.authority | Yiu, SM=rp00207 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-17517-6_8 | en_HK |
dc.identifier.scopus | eid_2-s2.0-78650924347 | en_HK |
dc.identifier.hkuros | 190932 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-78650924347&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 6506 LNCS | en_HK |
dc.identifier.issue | PART 1 | en_HK |
dc.identifier.spage | 61 | en_HK |
dc.identifier.epage | 72 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | The 21st International Symposium on Algorithms and Computation (ISAAC 2010), Jeju Island, Korea, 15-17 December 2010. In Lecture Notes in Computer Science, 2010, v. 6506, pt. 1, p. 61-72 | - |
dc.identifier.scopusauthorid | Cheung, DW=34567902600 | en_HK |
dc.identifier.scopusauthorid | Mamoulis, N=6701782749 | en_HK |
dc.identifier.scopusauthorid | Wong, WK=8835876000 | en_HK |
dc.identifier.scopusauthorid | Yiu, SM=7003282240 | en_HK |
dc.identifier.scopusauthorid | Zhang, Y=36681041300 | en_HK |
dc.identifier.issnl | 0302-9743 | - |