Securing Circuits against Constant-Rate Tampering
| Title | Securing Circuits against Constant-Rate Tampering |
| Publication Type | Book Chapters |
| Year of Publication | 2012 |
| Authors | Dachman-Soled D, Kalai YTauman |
| Editor | Safavi-Naini R, Canetti R |
| Book Title | Advances in Cryptology – CRYPTO 2012 |
| Series Title | Lecture Notes in Computer Science |
| Pagination | 533 - 551 |
| Publisher | Springer Berlin Heidelberg |
| ISBN Number | 978-3-642-32008-8, 978-3-642-32009-5 |
| Keywords | circuit compiler, Computer Communication Networks, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, PCP of proximity, side-channel attacks, Systems and Data Security, tampering |
| Abstract | We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et. al. (Eurocrypt 2006), we consider adversaries who may choose an arbitrary set of wires to corrupt, and may set each such wire to 0 or to 1, or may toggle with the wire. We prove that such adversaries, who continuously tamper with the circuit, can learn at most logarithmically many bits of secret information (in addition to black-box access to the circuit). Our results are information theoretic. |
| URL | http://link.springer.com/chapter/10.1007/978-3-642-32009-5_31 |