Repeated Games for Generating Randomness in Encryption

Repeated Games for Generating Randomness in Encryption

In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2018/04/01, Vol.E101.A(4), pp.697-703
Hauptverfasser: YASUNAGA, Kenji, YUZAWA, Kosuke
Format: Artikel
Sprache:eng
Schlagworte:
Encryption
Game theory
Randomness
repeated game
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 703
container_issue 4
container_start_page 697
container_title IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
container_volume E101.A
creator YASUNAGA, Kenji
YUZAWA, Kosuke
description In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct an encryption scheme with an optimal round complexity on the basis of the mechanism of repeated games.
doi_str_mv 10.1587/transfun.E101.A.697
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2022113683</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2022113683</sourcerecordid><originalsourceid>FETCH-LOGICAL-c511t-d09d71c3c0adfdb8d22ba2f4d5040630b7e22ab1191f10fd2243e4187adb29ce3</originalsourceid><addsrcrecordid>eNplkE1LAzEQQIMoWKu_wMuC510zSfbrWEqtSkEoeg7ZZFK3tNk1SQ_9925ZLYKnOcx7M_AIuQeaQV6Vj9ErF-zBZQugkM2yoi4vyARKkafAeXlJJrSGIq1yWl2TmxC2lELFQExIscYeVUSTLNUeQ2I7nyzRoVexdZtkrZzp9g5DSFqXLJz2xz62nbslV1btAt79zCn5eFq8z5_T1dvyZT5bpToHiKmhtSlBc02VsaapDGONYlaYnApacNqUyJhqAGqwQO2wFhwFVKUyDas18il5GO_2vvs6YIhy2x28G15KRhkD4EXFB4qPlPZdCB6t7H27V_4ogcpTIPkbSJ4CyZkcAg3W62htQ1QbPDvKx1bv8J8j_shnSH8qL9HxbwWqdkg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2022113683</pqid></control><display><type>article</type><title>Repeated Games for Generating Randomness in Encryption</title><source>J-STAGE Free</source><creator>YASUNAGA, Kenji ; YUZAWA, Kosuke</creator><creatorcontrib>YASUNAGA, Kenji ; YUZAWA, Kosuke</creatorcontrib><description>In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct an encryption scheme with an optimal round complexity on the basis of the mechanism of repeated games.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.E101.A.697</identifier><language>eng</language><publisher>Tokyo: The Institute of Electronics, Information and Communication Engineers</publisher><subject>Encryption ; Game theory ; Randomness ; repeated game</subject><ispartof>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018/04/01, Vol.E101.A(4), pp.697-703</ispartof><rights>2018 The Institute of Electronics, Information and Communication Engineers</rights><rights>Copyright Japan Science and Technology Agency 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c511t-d09d71c3c0adfdb8d22ba2f4d5040630b7e22ab1191f10fd2243e4187adb29ce3</citedby><cites>FETCH-LOGICAL-c511t-d09d71c3c0adfdb8d22ba2f4d5040630b7e22ab1191f10fd2243e4187adb29ce3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,27901,27902</link.rule.ids></links><search><creatorcontrib>YASUNAGA, Kenji</creatorcontrib><creatorcontrib>YUZAWA, Kosuke</creatorcontrib><title>Repeated Games for Generating Randomness in Encryption</title><title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</title><addtitle>IEICE Trans. Fundamentals</addtitle><description>In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct an encryption scheme with an optimal round complexity on the basis of the mechanism of repeated games.</description><subject>Encryption</subject><subject>Game theory</subject><subject>Randomness</subject><subject>repeated game</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNplkE1LAzEQQIMoWKu_wMuC510zSfbrWEqtSkEoeg7ZZFK3tNk1SQ_9925ZLYKnOcx7M_AIuQeaQV6Vj9ErF-zBZQugkM2yoi4vyARKkafAeXlJJrSGIq1yWl2TmxC2lELFQExIscYeVUSTLNUeQ2I7nyzRoVexdZtkrZzp9g5DSFqXLJz2xz62nbslV1btAt79zCn5eFq8z5_T1dvyZT5bpToHiKmhtSlBc02VsaapDGONYlaYnApacNqUyJhqAGqwQO2wFhwFVKUyDas18il5GO_2vvs6YIhy2x28G15KRhkD4EXFB4qPlPZdCB6t7H27V_4ogcpTIPkbSJ4CyZkcAg3W62htQ1QbPDvKx1bv8J8j_shnSH8qL9HxbwWqdkg</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>YASUNAGA, Kenji</creator><creator>YUZAWA, Kosuke</creator><general>The Institute of Electronics, Information and Communication Engineers</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20180101</creationdate><title>Repeated Games for Generating Randomness in Encryption</title><author>YASUNAGA, Kenji ; YUZAWA, Kosuke</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c511t-d09d71c3c0adfdb8d22ba2f4d5040630b7e22ab1191f10fd2243e4187adb29ce3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Encryption</topic><topic>Game theory</topic><topic>Randomness</topic><topic>repeated game</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>YASUNAGA, Kenji</creatorcontrib><creatorcontrib>YUZAWA, Kosuke</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YASUNAGA, Kenji</au><au>YUZAWA, Kosuke</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Repeated Games for Generating Randomness in Encryption</atitle><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle><addtitle>IEICE Trans. Fundamentals</addtitle><date>2018-01-01</date><risdate>2018</risdate><volume>E101.A</volume><issue>4</issue><spage>697</spage><epage>703</epage><pages>697-703</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><abstract>In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct an encryption scheme with an optimal round complexity on the basis of the mechanism of repeated games.</abstract><cop>Tokyo</cop><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transfun.E101.A.697</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0916-8508
ispartof IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018/04/01, Vol.E101.A(4), pp.697-703
issn 0916-8508
1745-1337
language eng
recordid cdi_proquest_journals_2022113683
source J-STAGE Free
subjects Encryption
Game theory
Randomness
repeated game
title Repeated Games for Generating Randomness in Encryption
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T07%3A21%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Repeated%20Games%20for%20Generating%20Randomness%20in%20Encryption&rft.jtitle=IEICE%20Transactions%20on%20Fundamentals%20of%20Electronics,%20Communications%20and%20Computer%20Sciences&rft.au=YASUNAGA,%20Kenji&rft.date=2018-01-01&rft.volume=E101.A&rft.issue=4&rft.spage=697&rft.epage=703&rft.pages=697-703&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.E101.A.697&rft_dat=%3Cproquest_cross%3E2022113683%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2022113683&rft_id=info:pmid/&rfr_iscdi=true