Demo Data from EDBT 2026 / reviewers in the wild / expert
Caleb Horst
dblp:184/2507
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 1Security and privacy · 1Human-computer interaction and ubiquitous computing · 1
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 · 46% Cryptographic primitives and cryptanalysis · 31% Cryptographic protocols and secure computation · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy-preserving machine learning
privacy-preserving classification |
0.4 | 1 | 2019 | Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation · IEEE Trans. Dependable Secur. Comput. 2019 |
Privacy and data protection
privacy-preserving computation |
0.4 | 1 | 2019 | Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation · IEEE Trans. Dependable Secur. Comput. 2019 |
Cryptographic protocols and secure computation
secure computation protocols |
0.4 | 1 | 2019 | Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation · IEEE Trans. Dependable Secur. Comput. 2019 |
Cryptographic primitives and cryptanalysis › encryption › property-preserving encryption
order-preserving encryption |
0.3 | 1 | 2017 | Cryptanalysis of Comparable Encryption in SIGMOD'16 · SIGMOD Conference 2017 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
additive homomorphic encryption |
0.1 | 1 | 2019 | Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation · IEEE Trans. Dependable Secur. Comput. 2019 |
Cryptographic primitives and cryptanalysis
homomorphic encryption |
0.1 | 1 | 2019 | Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation · IEEE Trans. Dependable Secur. Comput. 2019 |
Query processing and optimization
range query |
0.1 | 1 | 2017 | Cryptanalysis of Comparable Encryption in SIGMOD'16 · SIGMOD Conference 2017 |
Methods — techniques the papers use, named apart from their topics
cryptanalysis · 0.6secure multiplication · 0.4secure comparison protocol · 0.4oblivious input selection · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-ComputationabstractMany data-driven personalized services require that private data of users is scored against a trained machine learning model. In this paper we propose a novel protocol for privacy-preserving classification of decision trees, a popular machine learning model in these scenarios. Our solutions is composed out of building blocks, namely a secure comparison protocol, a protocol for obliviously selecting inputs, and a protocol for multiplication. By combining some of the building blocks for our decision tree classification protocol, we also improve previously proposed solutions for classification of support vector machines and logistic regression models. Our protocols are information theoretically secure and, unlike previously proposed solutions, do not require modular exponentiations. We show that our protocols for privacy-preserving classification lead to more efficient results from the point of view of computational and communication complexities. We present accuracy and runtime results for seven classification benchmark datasets from the UCI repository. Martine De Cock, Rafael Dowsley, Caleb Horst, Rajendra S. Katti, Anderson C. A. Nascimento, Wing-Sea Poon, Stacey Truex |
IEEE Trans. Dependable Secur. Comput. | 3 |
| 2017 | Cryptanalysis of Comparable Encryption in SIGMOD'16abstractComparable Encryption proposed by Furukawa (ESORICS 2013, CANS 2014) is a variant of order-preserving encryption (OPE) and order-revealing encryption (ORE); we cannot compare a ciphertext of v and another ciphertext of v', but we can compare a ciphertext of v and a token of b and compare a token of $b$ and another token of b'. Comparable encryption allows us to implement range and point queries while keeping the order of v's as secret as possible. Caleb Horst, Ryo Kikuchi, Keita Xagawa |
SIGMOD Conference | 1 |
| 2016 | VirtualIdentity: Privacy preserving user profilingabstractUser profiling from user generated content (UGC) is a common practice that supports the business models of many social media companies. Existing systems require that the UGC is fully exposed to the module that constructs the user profiles. In this paper we show that it is possible to build user profiles without ever accessing the user's original data, and without exposing the trained machine learning models for user profiling - which are the intellectual property of the company - to the users of the social media site. We present VirtualIdentity, an application that uses secure multi-party cryptographic protocols to detect the age, gender and personality traits of users by classifying their user-generated text and personal pictures with trained support vector machine models in a privacy preserving manner. Wing-Sea Poon, Golnoosh Farnadi, Caleb Horst, Kebra Thompson, Michael Nickels, Anderson C. A. Nascimento, Martine De Cock |
ASONAM | 4 |