{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T08:53:49Z","timestamp":1725440029820},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/iscc.2018.8538669","type":"proceedings-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T01:49:31Z","timestamp":1542678571000},"page":"00220-00223","source":"Crossref","is-referenced-by-count":1,"title":["A Method to Verify Data Integrity in Graph Databases"],"prefix":"10.1109","author":[{"given":"Fabio","family":"Reina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hylson Vescovi","family":"Netto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciana","family":"Rech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aldelir Fernando","family":"Luiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2557547.2557564"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/358790.358797"},{"key":"ref12","first-page":"218","author":"merkle","year":"1989","journal-title":"Crypto"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1321"},{"journal-title":"US secure hash algorithm 1 (SHA1)","year":"2001","author":"jones","key":"ref14"},{"key":"ref15","article-title":"Instruction set for message scheduling of SHA256 algorithm","author":"wolrich","year":"2014","journal-title":"Google Patents"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2013.2271537"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966477"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.106"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/1900000002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627699"},{"journal-title":"Modern Cryptography Theory and Practice","year":"2003","author":"mao","key":"ref8"},{"key":"ref7","article-title":"Graph Databases: New Opportunities for Connected Data","author":"robinson","year":"2015","journal-title":"O’Reilly Media Inc"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1978915.1978919"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721659"},{"key":"ref9","first-page":"118","article-title":"Efficient Data Integrity Checking for Untrusted Database Systems","author":"silverio","year":"2014","journal-title":"International Conference on Advances in Databases Knowledge and Data Applications"}],"event":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2018,6,25]]},"location":"Natal","end":{"date-parts":[[2018,6,28]]}},"container-title":["2018 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8510755\/8538441\/08538669.pdf?arnumber=8538669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T03:37:41Z","timestamp":1643254661000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8538669\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/iscc.2018.8538669","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}