Demo Data from SIGIR 2026 / reviewers in the wild / expert
Mariya Georgieva
dblp:161/6297 · also Mariya Georgieva Belorgey
· DBLP profile ↗
8ranked-venue papers
2as first author
4since 2021 · last 2024
0009-0003-6764-1136ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 7 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
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
5 papers |
Cryptographic primitives and cryptanalysis · 83% Cryptographic protocols and secure computation · 17% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
1.2 | 2 | 2024 | Revisiting Key Decomposition Techniques for FHE: Simpler, Faster and More Generic · ASIACRYPT (1) 2024 TFHE: Fast Fully Homomorphic Encryption Over the Torus · J. Cryptol. 2020 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
TFHE |
0.7 | 2 | 2020 | TFHE: Fast Fully Homomorphic Encryption Over the Torus · J. Cryptol. 2020 Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.7 | 1 | 2023 | Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic · J. Cryptol. 2023 |
Cryptographic primitives and cryptanalysis
homomorphic encryption |
0.5 | 2 | 2017 | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds · ASIACRYPT (1) 2016 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
circuit bootstrapping |
0.3 | 1 | 2017 | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption › TFHE
programmable bootstrapping |
0.3 | 1 | 2017 | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
bootstrapping |
0.2 | 1 | 2016 | Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds · ASIACRYPT (1) 2016 |
Methods — techniques the papers use, named apart from their topics
packed homomorphic operations · 0.3
| 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) | 1 |
| 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. | 1 |
| 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 | 3 |
| 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. | 4 |
| 2020 | TFHE: Fast Fully Homomorphic Encryption Over the Torus
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
J. Cryptol. | 3 |
| 2017 | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
ASIACRYPT (1) | 3 |
| 2016 | Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
ASIACRYPT (1) | 3 |
| 2016 | A Homomorphic LWE Based E-voting Scheme
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
PQCrypto | 3 |