{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:17Z","timestamp":1763467697697,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"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":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2004,8]]},"abstract":"<jats:p>\n            In addition to its usual complexity assumptions, cryptography silently assumes that information can be physically protected in a single location. As one can easily imagine, real-life devices are not ideal and information may leak through different physical channels.This paper gives a rigorous definition of leakage immunity and presents several leakage detection tests. In these tests, failure\n            <jats:italic>confirms<\/jats:italic>\n            the probable existence of secret-correlated emanations and indicates how likely the leakage is. Success\n            <jats:italic>does not refute<\/jats:italic>\n            the existence of emanations but indicates that significant emanations were not detected\n            <jats:italic>on the strength of the evidence presented<\/jats:italic>\n            , which of course, leaves the door open to reconsider the situation if further evidence comes to hand at a later date.\n          <\/jats:p>","DOI":"10.1145\/1015047.1015050","type":"journal-article","created":{"date-parts":[[2005,8,2]],"date-time":"2005-08-02T08:38:10Z","timestamp":1122971890000},"page":"492-508","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Statistics and secret leakage"],"prefix":"10.1145","volume":"3","author":[{"given":"Jean-Sebastien","family":"Coron","sequence":"first","affiliation":[{"name":"Gemplus, Issy-les-Moulineaux, France"}]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[{"name":"Gemplus, Issy-les-Moulineaux, France"}]},{"given":"Paul","family":"Kocher","sequence":"additional","affiliation":[{"name":"Cryptography Research, Inc., San Francisco, CA"}]}],"member":"320","published-online":{"date-parts":[[2004,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Anderson R. and Kuhn M. 1996. Tamper resistance---a cautionary note. In The Second usenix Workshop on Electronic Commerce. 1--11.]]   Anderson R. and Kuhn M. 1996. Tamper resistance---a cautionary note. In The Second usenix Workshop on Electronic Commerce. 1--11.]]"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"volume-title":"Proceedings of Crypto' 97","author":"Biham E.","key":"e_1_2_1_3_1"},{"volume-title":"Proceedings of Eurocrypt' 97","author":"Boneh D.","key":"e_1_2_1_4_1"},{"volume-title":"Proceedings of Crypto' 99","author":"Chari S.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/648116.746453"},{"volume-title":"Observations and statistics: an essay on the theory of errors of observation and the first principles of statistics. Trans","author":"Edgeworth F.","key":"e_1_2_1_7_1"},{"volume-title":"Information technology--security techniques--evaluation criteria for it security","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","unstructured":"Jun B. and Kocher P. 1999. The intel random number generator. Cryptography Research white paper. Available at http:\/\/www.cryptography.com\/intelRNG.pdf.]]  Jun B. and Kocher P. 1999. The intel random number generator. Cryptography Research white paper. Available at http:\/\/www.cryptography.com\/intelRNG.pdf.]]"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1975.9825"},{"key":"e_1_2_1_11_1","unstructured":"Knuth D. 1969. The art of computer programming seminumerical algorithms. 2.]]   Knuth D. 1969. The art of computer programming seminumerical algorithms. 2.]]"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646761.706156"},{"volume-title":"Proceedings of Crypto' 99","author":"Kocher P.","key":"e_1_2_1_13_1"},{"volume-title":"Proceedings of the USENIX Workshop on Smartcard Technology.]]","author":"Kommerling O.","key":"e_1_2_1_14_1"},{"volume-title":"Practical Statistics","author":"Langley R.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Luby M. 1996. Pseudorandomness and cryptographic applications. In Princeton Computer Science Notes.]]   Luby M. 1996. Pseudorandomness and cryptographic applications. In Princeton Computer Science Notes.]]","DOI":"10.1515\/9780691206844"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/148544.148545"},{"key":"e_1_2_1_18_1","unstructured":"Mead C. and Conway L. 1980. Introduction to VLSI Systems. Addison-Wesley.]]   Mead C. and Conway L. 1980. Introduction to VLSI Systems. Addison-Wesley.]]"},{"key":"e_1_2_1_19_1","unstructured":"Miller I. Freund J. and Johnson R. 1990. Probability and statistics for enginners. Prentice Hall Englewood Cliffs NJ.]]  Miller I. Freund J. and Johnson R. 1990. Probability and statistics for enginners. Prentice Hall Englewood Cliffs NJ.]]"},{"volume-title":"Security requirements for cryptographic modules","key":"e_1_2_1_20_1"},{"volume-title":"Symposium on Electromagnetic Security for Information Protection","year":"1991","author":"I'","key":"e_1_2_1_21_1"},{"volume-title":"Primo simposio nazionale su sicurezza elettromagnetica nella protezione dell'informazione","year":"1988","author":"I'","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","unstructured":"Weste N. and Eshraghian K. 1993. Principles of CMOS VLSI Design. Addison-Wesley.]]   Weste N. and Eshraghian K. 1993. Principles of CMOS VLSI Design. Addison-Wesley.]]"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.641604"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015047.1015050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1015047.1015050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:32Z","timestamp":1750286612000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015047.1015050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["10.1145\/1015047.1015050"],"URL":"https:\/\/doi.org\/10.1145\/1015047.1015050","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2004,8]]},"assertion":[{"value":"2004-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}