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

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

  • Datos identificativos

    Identificador: imarina:5869505
    Handle: http://hdl.handle.net/20.500.11797/imarina5869505
  • Autores:

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

    Autor según el artículo: Farràs O; Ribes-González J
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: Farràs Ventura, Oriol / Ribes Gonzalez, Jordi
    Palabras clave: Subset keyword search Searchable encryption Public-key encryption with keyword search Identity-based encryption Conjunctive keyword search Attacks
    Resumen: © 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.
    Áreas temáticas: 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
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    ISSN: 16155262
    Direcció de correo del autor: jordi.ribes@urv.cat oriol.farras@urv.cat
    Identificador del autor: 0000-0001-6329-7380 0000-0002-7495-5980
    Fecha de alta del registro: 2023-02-22
    Versión del articulo depositado: info:eu-repo/semantics/acceptedVersion
    Enlace a la fuente original: https://link.springer.com/article/10.1007/s10207-018-00426-7
    URL Documento de licencia: http://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: International Journal Of Information Security. 18 (5): 533-548
    Referencia de l'ítem segons les normes 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
    DOI del artículo: 10.1007/s10207-018-00426-7
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2019
    Tipo de publicación: Journal Publications
  • Palabras clave:

    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
  • Documentos:

  • Cerca a google

    Search to google scholar