{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:38:55Z","timestamp":1743111535706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319291710"},{"type":"electronic","value":"9783319291727"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29172-7_6","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T06:38:22Z","timestamp":1452235102000},"page":"79-91","source":"Crossref","is-referenced-by-count":1,"title":["Time-Advantage Ratios Under Simple Transformations: Applications in Cryptography"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Sk\u00f3rski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14496-7_1","volume-title":"Information Theoretic Security","author":"Y Dodis","year":"2010","unstructured":"Dodis, Y., Alwen, J., Wichs, D.: Survey: leakage resilience and the bounded retrieval model. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1109\/JPROC.2012.2188769","volume":"100","author":"A Barenghi","year":"2012","unstructured":"Barenghi, A., Breveglieri, L., Koren, I., Naccache, D.: Fault injection attacks on cryptographic devices: theory, practice, and countermeasures. Proc. IEEE 100, 3056\u20133076 (2012)","journal-title":"Proc. IEEE"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-39059-3_16","volume-title":"Information Security and Privacy","author":"R Laanoja","year":"2013","unstructured":"Laanoja, R., Buldas, A.: Security proofs for hash tree time-stamping using hash functions with small output size. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 235\u2013250. Springer, Heidelberg (2013)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-14081-5_20","volume-title":"Information Security and Privacy","author":"A Buldas","year":"2010","unstructured":"Buldas, A., Niitsoo, M.: Optimally tight security proofs for hash-then-publish time-stamping. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 318\u2013335. Springer, Heidelberg (2010)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-30539-2_35","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"A Buldas","year":"2004","unstructured":"Buldas, A., Saarepera, M.: On provably secure time-stamping schemes. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 500\u2013514. Springer, Heidelberg (2004)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-22792-9_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"YT Kalai","year":"2011","unstructured":"Kalai, Y.T., Chung, K.-M., Raz, R., Liu, F.-H.: Memory delegation. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 151\u2013168. Springer, Heidelberg (2011)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 293\u2013302. IEEE Computer Society, Washington, DC (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"6_CR8","first-page":"113","volume":"16","author":"A De","year":"2009","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Non-uniform attacks against one-way functions and PRGs. Electron. Colloquium Comput. Complex. (ECCC) 16, 113 (2009)","journal-title":"Electron. Colloquium Comput. Complex. (ECCC)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1\u201322. Springer, Heidelberg (2013)"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s00145-013-9174-5","volume":"28","author":"B Fuller","year":"2015","unstructured":"Fuller, B., O\u2019Neill, A., Reyzin, L.: A unified approach to deterministic encryption: new constructions and a connection to computational entropy. J. Cryptology 28(3), 671\u2013717 (2015)","journal-title":"J. Cryptology"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-33027-8_13","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"S Faust","year":"2012","unstructured":"Faust, S., Pietrzak, K., Schipper, J.: Practical leakage-resilient symmetric cryptography. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 213\u2013232. Springer, Heidelberg (2012)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 99\u2013108. ACM, New York (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L Reyzin","year":"2007","unstructured":"Reyzin, L., Lu, C.-J., Hsiao, C.-Y.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Alex Halderman, J., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Cal, J.A., Feldman, A.J., Felten, E.W.: Least we remember: cold boot attacks on encryption keys. In: USENIX Security Symposium (2008)","DOI":"10.1145\/1506409.1506429"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-54242-8_24","volume-title":"Theory of Cryptography","author":"K Pietrzak","year":"2014","unstructured":"Pietrzak, K., Jetchev, D.: How to fake auxiliary input. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 566\u2013590. Springer, Heidelberg (2014)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-54242-8_24","volume-title":"Theory of Cryptography","author":"D Jetchev","year":"2014","unstructured":"Jetchev, D., Pietrzak, K.: How to fake auxiliary input. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 566\u2013590. Springer, Heidelberg (2014)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"PC Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"6_CR19","volume-title":"Pseudorandomness and Cryptographic Applications","author":"MG Luby","year":"1994","unstructured":"Luby, M.G., Michael, L.: Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton (1994)"},{"key":"6_CR20","unstructured":"Mol, P.: Leakage-resilient cryptography: a survey of recent advances (2010). http:\/\/cseweb.ucsd.edu\/pmol\/Documents\/RE.pdf"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"6_CR22","unstructured":"Pietrzak, K.: Private communication, May"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-01001-9_27","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"K Pietrzak","year":"2009","unstructured":"Pietrzak, K.: A leakage-resilient mode of operation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 462\u2013482. Springer, Heidelberg (2009)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-22174-8_5","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"K Pietrzak","year":"2015","unstructured":"Pietrzak, K., Sk\u00f3rski, M.: The chain rule for HILL pseudoentropy, revisited. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LatinCrypt 2015. LNCS, vol. 9230, pp. 81\u201398. Springer, Heidelberg (2015)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Tulsiani, M., Vadhan, S.: Dense subsets of pseudorandom sets. In: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 76\u201385. IEEE Computer Society, Washington, DC (2008)","DOI":"10.1109\/FOCS.2008.38"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-319-17470-9_7","volume-title":"Information Theoretic Security","author":"M Skorski","year":"2015","unstructured":"Skorski, M.: Metric pseudoentropy: characterizations, transformations and applications. In: Lehmann, A., Wolf, S. (eds.) ICITS 2015. LNCS, vol. 9063, pp. 105\u2013122. Springer, Heidelberg (2015)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-319-17470-9_8","volume-title":"Information Theoretic Security","author":"M Skorski","year":"2015","unstructured":"Skorski, M.: Nonuniform indistinguishability and unpredictability hardcore lemmas: new proofs and applications to pseudoentropy. In: Lehmann, A., Wolf, S. (eds.) ICITS 2015. LNCS, vol. 9063, pp. 123\u2013140. Springer, Heidelberg (2015)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-40041-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"CJ Zheng","year":"2013","unstructured":"Zheng, C.J., Vadhan, S.: A uniform min-max theorem with applications in cryptography. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 93\u2013110. Springer, Heidelberg (2013)"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-36095-4_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"F-X Standaert","year":"2013","unstructured":"Standaert, F.-X., Yu, Y.: Practical leakage-resilient pseudorandom objects with minimum public randomness. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 223\u2013238. Springer, Heidelberg (2013)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Yu, Y., Standaert, F.-X., Pereira, O., Yung, M.: Practical leakage-resilient pseudorandom generators. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 141\u2013151. ACM, New York (2010)","DOI":"10.1145\/1866307.1866324"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Information Security in the Balkans"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29172-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T05:00:35Z","timestamp":1567486835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29172-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319291710","9783319291727"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29172-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}