{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:01:10Z","timestamp":1729630870017,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283976","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:57:57Z","timestamp":1346345877000},"page":"2546-2550","source":"Crossref","is-referenced-by-count":10,"title":["Secure network coding and non-malleable codes: Protection against linear tampering"],"prefix":"10.1109","author":[{"given":"Herve","family":"Chabanne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Patey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","article-title":"Secure computation from random error correcting codes","volume":"4515","author":"chen","year":"2007","journal-title":"Lecture Notes in Computer Science"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"11","first-page":"323","article-title":"Secure network coding","author":"cai","year":"0","journal-title":"Information Theory 2002 Proceedings 2002 IEEE International Symposium On 2002"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2094592"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_40"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089565"},{"key":"1","first-page":"434","article-title":"Non-malleable codes","author":"dziembowski","year":"2010","journal-title":"ICS"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"7","first-page":"37","article-title":"On the importance of checking cryptographic protocols for faults","author":"boneh","year":"1997","journal-title":"Eurocrypt"},{"key":"6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-36400-5_2","article-title":"Optical fault induction attacks","volume":"2523","author":"skorobogatov","year":"2002","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"Explicit Construction of A Non-malleable Code An Analysis of A Recent Approach by D K and O","year":"2011","author":"cwalina","key":"5"},{"journal-title":"Tamper and Leakage Resilience in the Split-state Model","year":"2011","author":"liu","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2005.862424"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283976.pdf?arnumber=6283976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:28:35Z","timestamp":1497986915000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283976\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283976","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}