{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:21Z","timestamp":1725559101208},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253389"},{"type":"electronic","value":"9783540319573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31957-3_80","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T17:26:19Z","timestamp":1278523579000},"page":"707-717","source":"Crossref","is-referenced-by-count":3,"title":["A Practical and Secure Communication Protocol in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"E.","family":"Sava\u015f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00191321","volume":"1","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a01, 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"80_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"Y.Z. Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"80_CR3","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"6","author":"Y. Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory\u00a06, 1668\u20131680 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"80_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45708-9_17","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"C.-J. Lu","year":"2002","unstructured":"Lu, C.-J.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 257\u2013271. Springer, Heidelberg (2002)"},{"key":"80_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-45146-4_4","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S.P. Vadhan","year":"2003","unstructured":"Vadhan, S.P.: On constructing locally computable extractors and cryptosystems in the bounded storage model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 61\u201377. Springer, Heidelberg (2003)"},{"key":"80_CR6","unstructured":"Kolata, G.: The Key Vanishes: Scientist Outlines Unbreakable Code. New York Times (2001)"},{"key":"80_CR7","unstructured":"Cromie, W.J.: Code conquers computer snoops: Offers promise of \u2018everlasting\u2019 security for senders. Harvard University Gazette (2001)"},{"key":"80_CR8","unstructured":"Observatory, U.S.N.: GPS timing data & information (2004), http:\/\/tycho.usno.navy.mil\/gps_datafiles.html"},{"key":"80_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0052345","volume-title":"Fast Software Encryption","author":"S. Halevi","year":"1997","unstructured":"Halevi, S., Krawczyk, H.: MMH: Software message authentication in the gbit\/Second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 172\u2013189. Springer, Heidelberg (1997)"},{"key":"80_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Black","year":"1999","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and secure message authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 216\u2013233. Springer, Heidelberg (1999)"},{"key":"80_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"3","author":"O. Gabber","year":"1981","unstructured":"Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences\u00a03, 407\u2013420 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"80_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1978","unstructured":"Carter, J.L., Wegman, M.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"80_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 129\u2013139. Springer, Heidelberg (1994)"},{"key":"80_CR14","series-title":"Lecture Notes in Computer Science","first-page":"313","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"P. Rogaway","year":"1995","unstructured":"Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 313\u2013328. Springer, Heidelberg (1995)"},{"key":"80_CR15","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-45238-6_14","volume-title":"Workshop on Cryptographic Hardware and Embedded Systems \u2014 CHES 2003","author":"B. Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Tomer, E.: True Random Number Generators Secure in a Changing Environment. In: \u00c7etin, K., Ko\u00e7, P.C. (eds.) Workshop on Cryptographic Hardware and Embedded Systems \u2014 CHES 2003, Berlin, Germany, pp. 166\u2013180. Springer, Heidelberg (2003)"},{"key":"80_CR16","first-page":"235","volume-title":"22nd Annual ACM Symposium on Theory of Computing","author":"Y. Mansour","year":"1990","unstructured":"Mansour, Y., Nissan, N., Tiwari, P.: The computational complexity of universal hashing. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 235\u2013243. ACM Press, New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Networking - ICN 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31957-3_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:31:38Z","timestamp":1605742298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31957-3_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253389","9783540319573"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31957-3_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}