VLDB 2026 Research / reviewers in the wild / expert
Dimitar Jetchev
dblp:11/3871
· DBLP profile ↗
10ranked-venue papers
4as first author
4since 2021 · last 2024
0000-0002-1374-5138ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 9 · 4 first-author · 3 since 2021Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Revisiting Key Decomposition Techniques for FHE: Simpler, Faster and More Generic
Mariya Georgieva, Sergiu Carpov, Nicolas Gama, Sandra Guasch, Dimitar Jetchev |
ASIACRYPT (1) | 5 |
| 2023 | Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic
Mariya Georgieva, Sergiu Carpov, Kevin Deforth, Dimitar Jetchev, Abson Sae-Tang, Marius Vuille, Nicolas Gama, Jonathan Katz, Iraklis Leontiadis |
J. Cryptol. | 4 |
| 2022 | GenoPPML - a framework for genomic privacy-preserving machine learningabstractWe present a framework GenoPPML for privacy-preserving machine learning in the context of sensitive genomic data processing. The technology combines secure multiparty computation techniques based on the recently proposed Manticore framework for model training and fully homomorphic encryption based on TFHE for model inference. The framework was successfully used to solve breast cancer prediction problems on gene expression datasets coming from distinct private sources while preserving their privacy - the solution winning 1st place for both Tracks I and III of the genomic privacy competition iDASH’2020. Extensive benchmarks and comparisons to existing works are performed. Our 2-party logistic regression computation is 11× faster than the one in [1] on the same dataset and it uses only one CPU core. Sergiu Carpov, Nicolas Gama, Mariya Georgieva, Dimitar Jetchev |
CLOUD | 4 |
| 2022 | XORBoost: Tree Boosting in the Multiparty Computation SettingabstractWe present a novel protocol XORBoost for both training gradient boosted tree models and for using these models for inference in the multiparty computation (MPC) setting. Our protocol supports training for generically split datasets (vertical and horizontal splitting, or combination of those) while keeping all the information about features, thresholds, and evaluation paths private; only tree depth and the number of the binary trees are public parameters of the model. By using novel optimization techniques that reduce the number of oblivious permutation evaluations as well as sorting operations, we further speedup the algorithm. The protocol is agnostic to the underlying MPC framework or implementation. Kevin Deforth, Marc Desgroseilliers, Nicolas Gama, Mariya Georgieva, Dimitar Jetchev, Marius Vuille |
Proc. Priv. Enhancing Technol. | 5 |
| 2014 | How to Fake Auxiliary Input
Dimitar Jetchev, Krzysztof Pietrzak |
TCC | 1 |
| 2012 | Understanding Adaptivity: Random Systems Revisited
Dimitar Jetchev, Onur Özen, Martijn Stam |
ASIACRYPT | 1 |
| 2012 | Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves
Alexandre Duc, Dimitar Jetchev |
CRYPTO | 2 |
| 2012 | Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
Dimitar Jetchev, Onur Özen, Martijn Stam |
TCC | 1 |
| 2008 | Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys
Dimitar Jetchev, Ramarathnam Venkatesan |
CRYPTO | 1 |
| 2008 | Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group
Kirsten Eisenträger, Dimitar Jetchev, Kristin E. Lauter |
Pairing | 2 |