File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Anonymous fuzzy identity-based encryption for similarity search

TitleAnonymous fuzzy identity-based encryption for similarity search
Authors
Keywordsanonymous fuzzy IBE
inner-product encryption
predicate encryption
Issue Date2010
PublisherSpringer 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?
AbstractIn 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.
DescriptionLNCS v. 6506 is conference proceedings of ISAAC 2010
Persistent Identifierhttp://hdl.handle.net/10722/137646
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorCheung, DWen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorWong, WKen_HK
dc.contributor.authorYiu, SMen_HK
dc.contributor.authorZhang, Yen_HK
dc.date.accessioned2011-08-26T14:30:30Z-
dc.date.available2011-08-26T14:30:30Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 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-72en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/137646-
dc.descriptionLNCS v. 6506 is conference proceedings of ISAAC 2010-
dc.description.abstractIn 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.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectanonymous fuzzy IBEen_HK
dc.subjectinner-product encryptionen_HK
dc.subjectpredicate encryptionen_HK
dc.titleAnonymous fuzzy identity-based encryption for similarity searchen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://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.emailCheung, DW:dcheung@cs.hku.hken_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.emailYiu, SM:smyiu@cs.hku.hken_HK
dc.identifier.authorityCheung, DW=rp00101en_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.identifier.authorityYiu, SM=rp00207en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-17517-6_8en_HK
dc.identifier.scopuseid_2-s2.0-78650924347en_HK
dc.identifier.hkuros190932en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78650924347&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6506 LNCSen_HK
dc.identifier.issuePART 1en_HK
dc.identifier.spage61en_HK
dc.identifier.epage72en_HK
dc.publisher.placeGermanyen_HK
dc.description.otherThe 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.scopusauthoridCheung, DW=34567902600en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridWong, WK=8835876000en_HK
dc.identifier.scopusauthoridYiu, SM=7003282240en_HK
dc.identifier.scopusauthoridZhang, Y=36681041300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats