{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:47:53Z","timestamp":1729662473294,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/test.2015.7342419","type":"proceedings-article","created":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T16:11:39Z","timestamp":1449159099000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Extending residue-based fault tolerance to encrypted computation"],"prefix":"10.1109","author":[{"given":"Nektarios Georgios","family":"Tsoutsos","sequence":"first","affiliation":[]},{"given":"Michail","family":"Maniatakos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.121"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/11889700_18","article-title":"Robust finite field arithmetic for fault-tolerant public-key cryptography","author":"gaubatz","year":"2006","journal-title":"Fault Diagnosis and Tolerance in Cryptography"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12131"},{"journal-title":"Introduction to Modern Cryptography","year":"2008","author":"katz","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5219515"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","article-title":"Authenticated encryption: Relations among notions and analysis of the generic composition paradigm","author":"bellare","year":"2000","journal-title":"Advances in Cryptology ? ASIACRYPT 2000"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-48000-6_14","article-title":"Efficient public-key cryptosys-terns provably secure against active adversaries","author":"paillier","year":"1999","journal-title":"Advances in Cryptology ASIACRYPT'98"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"eigamal","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676240"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/12.709376"},{"key":"ref19","first-page":"1","article-title":"Fast variants of RSA","volume":"5","author":"boneh","year":"2002","journal-title":"Crypto- Bytes"},{"key":"ref28","first-page":"204","article-title":"Data integrity in hardware for modular arithmetic","author":"walter","year":"2000","journal-title":"Cryptographic Hardware and Embedded Systems (CHES)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660310"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.2.566"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660285"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2419619"},{"key":"ref29","article-title":"Computing mod without mod","author":"will","year":"0","journal-title":"Cryptology EPrint Archive Report 2014\/039 2014"},{"key":"ref5","first-page":"1","article-title":"HEROIC: Homomor-phically EncRypted One Instruction Computer","author":"tsoutsos","year":"2014","journal-title":"Design Automation and Test in Europe Conference and Exhibition (DATE)"},{"key":"ref8","first-page":"61","article-title":"Multiplicative homomorphic e-voting","author":"peng","year":"2005","journal-title":"Progress in Cryptology - INDOCRYPT 2004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660366"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660374"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DEST.2011.5936608"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.159"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/2031878"},{"key":"ref24","first-page":"1","article-title":"Multiple-bit upset protection in microprocessor memory arrays using vulnerability-based parity optimization and interleaving","author":"maniatakos","year":"2014","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555771"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2000.894311"},{"journal-title":"Concurrent error detection","year":"2002","author":"gorshe","key":"ref25"}],"event":{"name":"2015 IEEE International Test Conference (ITC)","start":{"date-parts":[[2015,10,6]]},"location":"Anaheim, CA, USA","end":{"date-parts":[[2015,10,8]]}},"container-title":["2015 IEEE International Test Conference (ITC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7331771\/7342364\/07342419.pdf?arnumber=7342419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T20:59:01Z","timestamp":1498251541000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7342419\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/test.2015.7342419","relation":{},"subject":[],"published":{"date-parts":[[2015,10]]}}}