Hart William Montgomery

Artificial Intelligence · 2013

A researcher in the Science corpus: 1 paper; trusts 4 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 23 citations into it; #30,771 of 35,345 by trust here, #33,294 by citations
• Computational Theory and Mathematics — 13 citations into it; #10,628 of 12,182 by trust here, #10,901 by citations
• Information Systems — 8 citations into it

Whom Hart William Montgomery trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Oded Regev
2. Victor Shoup
3. Chris Peikert
4. Ran Canetti
5. Moni Naor
6. Oded Goldreich

Who trusts Hart William Montgomery overall

1. Andrej Bogdanov

Papers from Hart William Montgomery's perspective

Ordered by how strongly the researchers Hart William Montgomery trusts endorse each paper. Same corpus, a different order for every researcher.

1. Trapdoors for hard lattices and new cryptographic constructions
2. On lattices, learning with errors, random linear codes, and cryptography
3. How to share a secret
4. How to construct random functions
5. Generating Shorter Bases for Hard Random Lattices (Theory of Computing Systems)
6. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
7. Practical Threshold Signatures (International Conference on the Theory and Application of Cryptographic Techniques)
8. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (Annual International Cryptology Conference)
9. Pseudorandom Functions and Lattices (International Conference on the Theory and Application of Cryptographic Techniques)
10. The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?) (Annual International Cryptology Conference)

Their papers

• Key Homomorphic PRFs and Their Applications (2013) — 349 citations