Hart William Montgomery

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

Hart William Montgomery, 2018, IACR Cryptol. ePrint Arch..

Robust fingerprinting codes: a near optimal construction

Aggelos Kiayias, Dan Boneh, Hart William Montgomery, 2010, DRM '10.

Improved Constructions of PRFs Secure Against Related-Key Attacks

Kevin Lewi, Ananth Raghunathan, Hart William Montgomery, 2014, ACNS.

Key Homomorphic PRFs and Their Applications

Dan Boneh, Kevin Lewi, Ananth Raghunathan, 2013, CRYPTO.

Algebraic pseudorandom functions with improved efficiency from the augmented cascade

Dan Boneh, Ananth Raghunathan, Hart William Montgomery, 2010, CCS '10.

Privacy for targeted advertising

John C. Mitchell, Arnab Roy, Hart William Montgomery, 2017, 2017 IEEE Conference on Communications and Network Security (CNS).

Function-Hiding Inner Product Encryption is Practical

David J. Wu, Kevin Lewi, Arnab Roy, 2018, IACR Cryptol. ePrint Arch..

Private Puncturable PRFs from Standard Lattice Assumptions

Dan Boneh, Hart William Montgomery, Sam Kim, 2017, EUROCRYPT.