{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:43Z","timestamp":1775794843515,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030920777","type":"print"},{"value":"9783030920784","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92078-4_6","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T20:02:08Z","timestamp":1638302528000},"page":"161-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Bit Security as\u00a0Computational Cost for\u00a0Winning Games with\u00a0High Probability"],"prefix":"10.1007","author":[{"given":"Shun","family":"Watanabe","sequence":"first","affiliation":[]},{"given":"Kenji","family":"Yasunaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple construction of almost $$k$$-wise independent random variables. Random Struct. Algorithms 3(3), 289\u2013304 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48797-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Bai","year":"2015","unstructured":"Bai, S., Langlois, A., Lepoint, T., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 3\u201324. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_1"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-42045-0_17","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Lange, T.: Non-uniform cracks in the concrete: the power of free precomputation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 321\u2013340. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_17"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-49096-9_9","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 209\u2013224. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_9"},{"key":"6_CR5","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2006)","edition":"2"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649\u2013665. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-03356-8_16","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Steinberger, J.: Message authentication codes from unpredictable block ciphers. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 267\u2013285. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_16"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/18.761271","volume":"45","author":"CA Fuchs","year":"1999","unstructured":"Fuchs, C.A., van de Graaf, J.: Cryptographic distinguishability measures for quantum-mechanical states. IEEE Trans. Inf. Theory 45(4), 1216\u20131227 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography - Volume 1: Basic Techniques","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press, Cambridge (2001)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Johnson, D.S. (ed.) Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA, 14\u201317 May 1989, pp. 25\u201332. ACM (1989)","DOI":"10.1145\/73007.73010"},{"issue":"85","key":"6_CR11","first-page":"1","volume":"24","author":"F G\u00f6tze","year":"2019","unstructured":"G\u00f6tze, F., Sambale, H., Sinulis, A.: Higher order concentration for functions of weakly dependent random variables. Electron. J. Probab. 24(85), 1\u201319 (2019)","journal-title":"Electron. J. Probab."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-04268-8_7","volume-title":"Information Theoretic Security","author":"M Iwamoto","year":"2014","unstructured":"Iwamoto, M., Shikata, J.: Information theoretic security for encryption based on conditional R\u00e9nyi entropies. In: Padr\u00f3, C. (ed.) ICITS 2013. LNCS, vol. 8317, pp. 103\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04268-8_7"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1515\/gcc-2013-0008","volume":"5","author":"N Koblitz","year":"2013","unstructured":"Koblitz, N., Menezes, A.: Another look at non-uniformity. Groups Complex. Cryptol. 5(2), 117\u2013139 (2013)","journal-title":"Groups Complex. Cryptol."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-662-53641-4_25","volume-title":"Theory of Cryptography","author":"L Kowalczyk","year":"2016","unstructured":"Kowalczyk, L., Malkin, T., Ullman, J., Zhandry, M.: Strong hardness of privacy from weak traitor tracing. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 659\u2013689. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_25"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-55220-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D., Steinfeld, R.: GGHLite: more efficient multilinear maps from ideal lattices. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 239\u2013256. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_14"},{"issue":"3","key":"6_CR16","first-page":"1102","volume":"58","author":"LA Levin","year":"1993","unstructured":"Levin, L.A.: Randomness and non-determinism. J. Symb. Log. 58(3), 1102\u20131103 (1993)","journal-title":"J. Symb. Log."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-030-17253-4_19","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"T Matsuda","year":"2019","unstructured":"Matsuda, T., Takahashi, K., Murakami, T., Hanaoka, G.: Improved security evaluation techniques for imperfect randomness from arbitrary distributions. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11442, pp. 549\u2013580. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_19"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-63715-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"D Micciancio","year":"2017","unstructured":"Micciancio, D., Walter, M.: Gaussian sampling over the integers: efficient, generic, constant-time. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 455\u2013485. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_16"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78381-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"D Micciancio","year":"2018","unstructured":"Micciancio, D., Walter, M.: On the bit security of cryptographic primitives. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 3\u201328. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_1"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Mironov, I.: R\u00e9nyi differential privacy. In: 30th IEEE Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, 21\u201325 August 2017, pp. 263\u2013275. IEEE Computer Society (2017)","DOI":"10.1109\/CSF.2017.11"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-70694-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T Prest","year":"2017","unstructured":"Prest, T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 347\u2013374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_13"},{"issue":"11","key":"6_CR23","doi-asserted-by":"publisher","first-page":"5973","DOI":"10.1109\/TIT.2016.2603151","volume":"62","author":"I Sason","year":"2016","unstructured":"Sason, I., Verd\u00fa, S.: $$f$$-divergence inequalities. IEEE Trans. Inf. Theory 62(11), 5973\u20136006 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-26059-4_23","volume-title":"Provable Security","author":"K Takashima","year":"2015","unstructured":"Takashima, K., Takayasu, A.: Tighter security for efficient lattice cryptography via the R\u00e9nyi divergence of optimized orders. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 412\u2013431. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26059-4_23"},{"issue":"7","key":"6_CR25","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven, T., Harremo\u00ebs, P.: R\u00e9nyi divergence and Kullback-Leibler divergence. IEEE Trans. Inf. Theory 60(7), 3797\u20133820 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR26","unstructured":"Yasunaga, K.: Replacing probability distributions in security games via Hellinger distance. In: Tessaro, S. (ed.) 2nd Conference on Information-Theoretic Cryptography (ITC 2021), volume 199 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pp. 17:1\u201317:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92078-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:04:16Z","timestamp":1732925056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92078-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920777","9783030920784"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92078-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"341","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.21","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.61","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}