Mohammad Hajiabadi

According to our database1, Mohammad Hajiabadi authored at least 29 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Randomness Recoverable Secret Sharing Schemes.
J. Cryptol., December, 2024

Laconic Branching Programs from the Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2024

Lower-Bounds on Public-Key Operations in PIR.
IACR Cryptol. ePrint Arch., 2024

2023
Algebraic Restriction Codes and Their Applications.
Algorithmica, December, 2023

Lower Bounds on Assumptions Behind Registration-Based Encryption.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Credibility in Private Set Membership.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022
On the Worst-Case Inefficiency of CGKA.
IACR Cryptol. ePrint Arch., 2022

2021
Compact Ring Signatures from Learning With Errors.
IACR Cryptol. ePrint Arch., 2021

Amortizing Rate-1 OT and Applications to PIR and PSI.
IACR Cryptol. ePrint Arch., 2021

Laconic Private Set Intersection and Applications.
IACR Cryptol. ePrint Arch., 2021

How to Build a Trapdoor Function from an Encryption Scheme.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Master-Key KDM-Secure IBE from Pairings.
IACR Cryptol. ePrint Arch., 2020

2019
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More.
IACR Cryptol. ePrint Arch., 2019

Two-Round Oblivious Transfer from CDH or LPN.
IACR Cryptol. ePrint Arch., 2019

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.
IACR Cryptol. ePrint Arch., 2019

2018
Enhancements Are Blackbox Non-Trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption: Removing Private-Key Generator from IBE.
IACR Cryptol. ePrint Arch., 2018

Limits on the Power of Garbling Techniques for Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2018

Trapdoor Functions from the Computational Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2018

New Techniques for Efficient Trapdoor Functions and Applications.
IACR Cryptol. ePrint Arch., 2018

2017
Reproducible Circularly Secure Bit Encryption: Applications and Realizations.
J. Cryptol., 2017

Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions.
IACR Cryptol. ePrint Arch., 2017

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.
IACR Cryptol. ePrint Arch., 2017

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
IACR Cryptol. ePrint Arch., 2017

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

2015
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes.
IACR Cryptol. ePrint Arch., 2015

Gambling, Computational Information, and Encryption Security.
Electron. Colloquium Comput. Complex., 2015

2012
Computational Soundness of Coinductive Symbolic Security under Active Attacks.
IACR Cryptol. ePrint Arch., 2012


  Loading...