Aria Shahverdi

Mr. Aria Shahverdi

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 November 2020 in Journal of Mathematical Cryptology
Verified
Journal Article
Open access
PDF file
DDDana Dachman-Soled
Dana Dachman-Soled
HGHuijing Gong
Huijing Gong
MKMukul Kulkarni
Mukul Kulkarni
ASAria Shahverdi
Aria Shahverdi
The leftover hash lemma (LHL) is used in the analysis of various lattice-based cryptosystems, such as the Regev and Dual-Regev encryption schemes as well as their leakage-resilient counterparts. The LHL does not hold in the ring setting, when the ring is far from a field, which is typical for efficient cryptosystems. Lyubashevsky et al . (Eurocrypt ’13) proved a “regularity lemma,” which can be used instead of the LHL, but applies only for Gaussian inputs. This is in contrast to the LHL, which applies when the input is drawn from any high min-entropy distribution. Our work presents an approach for generalizing the “regularity lemma” of Lyubashevsky et al . to certain conditional distributions. We assume the input was sampled from a discrete Gaussian distribution and consider the induced distribution, given side-channel leakage on the input. We present three instantiations of our approach, proving that the regularity lemma holds for three natural conditional distributions.

1 October 2019 in Information and Computation
Verified
Journal Article
Closed access
DDDana Dachman-Soled
Dana Dachman-Soled
MKMukul Kulkarni
Mukul Kulkarni
ASAria Shahverdi
Aria Shahverdi

1 March 2018
Verified
Book Chapter
Closed access
PDF file
DDDana Dachman-Soled
Dana Dachman-Soled
MKMukul Kulkarni
Mukul Kulkarni
ASAria Shahverdi
Aria Shahverdi

17 November 2020 in Journal of Mathematical Cryptology
Verified
Journal Article
Open access
PDF file
DDDana Dachman-Soled
Dana Dachman-Soled
HGHuijing Gong
Huijing Gong
MKMukul Kulkarni
Mukul Kulkarni
ASAria Shahverdi
Aria Shahverdi
We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under leakage of some fraction of coordinates of the NTT transform of the RLWE secret. (2) Present and implement an efficient key exposure attack that, given certain 1/4-fraction of the coordinates of the NTT transform of the RLWE secret, along with samples from the RLWE distribution, recovers the full RLWE secret for standard parameter settings. (3) Present a search-to-decision reduction for Leaky R-LWE for certain types of key exposure. (4) Propose applications to the security analysis of RLWE-based cryptosystems under partial key exposure.

25 August 2020
Verified
Book Chapter
Closed access
PDF file
MCMingliang Chen
Mingliang Chen
ASAria Shahverdi
Aria Shahverdi
SASarah Anderson
Sarah Anderson
SPSe Yong Park
Se Yong Park
JZJustin Zhang
Justin Zhang
MWMin Wu
Min Wu

4 November 2021
Verified
Book Chapter
Closed access
PDF file
DDDana Dachman-Soled
Dana Dachman-Soled
HGHuijing Gong
Huijing Gong
HKHunter Kippen
Hunter Kippen
ASAria Shahverdi
Aria Shahverdi