{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:02:47Z","timestamp":1749646967529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030314996"},{"type":"electronic","value":"9783030315009"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31500-9_4","type":"book-chapter","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T23:26:53Z","timestamp":1568935613000},"page":"49-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Skiplist Timing Attack Vulnerability"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Nussbaum","sequence":"first","affiliation":[]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1290672.1290674","volume":"3","author":"James Aspnes","year":"2007","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Trans. Algorithms 3(4) (2007). https:\/\/doi.org\/10.1145\/1290672.1290674","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00453-004-1138-6","volume":"42","author":"A Bagchi","year":"2005","unstructured":"Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica 42(1), 31\u201348 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1138-6","journal-title":"Algorithmica"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-04444-1_28","volume-title":"Computer Security \u2013 ESORICS 2009","author":"D Bethea","year":"2009","unstructured":"Bethea, D., Reiter, M.K.: Data structures with unpredictable timing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 456\u2013471. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04444-1_28"},{"issue":"13","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.14778\/3007263.3007277","volume":"9","author":"J Chen","year":"2016","unstructured":"Chen, J., Jindel, S., Walzer, R., Sen, R., Jimsheleishvilli, N., Andrews, M.: The memSQL query optimizer: a modern optimizer for real-time analytics in a distributed database. Proc. VLDB Endow. 9(13), 1401\u20131412 (2016). https:\/\/doi.org\/10.14778\/3007263.3007277","journal-title":"Proc. VLDB Endow."},{"key":"4_CR5","unstructured":"Crosby, S.A., Wallach, D.S.: Denial of service via algorithmic complexity attacks. In: Proceedings of the 12th Conference on USENIX Security Symposium - Volume 12, SSYM 2003, p. 3. USENIX Association, Berkeley (2003). http:\/\/dl.acm.org\/citation.cfm?id=1251353.1251356"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-44808-X_18","volume-title":"Algorithm Engineering and Experimentation","author":"F Ergun","year":"2001","unstructured":"Ergun, F., Cenk \u015eahinalp, S., Sharp, J., Sinha, R.K.: Biased skip lists for highly skewed access patterns. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 216\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44808-X_18"},{"key":"4_CR7","unstructured":"Futoransky, A., Saura, D., Waissbein, A.: Timing attacks for recovering private entries from database engines, January 2008"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: Proceedings DARPA Information Survivability Conference and Exposition II, DISCEX 2001, vol. 2, pp. 68\u201382, June 2001. https:\/\/doi.org\/10.1109\/DISCEX.2001.932160","DOI":"10.1109\/DISCEX.2001.932160"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-45741-3_2","volume-title":"Computer Security \u2013 ESORICS 2016","author":"MT Goodrich","year":"2016","unstructured":"Goodrich, M.T., Kornaropoulos, E.M., Mitzenmacher, M., Tamassia, R.: More practical and secure history-independent hash tables. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9879, pp. 20\u201338. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45741-3_2"},{"key":"4_CR10","first-page":"251","volume":"31","author":"X Messeguer","year":"1997","unstructured":"Messeguer, X.: Skip trees, an alternative data structure to skip lists in a concurrent approach. ITA 31, 251\u2013269 (1997)","journal-title":"ITA"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985). https:\/\/doi.org\/10.1145\/3828.3835","journal-title":"J. ACM"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/11957454_20","volume-title":"Privacy Enhancing Technologies","author":"J Solis","year":"2006","unstructured":"Solis, J., Tsudik, G.: Simple and flexible revocation checking with privacy. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol. 4258, pp. 351\u2013367. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11957454_20"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31500-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:02:00Z","timestamp":1726790520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-31500-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030314996","9783030315009"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31500-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Data Privacy Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dpm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2019.uni.lu\/workshops\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}