Delaram Kahrobaei

dblp:71/4705 · DBLP profile ↗
← Back
13ranked-venue papers
3as first author
7since 2021 · last 2026
0000-0001-5467-7832ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 8 · 5 since 2021Theory of computation · 3 · 1 first-author · 2 since 2021Computer networks · 2 · 2 first-author
YearPublicationVenuePosition
2026 Eidolon: A Post-Quantum Signature Scheme Based on k-Colorability in the Age of Graph Neural Networks
Asmaa Cherkaoui, Ramón Flores, Delaram Kahrobaei, Richard C. Wilson 0001
WAIFI3
2024 Biscuit: New MPCitH Signature Scheme from Structured Multivariate Polynomials
Luk Bettale, Delaram Kahrobaei, Ludovic Perret, Javier A. Verbel
ACNS (1)2
2024 On the Semidirect Discrete Logarithm Problem in Finite Groups
Christopher Battarbee, Giacomo Borin, Julian Brough, Ryann Cartor, Tobias Hemmert, Nadia Heninger, David Jao, Delaram Kahrobaei, Laura Maddison, Edoardo Persichetti, Angela Robinson, Daniel Smith-Tone, Rainer Steinwandt
ASIACRYPT (8)8
2024 A Subexponential Quantum Algorithm for the Semidirect Discrete Logarithm Problem
Christopher Battarbee, Delaram Kahrobaei, Ludovic Perret, Siamak F. Shahandashti
PQCrypto (1)2
2023 SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
Christopher Battarbee, Delaram Kahrobaei, Ludovic Perret, Siamak F. Shahandashti
PQCrypto2
2022 A Survey on Delegated Computation
Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain
DLT3
2021 Single-Server Delegation of Ring Multiplications from Quasilinear-time Clients
abstract
We investigate the problem of delegating operations in cryptography solutions from client devices that only perform quasilinear-time or lower-order computations (e.g., additions/subtractions, modular reductions with a small modulus, etc.) to a single, possibly malicious, server. All previous work considered clients capable of computing higher-order operations, such as fully homomorphic encryption, group exponentiations or several group multiplications. In this model, we show protocols to delegate the computation of ring multiplications while satisfying desirable result correctness, input privacy and result security requirements. The main technical component, of independent interest, is a family of probabilistic tests that extends a classical test by Pippenger. The asymptotic improvement in our multiplication delegation protocols is also backed up by concrete implementation results, demonstrating that the client's online computation is strictly smaller than non-delegated computation of the same function, for input lengths of interest in cryptography solutions.
Giovanni Di Crescenzo, Matluba Khodjaeva, Vladimir Shpilrain, Delaram Kahrobaei, Rajesh Krishnan
SIN4
2020 Secure and Efficient Delegation of Elliptic-Curve Pairing
Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain
ACNS (1)3
2020 Secure and Efficient Delegation of Pairings with Online Inputs
Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain
CARDIS3
2016 Using Semidirect Product of (Semi)groups in Public Key Cryptography
Delaram Kahrobaei, Vladimir Shpilrain
CiE1
2014 Heisenberg Groups as Platform for the AAG Key-Exchange Protocol
abstract
When the AAG protocol was first introduced, braid groups were proposed as platform group. However, there are studies that successful attack AAG with braid groups, one main attack method is the length-based attack. Searching for a new platform for AAG, Garber, Kahrobaei, and Lam studied polycyclic groups generated by number field and concluded that they are resistant against the length-based attack. Inspired by this result, we ask whether other type of polycyclic groups can be used as platform for AAG. In this paper, we discuss the use of Heisenberg groups, a type of polycyclic group, as a platform group for AAG by submitting them to one of AAG's major attacks, the length-based attack.
Delaram Kahrobaei, Ha T. Lam
ICNP1
2013 Public Key Exchange Using Semidirect Product of (Semi)Groups
Maggie E. Habeeb, Delaram Kahrobaei, Charalambos Koupparis, Vladimir Shpilrain
ACNS2
2006 A Non-Commutative Generalization of ElGamal Key Exchange using Polycyclic Groups
abstract
In this paper, we propose a non-commutative key-exchange scheme which generalizes the classical ElGamal Cipher to polycyclic groups. We describe the criteria for groups which would provide good candidates for such cryptosystems, we also examine the complexity of the decision problems related to these key exchange.
Delaram Kahrobaei
GLOBECOM1