default search action
Mohammad Hajiabadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. J. Cryptol. 37(4): 34 (2024) - [c29]Jesko Dujmovic, Mohammad Hajiabadi:
Lower-Bounds on Public-Key Operations in PIR. EUROCRYPT (6) 2024: 65-87 - [c28]Sanjam Garg, Mohammad Hajiabadi, Peihan Miao, Alice Murphy:
Laconic Branching Programs from the Diffie-Hellman Assumption. Public Key Cryptography (3) 2024: 323-355 - [c27]Mohammad Hajiabadi, Roman Langrehr, Adam O'Neill, Mingyuan Wang:
On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption. TCC (3) 2024: 318-343 - [i27]Sanjam Garg
, Mohammad Hajiabadi, Peihan Miao, Alice Murphy:
Laconic Branching Programs from the Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2024: 102 (2024) - [i26]Jesko Dujmovic, Mohammad Hajiabadi:
Lower-Bounds on Public-Key Operations in PIR. IACR Cryptol. ePrint Arch. 2024: 694 (2024) - [i25]Mohammad Hajiabadi, Roman Langrehr, Adam O'Neill, Mingyuan Wang:
On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2024: 1877 (2024) - 2023
- [j2]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta
Algebraic Restriction Codes and Their Applications. Algorithmica 85(12): 3602-3648 (2023) - [c26]Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. ITC 2023: 12:1-12:25 - [c25]Sanjam Garg, Mohammad Hajiabadi, Abhishek Jain, Zhengzhong Jin, Omkant Pandey, Sina Shiehian:
Credibility in Private Set Membership. Public Key Cryptography (2) 2023: 159-189 - [c24]Mohammad Hajiabadi, Mohammad Mahmoody
Lower Bounds on Assumptions Behind Registration-Based Encryption. TCC (2) 2023: 306-334 - [i24]Mohammad Hajiabadi, Shahram Khazaei, Behzad Vahdani:
Randomness Recoverable Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2023: 959 (2023) - 2022
- [c23]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta
Algebraic Restriction Codes and Their Applications. ITCS 2022: 2:1-2:15 - [c22]Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler
On the Worst-Case Inefficiency of CGKA. TCC (2) 2022: 213-243 - [i23]Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg
On the Worst-Case Inefficiency of CGKA. IACR Cryptol. ePrint Arch. 2022: 1237 (2022) - 2021
- [c21]Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta
How to Build a Trapdoor Function from an Encryption Scheme. ASIACRYPT (3) 2021: 220-249 - [c20]Rohit Chatterjee, Sanjam Garg, Mohammad Hajiabadi, Dakshita Khurana, Xiao Liang, Giulio Malavolta
Compact Ring Signatures from Learning with Errors. CRYPTO (1) 2021: 282-312 - [c19]Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu
Laconic Private Set Intersection and Applications. TCC (3) 2021: 94-125 - [c18]Melissa Chase, Sanjam Garg, Mohammad Hajiabadi, Jialin Li, Peihan Miao:
Amortizing Rate-1 OT and Applications to PIR and PSI. TCC (3) 2021: 126-156 - [i22]Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg
Laconic Private Set Intersection and Applications. IACR Cryptol. ePrint Arch. 2021: 728 (2021) - [i21]Rohit Chatterjee, Sanjam Garg
Compact Ring Signatures from Learning With Errors. IACR Cryptol. ePrint Arch. 2021: 942 (2021) - [i20]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and their Applications. IACR Cryptol. ePrint Arch. 2021: 1177 (2021) - [i19]Melissa Chase, Sanjam Garg
Amortizing Rate-1 OT and Applications to PIR and PSI. IACR Cryptol. ePrint Arch. 2021: 1525 (2021) - 2020
- [c17]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs:
Two-Round Oblivious Transfer from CDH or LPN. EUROCRYPT (2) 2020: 768-797 - [c16]Sanjam Garg, Romain Gay
Master-Key KDM-Secure IBE from Pairings. Public Key Cryptography (1) 2020: 123-152 - [c15]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. TCC (1) 2020: 88-116 - [i18]Sanjam Garg
Master-Key KDM-Secure IBE from Pairings. IACR Cryptol. ePrint Arch. 2020: 616 (2020)
2010 – 2019
- 2019
- [c14]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Kevin Liu, Giulio Malavolta
Rate-1 Trapdoor Functions from the Diffie-Hellman Problem. ASIACRYPT (3) 2019: 585-606 - [c13]Sanjam Garg, Romain Gay
New Techniques for Efficient Trapdoor Functions and Applications. EUROCRYPT (3) 2019: 33-63 - [c12]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody
Registration-Based Encryption from Standard Assumptions. Public Key Cryptography (2) 2019: 63-93 - [i17]Nico Döttling, Sanjam Garg
Two-Round Oblivious Transfer from CDH or LPN. IACR Cryptol. ePrint Arch. 2019: 414 (2019) - [i16]Sanjam Garg
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. IACR Cryptol. ePrint Arch. 2019: 990 (2019) - [i15]Nico Döttling, Sanjam Garg
Rate-1 Trapdoor Functions from the Diffie-Hellman Problem. IACR Cryptol. ePrint Arch. 2019: 1072 (2019) - 2018
- [c11]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody
Limits on the Power of Garbling Techniques for Public-Key Encryption. CRYPTO (3) 2018: 335-364 - [c10]Sanjam Garg, Mohammad Hajiabadi:
Trapdoor Functions from the Computational Diffie-Hellman Assumption. CRYPTO (2) 2018: 362-391 - [c9]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny:
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. Public Key Cryptography (1) 2018: 3-31 - [c8]Mohammad Hajiabadi:
Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations. TCC (1) 2018: 448-475 - [c7]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody
Registration-Based Encryption: Removing Private-Key Generator from IBE. TCC (1) 2018: 689-718 - [i14]Sanjam Garg
Trapdoor Functions from the Computational Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2018: 529 (2018) - [i13]Sanjam Garg
Limits on the Power of Garbling Techniques for Public-Key Encryption. IACR Cryptol. ePrint Arch. 2018: 555 (2018) - [i12]Sanjam Garg
New Techniques for Efficient Trapdoor Functions and Applications. IACR Cryptol. ePrint Arch. 2018: 872 (2018) - [i11]Mohammad Hajiabadi:
Enhancements Are Blackbox Non-Trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2018: 900 (2018) - [i10]Sanjam Garg
Registration-Based Encryption: Removing Private-Key Generator from IBE. IACR Cryptol. ePrint Arch. 2018: 919 (2018) - [i9]Sanjam Garg
Registration-Based Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 1030 (2018) - 2017
- [j1]Mohammad Hajiabadi, Bruce M. Kapron
Reproducible Circularly Secure Bit Encryption: Applications and Realizations. J. Cryptol. 30(4): 1187-1237 (2017) - [c6]Jonathan Bootle
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. ASIACRYPT (3) 2017: 336-365 - [c5]Mohammad Hajiabadi, Bruce M. Kapron
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. EUROCRYPT (2) 2017: 561-591 - [i8]Mohammad Hajiabadi, Bruce M. Kapron:
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. IACR Cryptol. ePrint Arch. 2017: 146 (2017) - [i7]Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen:
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. IACR Cryptol. ePrint Arch. 2017: 872 (2017) - [i6]Nico Döttling, Sanjam Garg
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. IACR Cryptol. ePrint Arch. 2017: 978 (2017) - 2016
- [b1]Mohammad Hajiabadi:
Encryption security against key-dependent-message attacks: applications, realizations and separations. University of Victoria, Canada, 2016 - [c4]Mohammad Hajiabadi, Bruce M. Kapron
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. Public Key Cryptography (2) 2016: 129-158 - 2015
- [c3]Mohammad Hajiabadi, Bruce M. Kapron
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. CRYPTO (1) 2015: 224-243 - [c2]Mohammad Hajiabadi, Bruce M. Kapron
Gambling, Computational Information and Encryption Security. ICITS 2015: 141-158 - [i5]Mohammad Hajiabadi, Bruce M. Kapron:
Gambling, Computational Information, and Encryption Security. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Mohammad Hajiabadi, Bruce M. Kapron:
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations. IACR Cryptol. ePrint Arch. 2015: 531 (2015) - [i3]Mohammad Hajiabadi, Bruce M. Kapron, S. Venkatesh:
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. IACR Cryptol. ePrint Arch. 2015: 741 (2015) - [i2]Mohammad Hajiabadi, Bruce M. Kapron:
Gambling, Computational Information and Encryption Security. IACR Cryptol. ePrint Arch. 2015: 870 (2015) - 2013
- [c1]Mohammad Hajiabadi, Bruce M. Kapron
Computational Soundness of Coinductive Symbolic Security under Active Attacks. TCC 2013: 539-558 - 2012
- [i1]Mohammad Hajiabadi, Bruce M. Kapron:
Computational Soundness of Coinductive Symbolic Security under Active Attacks. IACR Cryptol. ePrint Arch. 2012: 560 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: