diff options
| author | Bryan Bishop <kanzure@gmail.com> | 2016-09-04 23:26:22 -0500 |
|---|---|---|
| committer | Bryan Bishop <kanzure@gmail.com> | 2016-09-04 23:26:22 -0500 |
| commit | 1439e91474fbdce24e6b1da176534b3f8613b0c1 (patch) | |
| tree | 5a0bad913af94d61a6eaf1e617b2bf39b0d431a5 | |
| parent | 72853cdb40c2c850d4bfe81be2e4caedd165a175 (diff) | |
| download | diyhpluswiki-1439e91474fbdce24e6b1da176534b3f8613b0c1.tar.gz diyhpluswiki-1439e91474fbdce24e6b1da176534b3f8613b0c1.zip | |
link to two more papers
| -rw-r--r-- | transcripts/simons-institute/history-of-lattice-based-cryptography.mdwn | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/transcripts/simons-institute/history-of-lattice-based-cryptography.mdwn b/transcripts/simons-institute/history-of-lattice-based-cryptography.mdwn index 6bf11d1..1e990f7 100644 --- a/transcripts/simons-institute/history-of-lattice-based-cryptography.mdwn +++ b/transcripts/simons-institute/history-of-lattice-based-cryptography.mdwn @@ -212,9 +212,9 @@ A: ... proof works for every n. There is the worst case side and then there's th But anyway, moving on, an important point is that it's sort of not quite understood at the time, this proof was not just a scale-downed version of Ajtai's function. I think that's what people had an impression of. I figured it was just a conference and it was rejected and I figured fine. But after a review after submitting to a journal, I got a one line rejection and that's when I knew hey wait something is up... the reviewer said hey this paper is using a new assumption, what would happen if the assumption gets broken, hey that would ruin the reputation of the journal (laughter). -Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices, Peikert-Rosen 2006 +[Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices, Peikert-Rosen 2006](https://web.eecs.umich.edu/~cpeikert/pubs/cyclic-crh.pdf) -Generalized compact knapsacks are collision resistant, Lyubashevsky-Micciancio 2006 +[Generalized compact knapsacks are collision resistant, Lyubashevsky-Micciancio 2006](https://cseweb.ucsd.edu/~daniele/papers/IdealHash.pdf) But if you think about the kind of assumptions used in the past few years, we get multilinear maps and obfuscation.. |