-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbibli.bib
158 lines (142 loc) · 5.3 KB
/
bibli.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
@inproceedings{gen20090,
Author = {Gentry, Craig and others},
Booktitle = {STOC},
Date-Added = {2015-11-06 18:00:01 +0000},
Date-Modified = {2015-11-06 18:00:08 +0000},
Pages = {169--178},
Title = {Fully homomorphic encryption using ideal lattices.},
Volume = {9},
Year = {2009}}
@incollection{sma20101,
Author = {Smart, Nigel P and Vercauteren, Frederik},
Booktitle = {Public Key Cryptography--PKC 2010},
Date-Added = {2015-11-06 17:57:16 +0000},
Date-Modified = {2015-11-06 17:57:24 +0000},
Pages = {420--443},
Publisher = {Springer},
Title = {Fully homomorphic encryption with relatively small key and ciphertext sizes},
Year = {2010}}
@inproceedings{gol19820,
Author = {Goldwasser, Shafi and Micali, Silvio},
Booktitle = {Proceedings of the fourteenth annual ACM symposium on Theory of computing},
Date-Added = {2015-11-06 17:46:48 +0000},
Date-Modified = {2015-11-06 17:46:57 +0000},
Organization = {ACM},
Pages = {365--377},
Title = {Probabilistic encryption \& how to play mental poker keeping secret all partial information},
Year = {1982}}
@techreport{rab19790,
Author = {Rabin, Michael O},
Date-Added = {2015-11-06 17:45:29 +0000},
Date-Modified = {2015-11-06 17:45:36 +0000},
Institution = {DTIC Document},
Title = {Digitalized signatures and public-key functions as intractable as factorization},
Year = {1979}}
@article{riv19780,
Author = {Rivest, Ronald L and Shamir, Adi and Adleman, Len},
Date-Added = {2015-11-06 17:44:38 +0000},
Date-Modified = {2015-11-06 17:44:45 +0000},
Journal = {Communications of the ACM},
Number = {2},
Pages = {120--126},
Publisher = {ACM},
Title = {A method for obtaining digital signatures and public-key cryptosystems},
Volume = {21},
Year = {1978}}
@misc{cra20151,
Author = {Cramer, Ronald and Ducas, Léo and Peikert, Chris and Regev, Oded},
Date-Added = {2015-11-06 17:42:08 +0000},
Date-Modified = {2015-11-06 17:42:16 +0000},
Title = {Recovering short generators of principal ideals in cyclotomic rings},
Year = {2015}}
@inproceedings{cam20140,
Author = {Campbell, Peter and Groves, Michael and Shepherd, Dan},
Booktitle = {ETSI 2nd Quantum-Safe Crypto Workshop},
Date-Added = {2015-11-06 17:40:13 +0000},
Date-Modified = {2015-11-06 17:40:22 +0000},
Title = {Soliloquy: A cautionary tale},
Year = {2014}}
@article{reg20041,
Author = {Regev, Oded},
Date-Added = {2015-11-06 16:32:41 +0000},
Date-Modified = {2015-11-06 16:32:49 +0000},
Journal = {Journal of the ACM (JACM)},
Number = {6},
Pages = {899--942},
Publisher = {ACM},
Title = {New lattice-based cryptographic constructions},
Volume = {51},
Year = {2004}}
@article{mic2007,
Author = {Micciancio, Daniele and Regev, Oded},
Date-Added = {2015-11-06 16:30:47 +0000},
Date-Modified = {2015-11-06 16:30:55 +0000},
Journal = {SIAM Journal on Computing},
Number = {1},
Pages = {267--302},
Publisher = {SIAM},
Title = {Worst-case to average-case reductions based on Gaussian measures},
Volume = {37},
Year = {2007}}
@inproceedings{micc20020,
Author = {Micciancio, Daniele},
Booktitle = {Proceedings of the thiry-fourth annual ACM symposium on Theory of computing},
Date-Added = {2015-11-06 16:29:35 +0000},
Date-Modified = {2015-11-06 16:29:43 +0000},
Organization = {ACM},
Pages = {609--618},
Title = {Improved cryptographic hash functions with worst-case/average-case connection},
Year = {2002}}
@inproceedings{gol19961,
Author = {Goldreich, Oded and Goldwasser, Shafi and Halevi, Shai},
Booktitle = {Electronic Colloquium on Computational Complexity (ECCC)},
Date-Added = {2015-11-06 16:23:43 +0000},
Date-Modified = {2015-11-06 16:23:51 +0000},
Number = {42},
Pages = {236--241},
Title = {Collision-free hashing from lattice problems},
Volume = {3},
Year = {1996}}
@inproceedings{cai19970,
Author = {Cai, Jin-Yi and Nerurkar, Ajay P},
Booktitle = {focs},
Date-Added = {2015-11-06 16:21:14 +0000},
Date-Modified = {2015-11-06 16:21:21 +0000},
Organization = {IEEE},
Pages = {468},
Title = {An improved worst-case to average-case connection for lattice problems},
Year = {1997}}
@inproceedings{Ajt1997,
Acmid = {258604},
Address = {New York, NY, USA},
Author = {Ajtai, Mikl\'{o}s and Dwork, Cynthia},
Booktitle = {Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing},
Date-Added = {2015-11-06 15:50:34 +0000},
Date-Modified = {2015-11-06 15:50:52 +0000},
Doi = {10.1145/258533.258604},
Isbn = {0-89791-888-6},
Location = {El Paso, Texas, USA},
Numpages = {10},
Pages = {284--293},
Publisher = {ACM},
Rating = {4},
Series = {STOC '97},
Title = {A Public-key Cryptosystem with Worst-case/Average-case Equivalence},
Url = {http://doi.acm.org/10.1145/258533.258604},
Year = {1997},
Bdsk-Url-1 = {http://doi.acm.org/10.1145/258533.258604},
Bdsk-Url-2 = {http://dx.doi.org/10.1145/258533.258604}}
@article{Ajt19981,
Author = {Ajtai, Miklos},
Date-Added = {2015-11-06 07:08:24 +0000},
Date-Modified = {2015-11-06 07:08:47 +0000},
Title = {Worst-case complexity, average-case complexity and lattice problems},
Year = {1998}}
@article{Ajt19900,
Author = {Ajtai, Mikl6s and Komlós, Janos and Szemerédi, Endre},
Date-Added = {2015-11-06 07:01:25 +0000},
Date-Modified = {2015-11-06 07:02:11 +0000},
Journal = {A tribute to Paul Erdös, edited by A. Baker, B. Bollobás \& A. Hajnal},
Pages = {1--12},
Title = {Generating expanders from two permutations},
Year = {1990}}