default search action
Ahmadreza Rahimi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Ahmadreza Rahimi:
Registration-based encryption. Ruhr University Bochum, Germany, 2024 - [i9]Pedro Branco, Russell W. F. Lai, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Ivy K. Y. Woo:
Traitor Tracing without Trusted Authority from Registered Functional Encryption. IACR Cryptol. ePrint Arch. 2024: 179 (2024) - 2023
- [c8]Behzad Abdolmaleki, Saikrishna Badrinarayanan, Rex Fernando, Giulio Malavolta, Ahmadreza Rahimi, Amit Sahai:
Two-Round Concurrent 2PC from Sub-exponential LWE. ASIACRYPT (1) 2023: 71-105 - [c7]Danilo Francati
, Daniele Friolo
Registered (Inner-Product) Functional Encryption. ASIACRYPT (5) 2023: 98-133 - [c6]Noemi Glaeser
Efficient Registration-Based Encryption. CCS 2023: 1065-1079 - [c5]Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai
Efficient Laconic Cryptography from Learning with Errors. EUROCRYPT (3) 2023: 417-446 - [i8]Danilo Francati, Daniele Friolo, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Daniele Venturi:
Registered (Inner-Product) Functional Encryption. IACR Cryptol. ePrint Arch. 2023: 395 (2023) - [i7]Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Laconic Cryptography from Learning With Errors. IACR Cryptol. ePrint Arch. 2023: 404 (2023) - 2022
- [c4]Navid Alamati, Giulio Malavolta
Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols. TCC (1) 2022: 266-293 - [c3]Mohammad Mahmoody, Wei Qi, Ahmadreza Rahimi:
Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. TCC (1) 2022: 559-587 - [i6]Mohammad Mahmoody, Wei Qi, Ahmadreza Rahimi:
Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. IACR Cryptol. ePrint Arch. 2022: 1285 (2022) - [i5]Noemi Glaeser, Dimitris Kolonelos, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Registration-Based Encryption. IACR Cryptol. ePrint Arch. 2022: 1505 (2022) - [i4]Behzad Abdolmaleki, Saikrishna Badrinarayanan, Rex Fernando, Giulio Malavolta, Ahmadreza Rahimi, Amit Sahai:
Two-Round Concurrent 2PC from Sub-Exponential LWE. IACR Cryptol. ePrint Arch. 2022: 1719 (2022) - [i3]Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi:
Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols. IACR Cryptol. ePrint Arch. 2022: 1775 (2022)
2010 – 2019
- 2019
- [c2]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody
Registration-Based Encryption from Standard Assumptions. Public Key Cryptography (2) 2019: 63-93 - 2018
- [c1]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody
Registration-Based Encryption: Removing Private-Key Generator from IBE. TCC (1) 2018: 689-718 - [i2]Sanjam Garg
Registration-Based Encryption: Removing Private-Key Generator from IBE. IACR Cryptol. ePrint Arch. 2018: 919 (2018) - [i1]Sanjam Garg
Registration-Based Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 1030 (2018)
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-07-11 19:27 CEST 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: