{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:41:42Z","timestamp":1725540102994},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102295"},{"type":"electronic","value":"9783642102301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10230-1_17","type":"book-chapter","created":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T12:41:06Z","timestamp":1256992866000},"page":"195-210","source":"Crossref","is-referenced-by-count":3,"title":["Cryptographic Security of Individual Instances"],"prefix":"10.1007","author":[{"given":"L.","family":"Antunes","sequence":"first","affiliation":[]},{"given":"S.","family":"Laplante","sequence":"additional","affiliation":[]},{"given":"A.","family":"Pinto","sequence":"additional","affiliation":[]},{"given":"L.","family":"Salvador","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. National Computer Conference Proceedings\u00a048, 313\u2013317 (1979)","journal-title":"National Computer Conference Proceedings"},{"key":"17_CR2","first-page":"141","volume":"43","author":"E.F. Brickell","year":"1984","unstructured":"Brickell, E.F.: A few results in message authentication. Congressus Numerantium\u00a043, 141\u2013154 (1984)","journal-title":"Congressus Numerantium"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/321356.321363","volume":"13","author":"G.J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences. Journal of the ACM\u00a013(4), 145\u2013149 (1966)","journal-title":"Journal of the ACM"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to Information theory. Journal of the ACM\u00a022, 329\u2013340 (1975)","journal-title":"Journal of the ACM"},{"key":"17_CR5","unstructured":"G\u00e1cs, P.: Lecture Notes on Descriptional Complexity and Randomness (1988), \n                    \n                      http:\/\/www.cs.bu.edu\/faculty\/gacs\/papers\/ait-notes.pdf"},{"key":"17_CR6","unstructured":"Grunwald, P., Vit\u00e1nyi, P.: Shannon Information and Kolmogorov Complexity (2004), \n                    \n                      http:\/\/www.citebase.org\/abstract?id=oai:arXiv.org:cs\/0410002"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Generalized kolmogorov complexity and the structure of feasible computations. In: Proceedings of the 24th IEEE Symposium on Foundations of Computing, pp. 439\u2013445 (1983)","DOI":"10.1109\/SFCS.1983.21"},{"issue":"1","key":"17_CR8","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems Inform. Transmission\u00a01(1), 1\u20137 (1965)","journal-title":"Problems Inform. Transmission"},{"issue":"2-3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.tcs.2005.07.017","volume":"345","author":"T. Lee","year":"2005","unstructured":"Lee, T., Romashchenko, A.E.: Resource bounded symmetry of information revisited. Theoretical Computer Science\u00a0345(2-3), 386\u2013405 (2005)","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/174644.174648","volume":"41","author":"P. Orponen","year":"1994","unstructured":"Orponen, P., Ko, K.-I., Sch\u00f6ning, U., Watanabe, O.: Instance Complexity. Journal of the ACM\u00a041(1), 96\u2013121 (1994)","journal-title":"Journal of the ACM"},{"key":"17_CR12","first-page":"161","volume":"45","author":"G.J. Simmons","year":"1984","unstructured":"Simmons, G.J.: Message authentication: a game on hypergraphs. Congressus Numerantium\u00a045, 161\u2013192 (1984)","journal-title":"Congressus Numerantium"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume-title":"Advances in Cryptology","author":"G.J. Simmons","year":"1985","unstructured":"Simmons, G.J.: Authentication theory\/coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 411\u2013431. Springer, Heidelberg (1985)"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(1), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference, part i. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-46766-1_4","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: Combinatorial characterization of authentication codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 62\u201373. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10230-1_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:52Z","timestamp":1619782492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10230-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102295","9783642102301"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10230-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}