default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNavid Alamati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Navid Alamati, Sikhar Patranabis:
Cryptographic Primitives with Hinting Property. J. Cryptol. 37(3): 21 (2024)- [c14]Navid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter Rindal:
Improved Alternating-Moduli PRFs and Post-quantum Signatures. CRYPTO (8) 2024: 274-308 - [c13]Navid Alamati, Varun Maram
:
Quantum CCA-Secure PKE, Revisited. Public Key Cryptography (4) 2024: 193-226 - [i14]Navid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter Rindal:
Improved Alternating Moduli PRFs and Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2024: 582 (2024) - [i13]Navid Alamati, Varun Maram:
Quantum CCA-Secure PKE, Revisited. IACR Cryptol. ePrint Arch. 2024: 944 (2024) - 2023
- [j1]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy:
Minicrypt Primitives with Algebraic Structure and Applications. J. Cryptol. 36(1): 2 (2023) - [c12]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Multiparty Noninteractive Key Exchange from Ring Key-Homomorphic Weak PRFs. CT-RSA 2023: 333-359 - [c11]Navid Alamati, Varun Maram, Daniel Masny:
Non-Observable Quantum Random Oracle Model. PQCrypto 2023: 417-444 - [c10]Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. TCC (1) 2023: 158-187 - [i12]Navid Alamati, Varun Maram, Daniel Masny:
Non-Observable Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2023: 1126 (2023) - [i11]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Pratik Sarkar:
Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH. IACR Cryptol. ePrint Arch. 2023: 1170 (2023) - [i10]Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. IACR Cryptol. ePrint Arch. 2023: 1466 (2023) - 2022
- [c9]Navid Alamati, Sikhar Patranabis:
Cryptographic Primitives with Hinting Property. ASIACRYPT (1) 2022: 33-62 - [c8]Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi:
Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols. TCC (1) 2022: 266-293 - [i9]Navid Alamati, Sikhar Patranabis:
Cryptographic Primitives with Hinting Property. IACR Cryptol. ePrint Arch. 2022: 1770 (2022) - [i8]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) - 2021
- [c7]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Pratik Sarkar:
Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH. ASIACRYPT (2) 2021: 305-334 - [c6]Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu:
Laconic Private Set Intersection and Applications. TCC (3) 2021: 94-125 - [i7]Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu:
Laconic Private Set Intersection and Applications. IACR Cryptol. ePrint Arch. 2021: 728 (2021) - 2020
- [b1]Navid Alamati:
Algebraic Frameworks for Cryptographic Primitives. University of Michigan, USA, 2020 - [c5]Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis:
Cryptographic Group Actions and Applications. ASIACRYPT (2) 2020: 411-439 - [i6]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Ring Key-Homomorphic Weak PRFs and Applications. IACR Cryptol. ePrint Arch. 2020: 606 (2020) - [i5]Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis:
Cryptographic Group Actions and Applications. IACR Cryptol. ePrint Arch. 2020: 1188 (2020)
2010 – 2019
- 2019
- [c4]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Symmetric Primitives with Structured Secrets. CRYPTO (1) 2019: 650-679 - [c3]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy:
Minicrypt Primitives with Algebraic Structure and Applications. EUROCRYPT (2) 2019: 55-82 - [i4]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy:
Minicrypt Primitives with Algebraic Structure and Applications. IACR Cryptol. ePrint Arch. 2019: 108 (2019) - [i3]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Symmetric Primitives with Structured Secrets. IACR Cryptol. ePrint Arch. 2019: 608 (2019) - 2018
- [c2]Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. Public Key Cryptography (2) 2018: 619-643 - 2017
- [i2]Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. IACR Cryptol. ePrint Arch. 2017: 1226 (2017) - 2016
- [c1]Navid Alamati, Chris Peikert:
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. CRYPTO (2) 2016: 659-680 - [i1]Navid Alamati, Chris Peikert:
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. IACR Cryptol. ePrint Arch. 2016: 110 (2016)
Coauthor Index
aka: Hart Montgomery
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-08-21 21:33 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:
