Demo Data from SIGIR 2026 / reviewers in the wild / expert
Dilara Toprakhisar
dblp:322/3458
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0003-4551-6775ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 2 first-author · 4 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
2 papers |
Cryptographic primitives and cryptanalysis · 72% Hardware security and side channels · 28% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware reliability and fault tolerance · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
block cipher |
0.6 | 1 | 2022 | Chaghri - A FHE-friendly Block Cipher · CCS 2022 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
FHE-friendly ciphers |
0.6 | 1 | 2022 | Chaghri - A FHE-friendly Block Cipher · CCS 2022 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
0.6 | 1 | 2022 | Chaghri - A FHE-friendly Block Cipher · CCS 2022 |
Cryptographic primitives and cryptanalysis
symmetric cryptography |
0.6 | 1 | 2022 | Chaghri - A FHE-friendly Block Cipher · CCS 2022 |
Methods — techniques the papers use, named apart from their topics
stable-MAC · 1.7arithmetic complexity optimization · 0.6algebraic cipher design · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | StaMAC: Fault Protection via Stable-MAC Tags
Siemen Dhooghe, Artemii Ovchinnikov, Dilara Toprakhisar |
ASIACRYPT (2) | 3 |
| 2025 | Picking up the Fallen Mask: Breaking and Fixing the RS-Mask Countermeasure
Dilara Toprakhisar, Svetla Nikova, Ventzislav Nikov |
SAC | 1 |
| 2024 | SoK: Parameterization of Fault Adversary Models Connecting Theory and Practice
Dilara Toprakhisar, Svetla Nikova, Ventzislav Nikov |
CT-RSA | 1 |
| 2023 | How Not To Design An Efficient FHE-Friendly Block Cipher: SeljukabstractAbstract With the rapid increase in the practical applications of secure computation protocols, increasingly more research is focused on the efficiency of the symmetric-key primitives underlying them. Whereas traditional block ciphers have evolved to be efficient with respect to certain performance metrics, secure computation protocols call for a different efficiency metric: arithmetic complexity. Arithmetic complexity is viewed through the number and layout of nonlinear operations in the circuit implemented by the protocol. Symmetric-key algorithms that are optimized for this metric are said to be algebraic ciphers. It has been shown that recently proposed algebraic ciphers are greatly efficient in ZK and MPC protocols. However, there has not been many algebraic ciphers proposed targeting Fully Homomorphic Encryption (FHE). In this paper, we evaluate the behavior of Vision when implemented as a circuit in an FHE protocol. To this end, we present a state-of-the-art comparison of AES and Vision implemented using HElib. Counterintuitively, Vision does not deliver a better performance than AES in this setting. Then, by attempting to improve a bottleneck of the FHE implementation evaluating Vision we present a new cipher: Seljuk. Despite the improvement with respect to Vision, Seljuk does not deliver the expected performance. Tomer Ashur, Mohammad Mahzoun, Dilara Toprakhisar |
Comput. J. | 3 |
| 2022 | Chaghri - A FHE-friendly Block CipherabstractThe Recent progress in practical applications of secure computation protocols has also attracted attention to the symmetric-key primitives underlying them. Whereas traditional ciphers have evolved to be efficient with respect to certain performance metrics, advanced cryptographic protocols call for a different focus. The so called arithmetic complexity is viewed through the number and layout of non-linear operations in the circuit implemented by the protocol. Symmetric-key algorithms that are optimized with respect to this metric are said to be algebraic ciphers. Previous work targeting ZK and MPC protocols delivered great improvement in the performance of these applications both in lab and in practical use. Interestingly, despite its apparent benefits to privacy-aware cloud computing, algebraic ciphers targeting FHE did not attract similar attention. Tomer Ashur, Mohammad Mahzoun, Dilara Toprakhisar |
CCS | 3 |