ECCC-Report TR96-065https://eccc.weizmann.ac.il/report/1996/065Comments and Revisions published for TR96-065en-usFri, 09 May 1997 08:18:54 +0300
Comment 1
| Correction Comment on: TR96-065 |
Miklos Ajtai,
Cynthia Dwork
https://eccc.weizmann.ac.il/report/1996/065#comment1Shai Halevi has pointed out an error in the proof of
Lemma 3.1 in the first version of the paper. In the revised (second)
version we present a corrected proof.
Fri, 09 May 1997 08:18:54 +0300https://eccc.weizmann.ac.il/report/1996/065#comment1
Revision 1
| A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence Revision of: TR96-065 |
Miklos Ajtai,
Cynthia Dwork
https://eccc.weizmann.ac.il/report/1996/065#revision1 We present a probabilistic public key cryptosystem which is
secure unless the following worst-case lattice problem can be solved in
polynomial time:
"Find the shortest nonzero vector in an n dimensional lattice
L where the shortest vector v is unique in the sense that any other
vector whose length is at most a constant power of n times the length
of v, is parallel to v ."
Wed, 07 May 1997 00:00:00 +0300https://eccc.weizmann.ac.il/report/1996/065#revision1
Paper TR96-065
| A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence |
Miklos Ajtai,
Cynthia Dwork
https://eccc.weizmann.ac.il/report/1996/065 We present a probabilistic public key cryptosystem which is
secure unless the following worst-case lattice problem can be solved in
polynomial time:
"Find the shortest nonzero vector in an n dimensional lattice
L where the shortest vector v is unique in the sense that any other
vector whose length is at most a constant power of n times the length
of v, is parallel to v ."
Fri, 13 Dec 1996 10:10:11 +0200https://eccc.weizmann.ac.il/report/1996/065