Hart William Montgomery

According to our database, Hart William Montgomery authored at least 26 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Public-Key Cryptography through the Lens of Monoid Actions.

Hart Montgomery, Sikhar Patranabis

IACR Cryptol. ePrint Arch., 2024

A Simpler and More Efficient Reduction of DLog to CDH for Abelian Group Actions.

Steven D. Galbraith, Yi-Fu Lai, Hart Montgomery

IACR Cryptol. ePrint Arch., 2024

2023

Minicrypt Primitives with Algebraic Structure and Applications.

Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy

J. Cryptol., 2023

A Low-Round Distributed PRF from Lattices and its Application to Distributed Key Management.

Matthias Geihs, Hart Montgomery

IACR Cryptol. ePrint Arch., 2023

Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH.

Navid Alamati, Hart Montgomery, Sikhar Patranabis, Pratik Sarkar

IACR Cryptol. ePrint Arch., 2023

Multiparty Noninteractive Key Exchange from Ring Key-Homomorphic Weak PRFs.

Navid Alamati, Hart Montgomery, Sikhar Patranabis

Proceedings of the Topics in Cryptology - CT-RSA 2023, 2023

2022

Full Quantum Equivalence of Group Action DLog and CDH, and More.

Hart Montgomery, Mark Zhandry

IACR Cryptol. ePrint Arch., 2022

Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More.

Hart Montgomery, Jiahui Liu, Mark Zhandry

IACR Cryptol. ePrint Arch., 2022

ALLOSAUR: Accumulator with Low-Latency Oblivious Sublinear Anonymous credential Updates with Revocations.

Samuel Jaques, Michael Lodder, Hart Montgomery

IACR Cryptol. ePrint Arch., 2022

2021

On Elapsed Time Consensus Protocols.

Mic Bowman, Debajyoti Das, Avradip Mandal, Hart Montgomery

IACR Cryptol. ePrint Arch., 2021

Time-Release Cryptography from Minimal Circuit Assumptions.

Samuel Jaques, Hart Montgomery, Razvan Rosie, Arnab Roy

Proceedings of the Progress in Cryptology - INDOCRYPT 2021, 2021

2020

Time-release Cryptography from Minimal Circuit Assumptions.

Samuel Jaques, Hart Montgomery, Arnab Roy

IACR Cryptol. ePrint Arch., 2020

Ring Key-Homomorphic Weak PRFs and Applications.

Navid Alamati, Hart Montgomery, Sikhar Patranabis

IACR Cryptol. ePrint Arch., 2020

Cryptographic Group Actions and Applications.

Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis

IACR Cryptol. ePrint Arch., 2020

2019

Symmetric Primitives with Structured Secrets.

Navid Alamati, Hart Montgomery, Sikhar Patranabis

IACR Cryptol. ePrint Arch., 2019

2018

More Efficient Lattice PRFs from Keyed Pseudorandom Synthesizers.

Hart Montgomery

IACR Cryptol. ePrint Arch., 2018

A Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples.

Hart William Montgomery

IACR Cryptol. ePrint Arch., 2018

Data Oblivious Genome Variants Search on Intel SGX.

Avradip Mandal, John C. Mitchell, Hart Montgomery, Arnab Roy

IACR Cryptol. ePrint Arch., 2018

2017

Privacy for Targeted Advertising.

Avradip Mandal, John C. Mitchell, Hart William Montgomery, Arnab Roy

IACR Cryptol. ePrint Arch., 2017

Private Puncturable PRFs From Standard Lattice Assumptions.

Dan Boneh, Sam Kim, Hart William Montgomery

IACR Cryptol. ePrint Arch., 2017

2016

Function-Hiding Inner Product Encryption is Practical.

Sam Kim, Kevin Lewi, Avradip Mandal, Hart William Montgomery, Arnab Roy, David J. Wu

IACR Cryptol. ePrint Arch., 2016

2015

Key Homomorphic PRFs and Their Applications.

Dan Boneh, Kevin Lewi, Hart William Montgomery, Ananth Raghunathan

IACR Cryptol. ePrint Arch., 2015

2014

Pseudorandom functions with new properties.

Hart William Montgomery

PhD thesis, 2014

Improved Constructions of PRFs Secure Against Related-Key Attacks.

Kevin Lewi, Hart William Montgomery, Ananth Raghunathan

Proceedings of the Applied Cryptography and Network Security, 2014

2010

Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade.

Dan Boneh, Hart William Montgomery, Ananth Raghunathan

IACR Cryptol. ePrint Arch., 2010

Robust fingerprinting codes: a near optimal construction.

Dan Boneh, Aggelos Kiayias, Hart William Montgomery

Proceedings of the 10th ACM Workshop on Digital Rights Management, 2010