{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:46:43Z","timestamp":1751935603986,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T00:00:00Z","timestamp":1446422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Research Foundation (DFG) within the Collaborative Research Center \u201cOn-The-Fly Computing\u201d"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2015,11,2]]},"abstract":"<jats:p>\n            In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any \u03b5-fraction of its servers by a DoS attack, where \u03b5 can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point\n            <jats:italic>t<\/jats:italic>\n            <jats:sub>0<\/jats:sub>\n            of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after\n            <jats:italic>t<\/jats:italic>\n            <jats:sub>0<\/jats:sub>\n            is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers.\n          <\/jats:p>","DOI":"10.1145\/2809806","type":"journal-article","created":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T17:09:35Z","timestamp":1446484175000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["IRIS"],"prefix":"10.1145","volume":"2","author":[{"given":"Martina","family":"Eikel","sequence":"first","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2015,11,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148163"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393794.2393802"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584064"},{"key":"e_1_2_1_5_1","unstructured":"D. J. Bernstein. 2008. SYN cookies. http:\/\/cr.yp.to\/syncookies.html."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007938"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/192007.192033"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802209"},{"volume-title":"IEEE International Symposium on Information Theory. 1225--1229","author":"Cadambe V. R.","key":"e_1_2_1_9_1","unstructured":"V. R. Cadambe, C. Huang, and J. Li. 2011. Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems. In IEEE International Symposium on Information Theory. 1225--1229."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1096673.1096677"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","unstructured":"D. Dittrich J. Mirkovic S. Dietrich and P. Reiher. 2005. Internet Denial of Service: Attack and Defense Mechanisms. Prentice Hall PTR.","DOI":"10.5555\/1044905"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251460.1251469"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70830"},{"volume-title":"Proc. of NDSS.","author":"Ioannidis J.","key":"e_1_2_1_19_1","unstructured":"J. Ioannidis and S. M. Bellovin. 2002. Implementing pushback: Router-based defense against DDoS attacks. In Proc. of NDSS."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251203.1251224"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372148"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633032"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"e_1_2_1_24_1","unstructured":"Mazu Networks Inc. 2008. http:\/\/mazunetworks.com."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997156"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948114"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2006.5"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.758993"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740481"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"D. S. Papailiopoulos A. G. Dimakis and V. R. Cadambe. 2011. Repair optimal erasure codes through hadamard designs. CoRR abs\/1106.1634 (2011). http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1106.html#abs-1106-1634.","DOI":"10.1109\/Allerton.2011.6120328"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_2_1_33_1","unstructured":"E. Ratliff. 2005. The zombie hunters. In The New Yorker."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687941"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/645532.656170"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633033"},{"key":"e_1_2_1_39_1","volume-title":"Chord: A scalable peer-to-peer lookup service for internet applications. In Technical Report MIT.","author":"Stoica I.","year":"2002","unstructured":"I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Kalakrishnan. 2002b. Chord: A scalable peer-to-peer lookup service for internet applications. In Technical Report MIT."},{"key":"e_1_2_1_40_1","volume-title":"Technical Report UCB\/EECS-2010-46. EECS Department","author":"Suh C.","year":"2010","unstructured":"C. Suh and K. Ramchandran. 2010. On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage. Technical Report UCB\/EECS-2010-46. EECS Department, University of California, Berkeley. Available at http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2010\/EECS-2010-46.html."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211027"},{"volume-title":"Workshop on Hot Topics in Networks (HotNets\u201905)","author":"Walfish M.","key":"e_1_2_1_44_1","unstructured":"M. Walfish, H. Balakrishnan, D. Karger, and S. Shenker. 2005. DoS: Fighting fire with fire. In Workshop on Hot Topics in Networks (HotNets\u201905)."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159948"},{"key":"e_1_2_1_46_1","unstructured":"Wikipedia. 2013. Denial-of-service attack. (2013). http:\/\/en.wikipedia.org\/wiki\/Denial-of-service_attack accessed 12-February-2013."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782102"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080120"}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2809806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2809806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:42:54Z","timestamp":1750225374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2809806"}},"subtitle":["A Robust Information System Against Insider DoS Attacks"],"short-title":[],"issued":{"date-parts":[[2015,11,2]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11,2]]}},"alternative-id":["10.1145\/2809806"],"URL":"https:\/\/doi.org\/10.1145\/2809806","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"type":"print","value":"2329-4949"},{"type":"electronic","value":"2329-4957"}],"subject":[],"published":{"date-parts":[[2015,11,2]]},"assertion":[{"value":"2013-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}