File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An efficient secure channel free searchable encryption scheme with multiple keywords

TitleAn efficient secure channel free searchable encryption scheme with multiple keywords
Authors
KeywordsPubilc key encrytion
Secure channel free
Search
Multiple
Issue Date2016
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, v. 9955 LNCS, p. 251-265 How to Cite?
Abstract© Springer International Publishing AG 2016. Pubilc Key Encrytion with Keyword Search (PEKS) scheme allows users to search encrypted messages by using a particular keyword without leaking any information. Practically, users might need to relate multiple keywords to one message. To effectively encrypt multiple keywords, Baek et al. first presented a PEKS scheme with multiple keywords (MPEKS). In this paper, we come up with a new efficient secure channel free PEKS scheme with multiple keywords named SCF-MPEKS. We give formal definitions and a concrete construction of SCF-MPEKS. The proposed SCF-MPEKS scheme is secure in the presented models of indistinguishability for SCF-MPEKS. Our scheme removes the secure channel assumption between the server and the receiver, which has much better performance in terms of both computational and communication overhead than Baek et al.’s MPEKS scheme for building a secure channel is very costly.
Persistent Identifierhttp://hdl.handle.net/10722/280605
ISSN
2023 SCImago Journal Rankings: 0.606
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorWang, Tingting-
dc.contributor.authorAu, Man Ho-
dc.contributor.authorWu, Wei-
dc.date.accessioned2020-02-17T14:34:27Z-
dc.date.available2020-02-17T14:34:27Z-
dc.date.issued2016-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, v. 9955 LNCS, p. 251-265-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/280605-
dc.description.abstract© Springer International Publishing AG 2016. Pubilc Key Encrytion with Keyword Search (PEKS) scheme allows users to search encrypted messages by using a particular keyword without leaking any information. Practically, users might need to relate multiple keywords to one message. To effectively encrypt multiple keywords, Baek et al. first presented a PEKS scheme with multiple keywords (MPEKS). In this paper, we come up with a new efficient secure channel free PEKS scheme with multiple keywords named SCF-MPEKS. We give formal definitions and a concrete construction of SCF-MPEKS. The proposed SCF-MPEKS scheme is secure in the presented models of indistinguishability for SCF-MPEKS. Our scheme removes the secure channel assumption between the server and the receiver, which has much better performance in terms of both computational and communication overhead than Baek et al.’s MPEKS scheme for building a secure channel is very costly.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.subjectPubilc key encrytion-
dc.subjectSecure channel free-
dc.subjectSearch-
dc.subjectMultiple-
dc.titleAn efficient secure channel free searchable encryption scheme with multiple keywords-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-319-46298-1_17-
dc.identifier.scopuseid_2-s2.0-84989890766-
dc.identifier.volume9955 LNCS-
dc.identifier.spage251-
dc.identifier.epage265-
dc.identifier.eissn1611-3349-
dc.identifier.isiWOS:000388133600017-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats