{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:07:55Z","timestamp":1743001675563,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319174693"},{"type":"electronic","value":"9783319174709"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17470-9_9","type":"book-chapter","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T06:09:35Z","timestamp":1428041375000},"page":"141-158","source":"Crossref","is-referenced-by-count":1,"title":["Gambling, Computational Information and Encryption Security"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Hajiabadi","sequence":"first","affiliation":[]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-32009-5_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M. Bellare","year":"2012","unstructured":"Bellare, M., Tessaro, S., Vardy, A.: Semantic security for the wiretap channel. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 294\u2013311. Springer, Heidelberg (2012)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-32284-6_6","volume-title":"Information Theoretic Security","author":"Y. Dodis","year":"2012","unstructured":"Dodis, Y.: Shannon impossibility, revisited. In: Smith, A. (ed.) ICITS 2012. LNCS, vol.\u00a07412, pp. 100\u2013110. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.E.: Adaptive game playing using multiplicative weights. Games and Economic Behavior\u00a029(1-2), 79\u2013103 (1999)","journal-title":"Games and Economic Behavior"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Rational protocol design: Cryptography against incentive-driven adversaries. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pp. 648\u2013657 (2013)","DOI":"10.1109\/FOCS.2013.75"},{"key":"9_CR7","series-title":"Basic Techniques","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Techniques, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"issue":"2","key":"9_CR8","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. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9_CR10","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":"C.-Y. Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1002\/j.1538-7305.1956.tb03809.x","volume":"35","author":"J.L. Kelly Jr.","year":"1956","unstructured":"Kelly Jr., J.L.: A new interpretation of information rate. Bell System Technical Journal\u00a035(4), 917\u2013926 (1956)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"Micali, S., Rackoff, C., Sloan, B.: The notion of security for probabilistic cryptosystems. SIAM J. Comput.\u00a017(2), 412\u2013426 (1988)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s00224-009-9177-7","volume":"45","author":"A. Pinto","year":"2009","unstructured":"Pinto, A.: Comparing notions of computational entropy. Theory Comput. Syst.\u00a045(4), 944\u2013962 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"key":"9_CR15","first-page":"141","volume":"18","author":"S.P. Vadhan","year":"2011","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 141 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (Extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 1982, November 3-5, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Computational information theory. In: Abu-Mostafa, Y.B. (eds.) Complexity in Information Theory, pp. 1\u201315. Springer (1988)","DOI":"10.1007\/978-1-4612-3774-7_1"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17470-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:28:25Z","timestamp":1676446105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17470-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319174693","9783319174709"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17470-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}