I
Isabelle Hang
Researcher at University of Bremen
Publications - 11
Citations - 186
Isabelle Hang is an academic researcher from University of Bremen. The author has contributed to research in topics: Encryption & On-the-fly encryption. The author has an hindex of 8, co-authored 11 publications receiving 180 citations.
Papers
More filters
Proceedings ArticleDOI
ENKI: Access Control for Encrypted Query Processing
TL;DR: ENKI is a system for securely executing queries over sensitive, access restricted data on an outsourced database that introduces an encryption based access control model and techniques for query execution over encrypted, accessrestricted data on the database with only a few cases requiring computations on the client.
Patent
Encrypted In-Memory Column-Store
Florian Kerschbaum,Martin Haerterich,Mathias Kohler,Andreas Schaad,Isabelle Hang,Axel Schroepfer,Walter Tighzert,Patrick Grofig +7 more
TL;DR: In this paper, an adjustable onion encryption procedure is proposed to identify an appropriate layer of encryption useful for processing a query on encrypted data, based on defined requirements of policy configuration, alternative resolution, and conflict resolution.
Experiences and observations on the industrial implementation of a system to search over outsourced encrypted data.
Patrick Grofig,Martin Härterich,Isabelle Hang,Florian Kerschbaum,Mathias Kohler,Andreas Schaad,Axel Schröpfer,Walter Tighzert +7 more
TL;DR: The three made observations on query execution, execution time measurements and domain-specific query analysis will lead to the conclusion that although searching over outsourced encrypted data is always a trade off between functionality, performance and security, it is realistic to assume that working solutions can be provided in the not too distant future to the market.
Patent
Average-complexity ideal-security order-preserving encryption
Florian Kerschbaum,Axel Schroepfer,Patrick Grofig,Isabelle Hang,Martin Haerterich,Mathias Kohler,Andreas Schaad,Walter Tighzert +7 more
TL;DR: Order-preserving encryption (OPE) as discussed by the authors is an encryption scheme based on the use of a binary search tree of n nodes to construct an order preserving encryption scheme having Ω(n) complexity and even O(n), in the average case.
Patent
Searchable encryption for infrequent queries in adjustable encrypted databases
Florian Kerschbaum,Martin Haerterich,Isabelle Hang,Mathias Kohler,Andreas Schaad,Axel Schroepfer,Walter Tighzert +6 more
TL;DR: In this paper, the authors present methods, systems, and computer-readable storage media for selecting columns for selecting encryption to perform an operator during execution of a database query, based on the current encryption type, the minimum encryption type and a budget associated with the column.