Order preserving encryption for wide column stores
| dc.contributor.author | Waage, Tim | |
| dc.contributor.editor | Meier, Michael | |
| dc.contributor.editor | Reinhardt, Delphine | |
| dc.contributor.editor | Wendzel, Steffen | |
| dc.date.accessioned | 2017-06-21T07:43:29Z | |
| dc.date.available | 2017-06-21T07:43:29Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | Order-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.identifier.isbn | 978-3-88579-650-3 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Sicherheit 2016 - Sicherheit, Schutz und Zuverlässigkeit | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-256 | |
| dc.title | Order preserving encryption for wide column stores | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 214 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 209 | |
| gi.conference.date | 5.-7. April 2016 | |
| gi.conference.location | Bonn |
Dateien
Originalbündel
1 - 1 von 1