loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ines Kramer ; Silvia Schmidt ; Mathias Tausig and Manuel Koschuch

Affiliation: Competence Centre for IT Security, University of Applied Sciences FH Campus Wien, Vienna and Austria

Keyword(s): Searchable Encryption, Taxonomy, Inverted Index, Forward Index, Full-domain Search.

Abstract: Searchable Encryption (SE) schemes are a promising solution to the problem of outsourcing one’s data to a cloud provider in a secure way, while still retaining the ability to search for and easily retrieve specific documents. A multitude of different schemes have been proposed and designed, yet in general they still lack usability/applicability for a specific use case or proper security analysis in order to be widely implemented and used. To address this issue we started a project to determine which SE schemes fit certain use cases - mainly focusing on usability. We examined nearly 400 papers on SE schemes from the last 13 years and extracted categorization domains for SE schemes. Furthermore we took a time-based look at these domains and tried to identify future trends in SE technologies. In this position paper we introduce our methodology and give a short overview of our current work-in-progress.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.16.47.14

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kramer, I.; Schmidt, S.; Tausig, M. and Koschuch, M. (2019). Search, Find and Resolve: Towards a Taxonomy for Searchable Encryption Schemes. In Proceedings of the 4th International Conference on Internet of Things, Big Data and Security - IoTBDS; ISBN 978-989-758-369-8; ISSN 2184-4976, SciTePress, pages 414-421. DOI: 10.5220/0007753804140421

@conference{iotbds19,
author={Ines Kramer. and Silvia Schmidt. and Mathias Tausig. and Manuel Koschuch.},
title={Search, Find and Resolve: Towards a Taxonomy for Searchable Encryption Schemes},
booktitle={Proceedings of the 4th International Conference on Internet of Things, Big Data and Security - IoTBDS},
year={2019},
pages={414-421},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007753804140421},
isbn={978-989-758-369-8},
issn={2184-4976},
}

TY - CONF

JO - Proceedings of the 4th International Conference on Internet of Things, Big Data and Security - IoTBDS
TI - Search, Find and Resolve: Towards a Taxonomy for Searchable Encryption Schemes
SN - 978-989-758-369-8
IS - 2184-4976
AU - Kramer, I.
AU - Schmidt, S.
AU - Tausig, M.
AU - Koschuch, M.
PY - 2019
SP - 414
EP - 421
DO - 10.5220/0007753804140421
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic