Skiplist.bib 12.5 KB
Newer Older
kklein's avatar
kklein committed
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 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261
%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/

%% Created for Chethan Kamath Hosdurg at 2018-02-26 11:03:21 +0100 


%% Saved with string encoding Unicode (UTF-8) 







@misc{VDFpiet,
    author = {Krzysztof Pietrzak},
    title = {Simple Verifiable Delay Functions},
    howpublished = {Cryptology ePrint Archive, Report 2018/627},
    year = {2018},
    note = {\url{https://eprint.iacr.org/2018/627}},
}

@misc{VDFw,
    author = {Benjamin Wesolowski},
    title = {Efficient verifiable delay functions},
    howpublished = {Cryptology ePrint Archive, Report 2018/623},
    year = {2018},
    note = {\url{https://eprint.iacr.org/2018/623}},
}

@misc{VDFb,
    author = {Dan Boneh and Joseph Bonneau and Benedikt Bünz and Ben Fisch},
    title = {Verifiable Delay Functions},
    howpublished = {Cryptology ePrint Archive, Report 2018/601},
    year = {2018},
    note = {\url{https://eprint.iacr.org/2018/601}},
}


@inproceedings{STOC:HolKunTes11,
	Acmid = {1993650},
	Address = {New York, NY, USA},
	Author = {Holenstein, Thomas and K\"{u}nzler, Robin and Tessaro, Stefano},
	Booktitle = {Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing},
	Date-Added = {2015-06-25 21:57:29 +0000},
	Date-Modified = {2015-06-25 21:57:29 +0000},
	Doi = {10.1145/1993636.1993650},
	Isbn = {978-1-4503-0691-1},
	Keywords = {cryptography, feistel construction, ideal cipher model, indifferentiability, random oracle model},
	Location = {San Jose, California, USA},
	Numpages = {10},
	Pages = {89--98},
	Publisher = {ACM},
	Series = {STOC '11},
	Title = {The Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited},
	Url = {http://doi.acm.org/10.1145/1993636.1993650},
	Year = {2011},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/1993636.1993650},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/1993636.1993650}}


@inproceedings{C:CorPatSeu08,
	Abstract = {The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed that security in the random oracle model implies security in the ideal cipher model; namely they showed that a random oracle can be replaced by a block cipher-based construction, and the resulting scheme remains secure in the ideal cipher model. The other direction was left as an open problem, i.e. constructing an ideal cipher from a random oracle. In this paper we solve this open problem and show that the Feistel construction with 6 rounds is enough to obtain an ideal cipher; we also show that 5 rounds are insufficient by providing a simple attack. This contrasts with the classical Luby-Rackoff result that 4 rounds are necessary and sufficient to obtain a (strong) pseudo-random permutation from a pseudo-random function.},
	Address = {Berlin, Heidelberg},
	Author = {Coron, Jean-S{\'e}bastien and Patarin, Jacques and Seurin, Yannick},
	Booktitle = {Advances in Cryptology -- CRYPTO 2008},
	Date-Added = {2018-05-16 15:38:13 +0000},
	Date-Modified = {2018-05-16 15:38:24 +0000},
	Editor = {Wagner, David},
	Isbn = {978-3-540-85174-5},
	Pages = {1--20},
	Publisher = {Springer Berlin Heidelberg},
	Title = {The Random Oracle Model and the Ideal Cipher Model Are Equivalent},
	Year = {2008}}


@inproceedings{EC:DacKatThi16,
	Abstract = {We revisit the question of constructing an ideal cipher from a random oracle. Coron et al. (Journal of Cryptology, 2014) proved that a 14-round Feistel network using random, independent, keyed round functions is indifferentiable from an ideal cipher, thus demonstrating the feasibility of such a transformation. Left unresolved is the number of rounds of a Feistel network that are needed in order for indifferentiability to hold. We improve upon the result of Coron et al. and show that 10 rounds suffice.},
	Address = {Berlin, Heidelberg},
	Author = {Dachman-Soled, Dana and Katz, Jonathan and Thiruvengadam, Aishwarya},
	Booktitle = {Advances in Cryptology -- EUROCRYPT 2016},
	Date-Added = {2018-05-16 15:40:27 +0000},
	Date-Modified = {2018-05-16 15:40:35 +0000},
	Editor = {Fischlin, Marc and Coron, Jean-S{\'e}bastien},
	Isbn = {978-3-662-49896-5},
	Pages = {649--678},
	Publisher = {Springer Berlin Heidelberg},
	Title = {10-Round Feistel is Indifferentiable from an Ideal Cipher},
	Year = {2016}}


@inproceedings{EC:DodGuoKat17,
	Abstract = {We revisit the security of cryptographic primitives in the random-oracle model against attackers having a bounded amount of auxiliary information about the random oracle. This situation arises most naturally when an attacker carries out offline preprocessing to generate state (namely, auxiliary information) that is later used as part of an on-line attack, with perhaps the best-known example being the use of rainbow tables for function inversion. The resulting model is also critical to obtain accurate bounds against non-uniform attackers when the random oracle is instantiated by a concrete hash function.},
	Address = {Cham},
	Author = {Dodis, Yevgeniy and Guo, Siyao and Katz, Jonathan},
	Booktitle = {Advances in Cryptology -- EUROCRYPT 2017},
	Date-Added = {2018-05-16 15:43:40 +0000},
	Date-Modified = {2018-05-16 15:43:46 +0000},
	Editor = {Coron, Jean-S{\'e}bastien and Nielsen, Jesper Buus},
	Isbn = {978-3-319-56614-6},
	Pages = {473--495},
	Publisher = {Springer International Publishing},
	Title = {Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited},
	Year = {2017}}

	
@article{May93,
	Author = {May , Timothy C.},
	Date-Added = {2018-02-26 10:02:06 +0000},
	Date-Modified = {2018-02-26 10:03:18 +0000},
	Journal = {http://www.hks.net/cpunks/ cpunks-0/1460.html},
	Title = {Timed-release  crypto},
	Year = {1993}}

@article{RSW00,
	Author = {Rivest, Ronald L. and Shamir, Adi and Wagner, David},
	Date-Added = {2018-02-26 09:58:43 +0000},
	Date-Modified = {2018-02-26 10:00:25 +0000},
	Journal = { Technical Report MIT/LCS/TR-684, MIT},
	Month = {February},
	Title = {Time-lock puzzles and timed-release crypto},
	Year = {2000}}

@article{EGS75,
	Author = {P. Erd{\"o}s and R.L. Graham and E. Szemer{\'e}di},
	Date-Added = {2018-02-26 09:55:33 +0000},
	Date-Modified = {2018-02-26 09:55:33 +0000},
	Doi = {http://dx.doi.org/10.1016/0898-1221(75)90037-1},
	Issn = {0898-1221},
	Journal = {Computers and Mathematics with Applications},
	Number = {3},
	Pages = {365 - 369},
	Title = {On sparse graphs with dense long paths},
	Url = {http://www.sciencedirect.com/science/article/pii/0898122175900371},
	Volume = {1},
	Year = {1975},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0898122175900371},
	Bdsk-Url-2 = {http://dx.doi.org/10.1016/0898-1221(75)90037-1}}

@inproceedings{ABP17,
	Abstract = {Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG)                                                                                   {\$}{\$}G{\_}n{\$}{\$}                   on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of                                                                                   {\$}{\$}G{\_}n{\$}{\$}                  :                                          The parallel cumulative pebbling complexity                                                                                                           {\$}{\$}{\backslash}varPi ^{\{}{\backslash}parallel {\}}{\_}{\{}cc{\}}(G{\_}n){\$}{\$}                         must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory).                                                              The sequential space-time pebbling complexity                                                                                                           {\$}{\$}{\backslash}varPi {\_}{\{}st{\}}(G{\_}n){\$}{\$}                         should be as close as possible to                                                                                                           {\$}{\$}{\backslash}varPi ^{\{}{\backslash}parallel {\}}{\_}{\{}cc{\}}(G{\_}n){\$}{\$}                         (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage).                                      },
	Address = {Cham},
	Author = {Alwen, Jo{\"e}l and Blocki, Jeremiah and Pietrzak, Krzysztof},
	Booktitle = {Advances in Cryptology -- EUROCRYPT 2017},
	Date-Added = {2018-02-26 09:55:04 +0000},
	Date-Modified = {2018-02-26 09:55:10 +0000},
	Editor = {Coron, Jean-S{\'e}bastien and Nielsen, Jesper Buus},
	Isbn = {978-3-319-56617-7},
	Pages = {3--32},
	Publisher = {Springer International Publishing},
	Title = {Depth-Robust Graphs and Their Cumulative Memory Complexity},
	Year = {2017}}

@article{LW17,
	Author = {Arjen K. Lenstra and Benjamin Wesolowski},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/journals/ijact/LenstraW17},
	Date-Added = {2018-02-26 09:47:40 +0000},
	Date-Modified = {2018-02-26 09:47:47 +0000},
	Doi = {10.1504/IJACT.2017.10010315},
	Journal = {{IJACT}},
	Number = {4},
	Pages = {330--343},
	Timestamp = {Thu, 01 Feb 2018 12:25:05 +0100},
	Title = {Trustworthy public randomness with sloth, unicorn, and trx},
	Url = {https://doi.org/10.1504/IJACT.2017.10010315},
	Volume = {3},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1504/IJACT.2017.10010315}}

@article{Pug90,
	Acmid = {78977},
	Address = {New York, NY, USA},
	Author = {Pugh, William},
	Date-Added = {2018-02-26 09:44:19 +0000},
	Date-Modified = {2018-02-26 09:44:24 +0000},
	Doi = {10.1145/78973.78977},
	Issn = {0001-0782},
	Issue_Date = {June 1990},
	Journal = {Commun. ACM},
	Keywords = {data structures, searching, trees},
	Month = jun,
	Number = {6},
	Numpages = {9},
	Pages = {668--676},
	Publisher = {ACM},
	Title = {Skip Lists: A Probabilistic Alternative to Balanced Trees},
	Url = {http://doi.acm.org/10.1145/78973.78977},
	Volume = {33},
	Year = {1990},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/78973.78977},
	Bdsk-Url-2 = {https://dx.doi.org/10.1145/78973.78977}}

@misc{BGJ+15,
	Author = {Nir Bitansky and Shafi Goldwasser and Abhishek Jain and Omer Paneth and Vinod Vaikuntanathan and Brent Waters},
	Date-Added = {2018-02-26 09:40:56 +0000},
	Date-Modified = {2018-02-26 09:40:56 +0000},
	Howpublished = {Cryptology ePrint Archive, Report 2015/514},
	Note = {\url{http://eprint.iacr.org/}},
	Title = {Time-Lock Puzzles from Randomized Encodings},
	Year = {2015}}

@inproceedings{MMV13,
	Acmid = {2422479},
	Address = {New York, NY, USA},
	Author = {Mahmoody, Mohammad and Moran, Tal and Vadhan, Salil},
	Booktitle = {Proceedings of the 4th Conference on Innovations in Theoretical Computer Science},
	Date-Added = {2018-02-26 09:36:44 +0000},
	Date-Modified = {2018-02-26 09:36:44 +0000},
	Doi = {10.1145/2422436.2422479},
	Isbn = {978-1-4503-1859-4},
	Keywords = {depth robust graphs, proofs of work, time-lock puzzles, timestamping},
	Location = {Berkeley, California, USA},
	Numpages = {16},
	Pages = {373--388},
	Publisher = {ACM},
	Series = {ITCS '13},
	Title = {Publicly Verifiable Proofs of Sequential Work},
	Url = {http://doi.acm.org/10.1145/2422436.2422479},
	Year = {2013},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2422436.2422479},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2422436.2422479}}

@inproceedings{MMV11,
	Author = {Mahmoody, Mohammad and Moran, Tal and Vadhan, Salil},
	Booktitle = {Advances in Cryptology -- CRYPTO 2011},
	Date-Added = {2018-02-26 09:36:40 +0000},
	Date-Modified = {2018-02-26 09:36:40 +0000},
	Doi = {10.1007/978-3-642-22792-9_3},
	Editor = {Rogaway, Phillip},
	Isbn = {978-3-642-22791-2},
	Language = {English},
	Pages = {39-50},
	Publisher = {Springer Berlin Heidelberg},
	Series = {Lecture Notes in Computer Science},
	Title = {Time-Lock Puzzles in the Random Oracle Model},
	Url = {http://dx.doi.org/10.1007/978-3-642-22792-9_3},
	Volume = {6841},
	Year = {2011},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-642-22792-9_3}}

	
@inproceedings{CP18,
  author    = {Bram Cohen and
               Krzysztof Pietrzak},
  title     = {Simple Proofs of Sequential Work},
  booktitle = {Advances in Cryptology - {EUROCRYPT} 2018 - 37th Annual International
               Conference on the Theory and Applications of Cryptographic Techniques,
               Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part {II}},
  pages     = {451--467},
  year      = {2018},
}
	
	
	
	
@misc{May93,
	Author = {Timothy C. May},
	Howpublished = {http://www.hks.net/cpunks/cpunks-0/1460.html},
	Year = {2012}}