Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2951, Issue , 2004, Pages 258-277

  Lysyanskaya, Anna ^a,e   Malkin, Tal ^b   Micali, Silvio ^c   Rabin, Tal ^d  

^a Rosario Gennaro ^*  (Argentina)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Brown Univerity   (United States)

^d Columbia University ^*  (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; HARDWARE SECURITY; SIDE CHANNEL ATTACK;

ALGORITHMIC ASPECTS; CRYPTOGRAPHIC ALGORITHMS; CRYPTOGRAPHIC PRIMITIVES; PROVABLE SECURITY; SECRET INFORMATION; SECURITY SOLUTIONS; THEORETICAL FOUNDATIONS; THEORETICAL FRAMEWORK;

ALGORITHMS;

EID: 35048896529     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (22)

1. [AARR03] Dakshi Agrawal, Bruce Archambeault, Josyula R. Rao, and Pankaj Ro hatgi. The EM side-channel(s). In Burton S. Kaliski Jr., Çetin Kaya Koç, and Christof Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2002, volume 2523 of Lecture Notes in Computer Science, pages 29-45. Springer, 2003.
2. [AK96] Ross Anderson and Markus Kuhn. Tamper Resistance - a Cautionary Note. In Proceedings of the Second Usenix Workshop on Electronic Commerce, pages 1-11, November 1996.
3. [BDL01] Dan Boneh, Richard A. DeMillo, and Richard J. Lipton. On the importance of eliminating errors in cryptographic computations. Journal of Cryptology, 14(2):101-119, 2001.
4. [BS97] Eli Biham and Adi Shamir. Differential fault analysis of secret key cryptosystems. In Burt Kaliski, editor, Advances in Cryptology -CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 513-525. Springer Verlag, 1997.
5. [CGGM00] Ran Canetti, Oded Goldreich, Shafi Goldwasser, and Silvio Micali. Resettable zero-knowledge (extended abstract). In Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 235-244, 2000.
6. [CS99] Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46-52. ACM press, nov 1999.
7. [FS87] Amos Fiat and Adi Shamir. How to prove yourself: Practical solution to identification and signature problems. In Andrew M. Odlyzko, editor, Advances in Cryptology -CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer Verlag, 1987.
8. [GHR99] Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. In Jacques Stern, editor, Advances in Cryptology -EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 123-139. Springer Verlag, 1999.
9. [GM84] Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, April 1984.
10. [GMR88] Shafi Goldwasser, Silvio Micali, and Ronald Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, April 1988.
11. [GMW87] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
12. [Gol98] Oded Goldreich. Secure multi-party computation. Manuscript. Available from http:wuw.wisdom.weizmann.ac.il/oded/pp.html, 1998.
13. [GolOl] Oded Goldreich. Foundations of Cryptography. Cambridge University Press, 2001.
14. [GQ88] Louis C. Guillou and Jean-Jacques Quisquater. A "paradoxical" identitybased signature scheme resulting from zero-knowledge. In Shafi Goldwasser, editor, Advances in Cryptology -CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 216-231. Springer Verlag, 1988.
15. [ISW03] Yuval Ishai, Amit Sahai, and David Wagner. Private circuits: Securing hardware against probing attacks. In Dan Boneh, editor, Advances in Cryptology -CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science. Springer Verlag, 2003.
16. [KJJ99] Paul C. Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In Michael J. Wiener, editor, Advances in Cryptology -CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 388-397. Springer Verlag, 1999.
17. [MR03] Silvio Micali and Leonid Reyzin. Physically observable cryptography, http://eprint.iacr.org/2003/120, 2003.
18. [Ped92] Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Joan Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 129-140. Springer Verlag, 1992.
19. [QSOl] J. J. Quisquater and D. Samyde. Electro magnetic analysis (EMA): Measures and countermeasures for smart cards. In International Conference on Research in Smart Cards - Esmart, volume 435 of Lecture Notes in Computer Science, pages 200-210, Cannes, France, 2001. Springer Verlag.
20. [SA03] Sergei P. Skorobogatov and Ross J. Anderson. Optical fault induction attacks. In Burton S. Kaliski Jr., Çetin Kaya Koç, and Christof Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2002, volume 2523 of Lecture Notes in Computer Science, pages 2-12. Springer, 2003.
21. [Sch91] Claus P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.
22. [Yao82] Andrew C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 160-164, 1982.