Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Isabelle Hang

dblp:52/9996 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 36% Authentication and access control · 36% Cryptographic primitives and cryptanalysis · 28%
Databases, data mining, and information retrieval
2 papers
Indexing and storage engines · 60% Query processing and optimization · 40%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving query processing
encrypted query processing
0.212015
ENKI: Access Control for Encrypted Query Processing · SIGMOD Conference 2015
Authentication and access control › access control › cryptographic access control
encryption-based access control
0.212015
ENKI: Access Control for Encrypted Query Processing · SIGMOD Conference 2015
Indexing and storage engines › data compression
dictionary compression
0.012013
Adjustably encrypted in-memory column-store · CCS 2013
Indexing and storage engines › column store
main-memory column store
0.012013
Adjustably encrypted in-memory column-store · CCS 2013

Methods — techniques the papers use, named apart from their topics

probabilistic encryption · 0.3order-preserving encryption · 0.3homomorphic encryption · 0.3deterministic encryption · 0.3
YearPublicationVenuePosition
2015 ENKI: Access Control for Encrypted Query Processing
abstract
A data owner outsourcing the database of a multi user application wants to prevent information leaks caused by outside attackers exploiting software vulnerabilities or by curious personnel. Query processing over encrypted data solves this problem for a single user, but provides only limited functionality in the face of access restrictions for multiple users and keys. ENKI is a system for securely executing queries over sensitive, access restricted data on an outsourced database. It introduces an encryption based access control model and techniques for query execution over encrypted, access restricted data on the database with only a few cases requiring computations on the client. A prototype of ENKI supports all queries seen in three real world use cases and executes queries from TPC-C benchmark with a modest overhead compared to the single user mode.
Isabelle Hang, Florian Kerschbaum, Ernesto Damiani
SIGMOD Conference1
2013 Adjustably encrypted in-memory column-store
abstract
Recent databases are implemented as in-memory column-stores. Adjustable encryption offers a solution to encrypted database processing in the cloud. We show that the two technologies play well together by providing an analysis and prototype results that demonstrate the impact of mechanisms at the database side (dictionaries and their compression) and cryptographic mechanisms at the adjustable encryption side (order-preserving, homomorphic, deterministic and probabilistic encryption).
Florian Kerschbaum, Patrick Grofig, Isabelle Hang, Martin Härterich, Mathias Kohler, Andreas Schaad, Axel Schröpfer, Walter Tighzert
CCS3
2012 SecureBPMN: modeling and enforcing access control requirements in business processes
abstract
Modern enterprise systems have to comply to regulations such as Basel III resulting in complex security requirements. These requirements need to be modeled at design-time and enforced at runtime. Moreover, modern enterprise systems are often business-process driven, i.e., the system behavior is described as high-level business processes that are executed by a business process execution engine.
Achim D. Brucker, Isabelle Hang, Gero Lückemeyer, Raj Ruparel
SACMAT2
2011 Short paper: a new identity-based DH key-agreement protocol for wireless sensor networks based on the Arazi-Qi scheme
abstract
Public key cryptography based on elliptic curves is a promising foundation for energy-scarving pairwise key establishment in wireless sensor networks. Focusing on the Diffie-Hellman key-agreement, identity-based schemes can be applied to provide mechanisms for authentication. The AQ-protocol presented by Arazi et al. introduces such a key establishment supporting fixed as well as ephemeral keys.
Isabelle Hang, Markus Ullmann, Christian Wieschebrink
WISEC1