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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Patrick Grofig

dblp:132/1972 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Security and privacy · 2

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
1 paper
Cryptographic primitives and cryptanalysis · 100%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
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
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
 CCS2
2013 Optimal Re-encryption Strategy for Joins in Encrypted Databases
Florian Kerschbaum, Martin Härterich, Patrick Grofig, Mathias Kohler, Andreas Schaad, Axel Schröpfer, Walter Tighzert
 DBSec3