Articles producció científica> Enginyeria Informàtica i Matemàtiques

Provably secure public-key encryption with conjunctive and subset keyword search

  • Identification data

    Identifier: imarina:5869505
    Handle: http://hdl.handle.net/20.500.11797/imarina5869505
  • Authors:

    Farràs O
    Ribes-González J
  • Others:

    Author, as appears in the article.: Farràs O; Ribes-González J
    Department: Enginyeria Informàtica i Matemàtiques
    URV's Author/s: Farràs Ventura, Oriol / Ribes Gonzalez, Jordi
    Keywords: Subset keyword search Searchable encryption Public-key encryption with keyword search Identity-based encryption Conjunctive keyword search Attacks
    Abstract: © 2019, Springer-Verlag GmbH Germany, part of Springer Nature. Public-key encryption with keyword search (PEKS) schemes enable public key holders to encrypt documents, while the secret key holder is able to generate queries for the encrypted data. In this paper, we present two PEKS schemes with extended functionalities. The first proposed scheme supports conjunctive queries. That is, it enables searching for encrypted documents containing a chosen list of keywords. We prove the computational consistency of our scheme, and we prove security under the asymmetric DBDH assumption. We show that it improves previous related schemes in terms of efficiency and in terms of index and trapdoor size. The second proposed scheme supports subset queries and some more general predicates. We prove the computational consistency of our scheme, and we prove our scheme secure under the p-BDHI assumption. We show that it improves previous related schemes in terms of efficiency and expressiveness. Moreover, unlike previous related schemes, it admits an arbitrary keyword space.
    Thematic Areas: Software Safety, risk, reliability and quality Matemática / probabilidade e estatística Information systems Engenharias iv Computer science, theory & methods Computer science, software engineering Computer science, information systems Computer networks and communications Ciência da computação
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    ISSN: 16155262
    Author's mail: jordi.ribes@urv.cat oriol.farras@urv.cat
    Author identifier: 0000-0001-6329-7380 0000-0002-7495-5980
    Record's date: 2023-02-22
    Papper version: info:eu-repo/semantics/acceptedVersion
    Link to the original source: https://link.springer.com/article/10.1007/s10207-018-00426-7
    Licence document URL: http://repositori.urv.cat/ca/proteccio-de-dades/
    Papper original source: International Journal Of Information Security. 18 (5): 533-548
    APA: Farràs O; Ribes-González J (2019). Provably secure public-key encryption with conjunctive and subset keyword search. International Journal Of Information Security, 18(5), 533-548. DOI: 10.1007/s10207-018-00426-7
    Article's DOI: 10.1007/s10207-018-00426-7
    Entity: Universitat Rovira i Virgili
    Journal publication year: 2019
    Publication Type: Journal Publications
  • Keywords:

    Computer Networks and Communications,Computer Science, Information Systems,Computer Science, Software Engineering,Computer Science, Theory & Methods,Information Systems,Safety, Risk, Reliability and Quality,Software
    Subset keyword search
    Searchable encryption
    Public-key encryption with keyword search
    Identity-based encryption
    Conjunctive keyword search
    Attacks
    Software
    Safety, risk, reliability and quality
    Matemática / probabilidade e estatística
    Information systems
    Engenharias iv
    Computer science, theory & methods
    Computer science, software engineering
    Computer science, information systems
    Computer networks and communications
    Ciência da computação
  • Documents:

  • Cerca a google

    Search to google scholar