Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ahmadreza Rahimi
dblp:227/7879
· DBLP profile ↗
8ranked-venue papers
0as first author
7since 2021 · last 2024
0009-0004-2340-6588ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 7 since 2021Theory of computation · 3 · 2 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 · 60% Cryptographic protocols and secure computation · 40% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
functional encryption |
1.4 | 2 | 2024 | Traitor Tracing Without Trusted Authority from Registered Functional Encryption · ASIACRYPT (3) 2024 Registered (Inner-Product) Functional Encryption · ASIACRYPT (5) 2023 |
Cryptographic primitives and cryptanalysis › functional encryption
registered functional encryption |
0.8 | 1 | 2024 | Traitor Tracing Without Trusted Authority from Registered Functional Encryption · ASIACRYPT (3) 2024 |
Cryptographic protocols and secure computation
traitor tracing |
0.8 | 1 | 2024 | Traitor Tracing Without Trusted Authority from Registered Functional Encryption · ASIACRYPT (3) 2024 |
Cryptographic primitives and cryptanalysis › functional encryption
inner product functional encryption |
0.7 | 1 | 2023 | Registered (Inner-Product) Functional Encryption · ASIACRYPT (5) 2023 |
Cryptographic protocols and secure computation › key management
key escrow |
0.7 | 1 | 2023 | Efficient Registration-Based Encryption · CCS 2023 |
Cryptographic protocols and secure computation
laconic cryptography |
0.7 | 1 | 2023 | Efficient Laconic Cryptography from Learning with Errors · EUROCRYPT (3) 2023 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.7 | 1 | 2023 | Efficient Laconic Cryptography from Learning with Errors · EUROCRYPT (3) 2023 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
learning with errors |
0.7 | 1 | 2023 | Efficient Laconic Cryptography from Learning with Errors · EUROCRYPT (3) 2023 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
0.7 | 1 | 2023 | Efficient Registration-Based Encryption · CCS 2023 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
registration-based encryption |
0.7 | 1 | 2023 | Efficient Registration-Based Encryption · CCS 2023 |
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation |
0.7 | 1 | 2023 | Two-Round Concurrent 2PC from Sub-exponential LWE · ASIACRYPT (1) 2023 |
Cryptographic protocols and secure computation › composable security
concurrent security |
0.2 | 1 | 2023 | Two-Round Concurrent 2PC from Sub-exponential LWE · ASIACRYPT (1) 2023 |
Methods — techniques the papers use, named apart from their topics
learning with errors · 1.3functional encryption · 0.8cryptographic efficiency · 0.7black-box construction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Traitor Tracing Without Trusted Authority from Registered Functional Encryption
Pedro Branco 0005, Russell W. F. Lai, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Ivy K. Y. Woo |
ASIACRYPT (3) | 5 |
| 2023 | Two-Round Concurrent 2PC from Sub-exponential LWE
Behzad Abdolmaleki, Saikrishna Badrinarayanan, Rex Fernando, Giulio Malavolta, Ahmadreza Rahimi, Amit Sahai |
ASIACRYPT (1) | 5 |
| 2023 | Registered (Inner-Product) Functional Encryption
Danilo Francati, Daniele Friolo, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Daniele Venturi 0001 |
ASIACRYPT (5) | 5 |
| 2023 | Efficient Registration-Based EncryptionabstractRegistration-based encryption (RBE) was recently introduced as an alternative to identity-based encryption (IBE), to resolve the key-escrow problem: In RBE, the trusted authority is substituted with a weaker entity, called the key curator, who has no knowledge of any secret key. Users generate keys on their own and then publicly register their identities and their corresponding public keys to the key curator. RBE is a promising alternative to IBE, retaining many of its advantages while removing the key-escrow problem, the major drawback of IBE. Unfortunately, all existing constructions of RBE use cryptographic schemes in a non black-box way, which makes them prohibitively expensive. It has been estimated that the size of an RBE ciphertext would be in the order of terabytes (though no RBE has even been implemented). Noemi Glaeser, Dimitris Kolonelos, Giulio Malavolta, Ahmadreza Rahimi |
CCS | 4 |
| 2023 | Efficient Laconic Cryptography from Learning with Errors
Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi |
EUROCRYPT (3) | 6 |
| 2022 | Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols
Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi |
TCC (1) | 3 |
| 2022 | Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption
Mohammad Mahmoody, Ahmadreza Rahimi |
TCC (1) | 3 |
| 2018 | Registration-Based Encryption: Removing Private-Key Generator from IBE
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi |
TCC (1) | 4 |