{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:46Z","timestamp":1750306966439,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T00:00:00Z","timestamp":1367971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,5,8]]},"DOI":"10.1145\/2484313.2484380","type":"proceedings-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T12:15:27Z","timestamp":1368533727000},"page":"505-510","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards fully incremental cryptographic schemes"],"prefix":"10.1145","author":[{"given":"K\u00e9vin","family":"Atighehchi","sequence":"first","affiliation":[{"name":"Aix-Marseille University, Marseilles, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Traian","family":"Muntean","sequence":"additional","affiliation":[{"name":"Aix-Marseille University, Marseilles, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CRYPTO","author":"Bellare Mihir","year":"1994","unstructured":"Mihir Bellare , Oded Goldreich , and Shafi Goldwasser . Incremental cryptography : The case of hashing and signing . In CRYPTO , 1994 . Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. Incremental cryptography: The case of hashing and signing. In CRYPTO, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225080"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754542.1754560"},{"key":"e_1_3_2_1_4_1","first-page":"109","volume-title":"FSE'01","author":"Buonanno Enrico","year":"2001","unstructured":"Enrico Buonanno , Jonathan Katz , and Moti Yung . Incremental unforgeable encryption . In FSE'01 , pages 109 -- 124 , 2001 . Enrico Buonanno, Jonathan Katz, and Moti Yung. Incremental unforgeable encryption. In FSE'01, pages 109--124, 2001."},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Hardware mechanisms for memory authentication: A survey of existing techniques and engines","volume":"4","author":"Elbaz Reouven","year":"2009","unstructured":"Reouven Elbaz , David Champagne , Catherine H. Gebotys , Ruby B. Lee , Nachiketh R. Potlapally , and Lionel Torres . Hardware mechanisms for memory authentication: A survey of existing techniques and engines . Transactions on Computational Science , 4 : 1 -- 22 , 2009 . Reouven Elbaz, David Champagne, Catherine H. Gebotys, Ruby B. Lee, Nachiketh R. Potlapally, and Lionel Torres. Hardware mechanisms for memory authentication: A survey of existing techniques and engines. Transactions on Computational Science, 4:1--22, 2009.","journal-title":"Transactions on Computational Science"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796375"},{"key":"e_1_3_2_1_7_1","first-page":"50","volume-title":"INDOCRYPT","author":"Goi Bok-Min","year":"2001","unstructured":"Bok-Min Goi , M. U. Siddiqi , and Hean-Teik Chuah . Incremental hash function based on pair chaining & modular arithmetic combining . In INDOCRYPT , pages 50 -- 61 , 2001 . Bok-Min Goi, M. U. Siddiqi, and Hean-Teik Chuah. Incremental hash function based on pair chaining & modular arithmetic combining. In INDOCRYPT, pages 50--61, 2001."},{"key":"e_1_3_2_1_8_1","volume-title":"TECH. REP.","author":"Michael","year":"2001","unstructured":"Michael T. Goodrich and Roberto Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical report , TECH. REP. , JOHNS HOPKINS INFORMATION SECURITY INSTITUTE , 2001 . Michael T. Goodrich and Roberto Tamassia. Efficient authenticated dictionaries with skip lists and commutative hashing. Technical report, TECH. REP., JOHNS HOPKINS INFORMATION SECURITY INSTITUTE, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2011.36"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258638"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731092"}],"event":{"name":"ASIA CCS '13: 8th ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Hangzhou China","acronym":"ASIA CCS '13"},"container-title":["Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484313.2484380","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484313.2484380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:19Z","timestamp":1750235959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484313.2484380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,8]]},"references-count":11,"alternative-id":["10.1145\/2484313.2484380","10.1145\/2484313"],"URL":"https:\/\/doi.org\/10.1145\/2484313.2484380","relation":{},"subject":[],"published":{"date-parts":[[2013,5,8]]},"assertion":[{"value":"2013-05-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}