Mohammad Hajiabadi

Shahram Khazaei

Behzad Vahdani

J. Cryptol., December, 2024

On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Laconic Branching Programs from the Diffie-Hellman Assumption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Lower-Bounds on Public-Key Operations in PIR.

[BibT_eX]

[DOI]

Jesko Dujmovic

IACR Cryptol. ePrint Arch., 2024

2023

Algebraic Restriction Codes and Their Applications.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

Lower Bounds on Assumptions Behind Registration-Based Encryption.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Credibility in Private Set Membership.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022

On the Worst-Case Inefficiency of CGKA.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Compact Ring Signatures from Learning With Errors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Amortizing Rate-1 OT and Applications to PIR and PSI.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Laconic Private Set Intersection and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

How to Build a Trapdoor Function from an Encryption Scheme.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

Master-Key KDM-Secure IBE from Pairings.

[BibT_eX]

[DOI]

Romain Gay

IACR Cryptol. ePrint Arch., 2020

2019

Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More.

[BibT_eX]

[DOI]

Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 2019

Two-Round Oblivious Transfer from CDH or LPN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

2018

Enhancements Are Blackbox Non-Trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption: Removing Private-Key Generator from IBE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Limits on the Power of Garbling Techniques for Public-Key Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Trapdoor Functions from the Computational Diffie-Hellman Assumption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

New Techniques for Efficient Trapdoor Functions and Applications.

[BibT_eX]

[DOI]

Romain Gay

IACR Cryptol. ePrint Arch., 2018

2017

Reproducible Circularly Secure Bit Encryption: Applications and Realizations.

[BibT_eX]

[DOI]

J. Cryptol., 2017

Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

Encryption security against key-dependent-message attacks: applications, realizations and separations.

[BibT_eX]

[DOI]

PhD thesis, 2016

2015

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes.

[BibT_eX]

[DOI]

S. Venkatesh

IACR Cryptol. ePrint Arch., 2015

Gambling, Computational Information, and Encryption Security.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

2012

Computational Soundness of Coinductive Symbolic Security under Active Attacks.

[BibT_eX]

[DOI]