{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:53:06Z","timestamp":1747806786730,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642279003"},{"type":"electronic","value":"9783642279010"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27901-0_9","type":"book-chapter","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T02:01:25Z","timestamp":1326765685000},"page":"102-117","source":"Crossref","is-referenced-by-count":4,"title":["A Computational Indistinguishability Logic for the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Barthe","sequence":"first","affiliation":[]},{"given":"Mathilde","family":"Duclos","sequence":"additional","affiliation":[]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_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":"J. Alwen","year":"2010","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Survey: Leakage Resilience and the Bounded Retrieval Model. In: Kurosawa, K. (ed.) Information Theoretic Security. LNCS, vol.\u00a05973, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Barthe, G., Daubignard, M., Kapron, B., Lakhnech, Y.: Computational indistinguishability logic. In: Proceedings of the 17th ACM Conference on Computer and Communications Security. ACM (2010)","DOI":"10.1145\/1866307.1866350"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Barthes, G., Duclos, M., Lakhnech, Y.: A computational indistinguishability logic for the bounded storage model. Technical report, Verimag, IMDEA Software (2011)","DOI":"10.1007\/978-3-642-27901-0_9"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gr\u00e9goire, B., B\u00e9guelin, S.Z.: Formal certification of code-based cryptographic proofs. In: Proceedings of POPL 2009, pp. 90\u2013101 (2009)","DOI":"10.1145\/1594834.1480894"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: A computationally sound mechanized prover for security protocols. In: IEEE Symposium on Security and Privacy, pp. 140\u2013154 (2006)","DOI":"10.1109\/SP.2006.1"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"9_CR8","unstructured":"Cortier, V., Kremer, S., Warinschi, B.: A survey of symbolic methods in computational analysis of cryptographic systems. J. Autom. Reasoning, 1\u201335 (2010)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Warinschi, B.: Computationally sound compositional logic for key exchange protocols. In: Proceedings of CSFW 2006, pp. 321\u2013334 (2006)","DOI":"10.1109\/CSFW.2006.9"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-003-0309-y","volume":"17","author":"S. Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.: Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology\u00a017(1), 5\u201326 (2004)","journal-title":"Journal of Cryptology"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11681878_11","volume-title":"Theory of Cryptography","author":"S. Dziembowski","year":"2006","unstructured":"Dziembowski, S.: Intrusion-Resilience Via the Bounded-Storage Model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 207\u2013224. Springer, Heidelberg (2006)"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption* 1. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.jcss.2005.06.008","volume":"72","author":"R. Impagliazzo","year":"2006","unstructured":"Impagliazzo, R., Kapron, B.M.: Logics for reasoning about cryptographic constructions. Journal of Computer and Systems Sciences\u00a072(2), 286\u2013320 (2006)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"9_CR15","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":"P.C. 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.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-17373-8_34","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"E. Kiltz","year":"2010","unstructured":"Kiltz, E., Pietrzak, K.: Leakage Resilient ElGamal Encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 595\u2013612. Springer, Heidelberg (2010)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U.M. Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"9_CR18","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.\u00a02951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"9_CR19","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 (Extended Abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 278\u2013296. Springer, Heidelberg (2004)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Rogaway, P., Bellare, M.: Optimal asymmetric encryption how to encrypt with rsa (1995)","DOI":"10.1007\/BFb0053428"},{"key":"9_CR21","unstructured":"Zhang, Y.: The computational SLR: a logic for reasoning about computational indistinguishability. IACR ePrint Archive 2008\/434 (2008); Also in Proc. of Typed Lambda Calculi and Applications 2009"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27901-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T22:02:02Z","timestamp":1742335322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27901-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642279003","9783642279010"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27901-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}