{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:19:19Z","timestamp":1709831959217},"reference-count":40,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transfun.e101.a.697","type":"journal-article","created":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T18:30:25Z","timestamp":1522521025000},"page":"697-703","source":"Crossref","is-referenced-by-count":3,"title":["Repeated Games for Generating Randomness in Encryption"],"prefix":"10.1587","volume":"E101.A","author":[{"given":"Kenji","family":"YASUNAGA","sequence":"first","affiliation":[{"name":"Institute of Science and Engineering, Kanazawa University"}]},{"given":"Kosuke","family":"YUZAWA","sequence":"additional","affiliation":[{"name":"Kanazawa University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] P.Q. Nguyen and I.E. Shparlinski, \u201cThe insecurity of the digital signature algorithm with partially known nonces,\u201d J. Cryptology, vol.15, no.3, pp.151-176, 2002. 10.1007\/s00145-002-0021-3","DOI":"10.1007\/s00145-002-0021-3"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Z. Gutterman and D. Malkhi, \u201cHold your sessions: An attack on java session-id generation,\u201d Topics in Cryptology-CT-RSA 2005, A. Menezes, ed., Lecture Notes in Computer Science, vol.3376, pp.44-57, Springer, 2005. 10.1007\/978-3-540-30574-3_5","DOI":"10.1007\/978-3-540-30574-3_5"},{"key":"3","unstructured":"[3] D.R.L. Brown, \u201cA weak-randomizer attack on RSA-OAEP with e =3,\u201d IACR Cryptology ePrint Archive, vol.2005, p.189, 2005."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Z. Gutterman, B. Pinkas, and T. Reinman, \u201cAnalysis of the Linux random number generator,\u201d 2006 IEEE Symposium on Security and Privacy (S&P 2006), pp.371-385, IEEE Computer Society, 2006. 10.1109\/sp.2006.5","DOI":"10.1109\/SP.2006.5"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] L. Dorrendorf, Z. Gutterman, and B. Pinkas, \u201cCryptanalysis of the windows random number generator,\u201d Proc. 2007 ACM Conference on Computer and Communications Security, CCS 2007, P. Ning, S.D.C. di Vimercati, and P.F. Syverson, eds., pp.476-485, ACM, 2007. 10.1145\/1315245.1315304","DOI":"10.1145\/1315245.1315304"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Yilek, E. Rescorla, H. Shacham, B. Enright, and S. Savage, \u201cWhen private keys are public: Results from the 2008 debian openssl vulnerability,\u201d Proc. 9th ACM SIGCOMM Internet Measurement Conference, IMC 2009, A. Feldmann and L. Mathy, eds., pp.15-27, ACM, 2009. 10.1145\/1644893.1644896","DOI":"10.1145\/1644893.1644896"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A.K. Lenstra, J.P. Hughes, M. Augier, J.W. Bos, T. Kleinjung, and C. Wachter, \u201cPublic keys,\u201d Advances in Cryptology-CRYPTO 2012-32nd Annual Cryptology Conference, R. Safavi-Naini and R. Canetti, eds., Lecture Notes in Computer Science, vol.7417, pp.626-642, Springer, 2012. 10.1007\/978-3-642-32009-5_37","DOI":"10.1007\/978-3-642-32009-5_37"},{"key":"8","unstructured":"[8] N. Heninger, Z. Durumeric, E. Wustrow, and J.A. Halderman, \u201cMining your Ps and Qs: Detection of widespread weak keys in network devices,\u201d Proc. 21th USENIX Security Symposium, T. Kohno, ed., pp.205-220, USENIX Association, 2012."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] K. Yasunaga, \u201cPublic-key encryption with lazy parties,\u201d IEICE Trans. Fundamentals, vol.99-A, no.2, pp.590-600, Feb. 2016. 10.1587\/transfun.e99.a.590","DOI":"10.1587\/transfun.E99.A.590"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J.Y. Halpern and V. Teague, \u201cRational secret sharing and multiparty computation: Extended abstract,\u201d Proc. 36th Annual ACM Symposium on Theory of Computing, L. Babai, ed., pp.623-632, ACM, 2004. 10.1145\/1007352.1007447","DOI":"10.1145\/1007352.1007447"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] I. Abraham, D. Dolev, R. Gonen, and J.Y. Halpern, \u201cDistributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation,\u201d Proc. Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, E. Ruppert and D. Malkhi, eds., pp.53-62, ACM, 2006. 10.1145\/1146381.1146393","DOI":"10.1145\/1146381.1146393"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Lysyanskaya and N. Triandopoulos, \u201cRationality and adversarial behavior in multi-party computation,\u201d Advances in Cryptology-CRYPTO 2006, 26th Annual International Cryptology Conference, C. Dwork, ed., Lecture Notes in Computer Science, vol.4117, pp.180-197, Springer, 2006. 10.1007\/11818175_11","DOI":"10.1007\/11818175_11"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] S.D. Gordon and J. Katz, \u201cRational secret sharing, revisited,\u201d Security and Cryptography for Networks, 5th International Conference, SCN 2006, R.D. Prisco and M. Yung, eds., Lecture Notes in Computer Science, vol.4116, pp.229-241, Springer, 2006. 10.1007\/11832072_16","DOI":"10.1007\/11832072_16"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] G. Kol and M. Naor, \u201cCryptography and game theory: Designing protocols for exchanging information,\u201d Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, R. Canetti, ed., Lecture Notes in Computer Science, vol.4948, pp.320-339, Springer, 2008. 10.1007\/978-3-540-78524-8_18","DOI":"10.1007\/978-3-540-78524-8_18"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] G. Kol and M. Naor, \u201cGames for exchanging information,\u201d Proc. 40th Annual ACM Symposium on Theory of Computing, C. Dwork, ed., pp.423-432, ACM, 2008. 10.1145\/1374376.1374437","DOI":"10.1145\/1374376.1374437"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S.J. Ong, D.C. Parkes, A. Rosen, and S.P. Vadhan, \u201cFairness with an honest minority and a rational majority,\u201d Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, O. Reingold, ed., Lecture Notes in Computer Science, vol.5444, pp.36-53, Springer, 2009. 10.1007\/978-3-642-00457-5_3","DOI":"10.1007\/978-3-642-00457-5_3"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] G. Fuchsbauer, J. Katz, and D. Naccache, \u201cEfficient rational secret sharing in standard communication networks,\u201d in Micciancio [39], pp.419-436. 10.1007\/978-3-642-11799-2_25","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] G. Asharov and Y. Lindell, \u201cUtility dependence in correct and fair rational secret sharing,\u201d J. Cryptology, vol.24, no.1, pp.157-202, 2011. 10.1007\/s00145-010-9064-z","DOI":"10.1007\/s00145-010-9064-z"},{"key":"19","unstructured":"[19] A. Kawachi, Y. Okamoto, K. Tanaka, and K. Yasunaga, \u201cGeneral constructions of rational secret sharing with expected constant-round reconstruction,\u201d Comput. J., vol.60, no.5, pp.711-728, 2017. 10.1093\/comjnl\/bxw094"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] G. Asharov, R. Canetti, and C. Hazay, \u201cToward a game theoretic view of secure computation,\u201d J. Cryptology, vol.29, no.4, pp.879-926, 2016. 10.1007\/s00145-015-9212-6","DOI":"10.1007\/s00145-015-9212-6"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] A. Groce and J. Katz, \u201cFair computation with rational players,\u201d Advances in Cryptology-EUROCRYPT 2012-31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, D. Pointcheval and T. Johansson, eds., Lecture Notes in Computer Science, vol.7237, pp.81-98, Springer, 2012. 10.1007\/978-3-642-29011-4_7","DOI":"10.1007\/978-3-642-29011-4_7"},{"key":"22","unstructured":"[22] H. Higo, K. Tanaka, A. Yamada, and K. Yasunaga, \u201cGame-theoretic security for two-party protocols,\u201d IACR Cryptology ePrint Archive, vol.2016, p.1072, 2016."},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] R. Gradwohl, \u201cRationality in the full-information model,\u201d in Micciancio [39], pp.401-418. 10.1007\/978-3-642-11799-2_24","DOI":"10.1007\/978-3-642-11799-2_24"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] I. Abraham, D. Dolev, and J.Y. Halpern, \u201cDistributed protocols for leader election: A game-theoretic perspective,\u201d Distributed Computing-27th International Symposium, DISC 2013, Y. Afek, ed., Lecture Notes in Computer Science, vol.8205, pp.61-75, Springer, 2013. 10.1007\/978-3-642-41527-2_5","DOI":"10.1007\/978-3-642-41527-2_5"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] A. Groce, J. Katz, A. Thiruvengadam, and V. Zikas, \u201cByzantine agreement with a rational adversary,\u201d Automata, Languages, and Programming-39th International Colloquium, ICALP 2012, A. Czumaj, K. Mehlhorn, A.M. Pitts, and R. Wattenhofer, eds., Lecture Notes in Computer Science, vol.7392, pp.561-572, Springer, 2012. 10.1007\/978-3-642-31585-5_50","DOI":"10.1007\/978-3-642-31585-5_50"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] P.D. Azar and S. Micali, \u201cSuper-efficient rational proofs,\u201d ACM Conference on Electronic Commerce, EC'13, M. Kearns, R.P. McAfee, and \u00c9. Tardos, eds., pp.29-30, ACM, 2013. 10.1145\/2492002.2482561","DOI":"10.1145\/2492002.2482561"},{"key":"27","unstructured":"[27] S. Guo, P. Hub\u00e1cek, A. Rosen, and M. Vald, \u201cRational arguments: Single round delegation with sublinear verification,\u201d in Naor [40], pp.523-540. 10.1145\/2554797.2554845"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] M. Campanelli and R. Gennaro, \u201cSequentially composable rational proofs,\u201d Decision and Game Theory for Security-6th International Conference, GameSec 2015, M.H.R. Khouzani, E.A. Panaousis, and G. Theodorakopoulos, eds., Lecture Notes in Computer Science, vol.9406, pp.270-288, Springer, 2015. 10.1007\/978-3-319-25594-1_15","DOI":"10.1007\/978-3-319-25594-1_15"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] S. Guo, P. Hub\u00e1cek, A. Rosen, and M. Vald, \u201cRational sumchecks,\u201d Theory of Cryptography-13th International Conference, TCC 2016-A, E. Kushilevitz and T. Malkin, eds., Lecture Notes in Computer Science, vol.9563, pp.319-351, Springer, 2016. 10.1007\/978-3-662-49099-0_12","DOI":"10.1007\/978-3-662-49099-0_12"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] K. Inasawa and K. Yasunaga, \u201cRational proofs against rational verifiers,\u201d IEICE Trans. Fundamentals, vol.100-A, no.11, pp.2392-2397, Nov. 2017. 10.1587\/transfun.e100.a.2392","DOI":"10.1587\/transfun.E100.A.2392"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] J.A. Garay, J. Katz, U. Maurer, B. Tackmann, and V. Zikas, \u201cRational protocol design: Cryptography against incentive-driven adversaries,\u201d 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pp.648-657, IEEE Computer Society, 2013. 10.1109\/focs.2013.75","DOI":"10.1109\/FOCS.2013.75"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] J.A. Garay, J. Katz, B. Tackmann, and V. Zikas, \u201cHow fair is your protocol?: A utility-based approach to protocol optimality,\u201d Proc. 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, C. Georgiou and P.G. Spirakis, eds., pp.281-290, ACM, 2015. 10.1145\/2767386.2767431","DOI":"10.1145\/2767386.2767431"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] S. Maleka, A. Shareef, and C.P. Rangan, \u201cRational secret sharing with repeated games,\u201d Information Security Practice and Experience, 4th International Conference, ISPEC 2008, L. Chen, Y. Mu, and W. Susilo, eds., Lecture Notes in Computer Science, vol.4991, pp.334-346, Springer, 2008. 10.1007\/978-3-540-79104-1_24","DOI":"10.1007\/978-3-540-79104-1_24"},{"key":"34","doi-asserted-by":"publisher","unstructured":"[34] J.Y. Halpern and R. Pass, \u201cAlgorithmic rationality: Game theory with costly computation,\u201d J. Economic Theory, vol.156, pp.246-268, 2015. 10.1016\/j.jet.2014.04.007","DOI":"10.1016\/j.jet.2014.04.007"},{"key":"35","unstructured":"[35] J.Y. Halpern, R. Pass, and L. Seeman, \u201cThe truth behind the myth of the folk theorem,\u201d in Naor [40], pp.543-554. 10.1145\/2554797.2554847"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] J.Y. Halpern, R. Pass, and L. Seeman, \u201cNot just an empty threat: Subgame-perfect equilibrium in repeated games played by computationally bounded players,\u201d Web and Internet Economics-10th International Conference, WINE 2014, T. Liu, Q. Qi, and Y. Ye, eds., Lecture Notes in Computer Science, vol.8877, pp.249-262, Springer, 2014. 10.1007\/978-3-319-13129-0_20","DOI":"10.1007\/978-3-319-13129-0_20"},{"key":"37","doi-asserted-by":"publisher","unstructured":"[37] R. Halprin and M. Naor, \u201cGames for extracting randomness,\u201d ACM Crossroads, vol.17, no.2, pp.44-48, 2010. 10.1145\/1869086.1869101","DOI":"10.1145\/1869086.1869101"},{"key":"38","doi-asserted-by":"publisher","unstructured":"[38] M. Bellare, \u201cA note on negligible functions,\u201d J. Cryptology, vol.15, no.4, pp.271-284, 2002. 10.1007\/s00145-002-0116-x","DOI":"10.1007\/s00145-002-0116-x"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] D. Micciancio, ed., \u201cTheory of cryptography,\u201d 7th Theory of Cryptography Conference, TCC 2010, Lecture Notes in Computer Science, vol.5978, Springer, 2010. 10.1007\/978-3-642-11799-2","DOI":"10.1007\/978-3-642-11799-2"},{"key":"40","unstructured":"[40] M. Naor, ed., Innovations in Theoretical Computer Science, ITCS'14, ACM, 2014."}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E101.A\/4\/E101.A_697\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T17:39:08Z","timestamp":1570988348000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E101.A\/4\/E101.A_697\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.e101.a.697","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}