Zur Kurzanzeige

dc.contributor.authorWaage, Tim
dc.contributor.editorMeier, Michael
dc.contributor.editorReinhardt, Delphine
dc.contributor.editorWendzel, Steffen
dc.date.accessioned2017-06-21T07:43:29Z
dc.date.available2017-06-21T07:43:29Z
dc.date.issued2016
dc.identifier.isbn978-3-88579-650-3
dc.identifier.issn1617-5468
dc.description.abstractOrder-preserving encryption (OPE) allows encrypting without losing information about the order relation between the encrypted data items. Thus, the execution of compare, order and grouping operations can be done like on plaintext data. In particular it allows databases to do range queries over encrypted data, which is a useful feature especially for cloud databases that usually run in untrusted environments. Several OPE schemes have been proposed in the last years, but almost none of them are used in real world scenarios. While OPE was at least implemented for some SQL- based prototype systems before (e.g. [Po11, Tu13], our work identifies the practical requirements for utilizing OPE in existing NoSQL cloud database technologies. It also provides runtime analyses of two popular OPE schemes combined with two popular NoSQL wide column store databases.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSicherheit 2016 - Sicherheit, Schutz und Zuverlässigkeit
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-256
dc.titleOrder preserving encryption for wide column storesen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages209-214
mci.conference.locationBonn
mci.conference.date5.-7. April 2016


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige