Остановите войну!
for scientists:
default search action
Hart William Montgomery
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i22]Steven D. Galbraith, Yi-Fu Lai, Hart Montgomery:
A Simpler and More Efficient Reduction of DLog to CDH for Abelian Group Actions. IACR Cryptol. ePrint Arch. 2024: 191 (2024) - [i21]Hart Montgomery, Sikhar Patranabis:
Public-Key Cryptography through the Lens of Monoid Actions. IACR Cryptol. ePrint Arch. 2024: 236 (2024) - 2023
- [j1]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy:
Minicrypt Primitives with Algebraic Structure and Applications. J. Cryptol. 36(1): 2 (2023) - [c19]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Multiparty Noninteractive Key Exchange from Ring Key-Homomorphic Weak PRFs. CT-RSA 2023: 333-359 - [c18]Jiahui Liu, Hart Montgomery, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: - How to Not Build It from Lattices, and More. EUROCRYPT (1) 2023: 611-638 - [i20]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) - [i19]Matthias Geihs, Hart Montgomery:
A Low-Round Distributed PRF from Lattices and its Application to Distributed Key Management. IACR Cryptol. ePrint Arch. 2023: 1254 (2023) - 2022
- [c17]Hart Montgomery, Mark Zhandry:
Full Quantum Equivalence of Group Action DLog and CDH, and More. ASIACRYPT (1) 2022: 3-32 - [i18]Hart Montgomery, Jiahui Liu, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More. CoRR abs/2211.11994 (2022) - [i17]Hart Montgomery, Mark Zhandry:
Full Quantum Equivalence of Group Action DLog and CDH, and More. IACR Cryptol. ePrint Arch. 2022: 1135 (2022) - [i16]Samuel Jaques, Michael Lodder, Hart Montgomery:
ALLOSAUR: Accumulator with Low-Latency Oblivious Sublinear Anonymous credential Updates with Revocations. IACR Cryptol. ePrint Arch. 2022: 1362 (2022) - [i15]Hart Montgomery, Jiahui Liu, Mark Zhandry:
Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More. IACR Cryptol. ePrint Arch. 2022: 1620 (2022) - 2021
- [c16]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Pratik Sarkar:
Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH. ASIACRYPT (2) 2021: 305-334 - [c15]Mic Bowman, Debajyoti Das, Avradip Mandal, Hart Montgomery:
On Elapsed Time Consensus Protocols. INDOCRYPT 2021: 559-583 - [c14]Samuel Jaques, Hart Montgomery, Razvan Rosie, Arnab Roy:
Time-Release Cryptography from Minimal Circuit Assumptions. INDOCRYPT 2021: 584-606 - [i14]Mic Bowman, Debajyoti Das, Avradip Mandal, Hart Montgomery:
On Elapsed Time Consensus Protocols. IACR Cryptol. ePrint Arch. 2021: 86 (2021) - 2020
- [c13]Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis:
Cryptographic Group Actions and Applications. ASIACRYPT (2) 2020: 411-439 - [i13]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Ring Key-Homomorphic Weak PRFs and Applications. IACR Cryptol. ePrint Arch. 2020: 606 (2020) - [i12]Samuel Jaques, Hart Montgomery, Arnab Roy:
Time-release Cryptography from Minimal Circuit Assumptions. IACR Cryptol. ePrint Arch. 2020: 755 (2020) - [i11]Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis:
Cryptographic Group Actions and Applications. IACR Cryptol. ePrint Arch. 2020: 1188 (2020)
2010 – 2019
- 2019
- [c12]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Symmetric Primitives with Structured Secrets. CRYPTO (1) 2019: 650-679 - [c11]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy:
Minicrypt Primitives with Algebraic Structure and Applications. EUROCRYPT (2) 2019: 55-82 - [i10]Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy:
Minicrypt Primitives with Algebraic Structure and Applications. IACR Cryptol. ePrint Arch. 2019: 108 (2019) - [i9]Navid Alamati, Hart Montgomery, Sikhar Patranabis:
Symmetric Primitives with Structured Secrets. IACR Cryptol. ePrint Arch. 2019: 608 (2019) - 2018
- [c10]Avradip Mandal, John C. Mitchell, Hart Montgomery, Arnab Roy:
Data Oblivious Genome Variants Search on Intel SGX. DPM/CBT@ESORICS 2018: 296-310 - [c9]Hart Montgomery:
More Efficient Lattice PRFs from Keyed Pseudorandom Synthesizers. INDOCRYPT 2018: 190-211 - [c8]Hart Montgomery:
A Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples. PQCrypto 2018: 312-330 - [c7]Sam Kim, Kevin Lewi, Avradip Mandal, Hart Montgomery, Arnab Roy, David J. Wu:
Function-Hiding Inner Product Encryption Is Practical. SCN 2018: 544-562 - [i8]Hart William Montgomery:
A Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples. IACR Cryptol. ePrint Arch. 2018: 100 (2018) - [i7]Avradip Mandal, John C. Mitchell, Hart Montgomery, Arnab Roy:
Data Oblivious Genome Variants Search on Intel SGX. IACR Cryptol. ePrint Arch. 2018: 732 (2018) - [i6]Hart Montgomery:
More Efficient Lattice PRFs from Keyed Pseudorandom Synthesizers. IACR Cryptol. ePrint Arch. 2018: 1077 (2018) - 2017
- [c6]Avradip Mandal, John C. Mitchell, Hart William Montgomery, Arnab Roy:
Privacy for targeted advertising. CNS 2017: 438-443 - [c5]Dan Boneh, Sam Kim, Hart William Montgomery:
Private Puncturable PRFs from Standard Lattice Assumptions. EUROCRYPT (1) 2017: 415-445 - [i5]Dan Boneh, Sam Kim, Hart William Montgomery:
Private Puncturable PRFs From Standard Lattice Assumptions. IACR Cryptol. ePrint Arch. 2017: 100 (2017) - [i4]Avradip Mandal, John C. Mitchell, Hart William Montgomery, Arnab Roy:
Privacy for Targeted Advertising. IACR Cryptol. ePrint Arch. 2017: 658 (2017) - 2016
- [i3]Sam Kim, Kevin Lewi, Avradip Mandal, Hart William Montgomery, Arnab Roy, David J. Wu:
Function-Hiding Inner Product Encryption is Practical. IACR Cryptol. ePrint Arch. 2016: 440 (2016) - 2015
- [i2]Dan Boneh, Kevin Lewi, Hart William Montgomery, Ananth Raghunathan:
Key Homomorphic PRFs and Their Applications. IACR Cryptol. ePrint Arch. 2015: 220 (2015) - 2014
- [b1]Hart William Montgomery:
Pseudorandom functions with new properties. Stanford University, USA, 2014 - [c4]Kevin Lewi, Hart William Montgomery, Ananth Raghunathan:
Improved Constructions of PRFs Secure Against Related-Key Attacks. ACNS 2014: 44-61 - 2013
- [c3]Dan Boneh, Kevin Lewi, Hart William Montgomery, Ananth Raghunathan:
Key Homomorphic PRFs and Their Applications. CRYPTO (1) 2013: 410-428 - 2010
- [c2]Dan Boneh, Hart William Montgomery, Ananth Raghunathan:
Algebraic pseudorandom functions with improved efficiency from the augmented cascade. CCS 2010: 131-140 - [c1]Dan Boneh, Aggelos Kiayias, Hart William Montgomery:
Robust fingerprinting codes: a near optimal construction. Digital Rights Management Workshop 2010: 3-12 - [i1]Dan Boneh, Hart William Montgomery, Ananth Raghunathan:
Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade. IACR Cryptol. ePrint Arch. 2010: 442 (2010)
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-04-25 02:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint