{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:26:44Z","timestamp":1730291204742,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,13]]},"DOI":"10.1109\/pst52912.2021.9647779","type":"proceedings-article","created":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T21:08:01Z","timestamp":1640120881000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Searching on Non-Systematic Erasure Codes"],"prefix":"10.1109","author":[{"given":"Atthapan","family":"Daramas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vimal","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"ref11","article-title":"On the confidentiality of information dispersal algorithms and their erasure codes","author":"li","year":"2012","journal-title":"arXiv preprint arXiv 1206 4123"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00263-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SOSE.2018.00020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15546-8_7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3064005"},{"key":"ref18","first-page":"142","article-title":"Learning word vectors for sentiment analysis","author":"maas","year":"2011","journal-title":"Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics Human Language Technologies"},{"key":"ref19","first-page":"1","article-title":"Coding theorems for a discrete source with a fidelity criterion","volume":"4","author":"shannon","year":"1959","journal-title":"IRE Nat Conv Rec"},{"journal-title":"Product documentation for red hat ceph storage 3","year":"0","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/384264.379239"},{"key":"ref6","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"0","journal-title":"Presented as part of the 2012 USENIX Annual Technical Conference ( USENIX ATC 12)"},{"journal-title":"Minio erasure code quickstart guide","year":"0","key":"ref5"},{"key":"ref8","article-title":"Erasure code with shingled local parity groups for efficient recovery from multiple disk failures","author":"miyamae","year":"2014","journal-title":"10th Workshop on Hot Topics in System Dependability (HotDep 14)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2535929"},{"journal-title":"Introducing ibm spectrum scale erasure code edition","year":"2021","key":"ref2"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-45748-8_31","article-title":"Erasure coding vs. replication: A quantitative comparison","author":"weatherspoon","year":"2002","journal-title":"International Workshop on Peer-to-Peer Systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-02879-6"}],"event":{"name":"2021 18th International Conference on Privacy, Security and Trust (PST)","start":{"date-parts":[[2021,12,13]]},"location":"Auckland, New Zealand","end":{"date-parts":[[2021,12,15]]}},"container-title":["2021 18th International Conference on Privacy, Security and Trust (PST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9647713\/9647738\/09647779.pdf?arnumber=9647779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:59:50Z","timestamp":1652201990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9647779\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/pst52912.2021.9647779","relation":{},"subject":[],"published":{"date-parts":[[2021,12,13]]}}}