Economically Viable Randomness

We study the problem of providing blockchain applications with \emph{economically viable randomness} (EVR), namely, randomness that has significant economic consequences. Applications of EVR include blockchain-based lotteries and gambling. An EVR source guarantees (i) secrecy, assuring that the rand...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yakira, David, Asayag, Avi, Grayevsky, Ido, Keidar, Idit
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Yakira, David
Asayag, Avi
Grayevsky, Ido
Keidar, Idit
description We study the problem of providing blockchain applications with \emph{economically viable randomness} (EVR), namely, randomness that has significant economic consequences. Applications of EVR include blockchain-based lotteries and gambling. An EVR source guarantees (i) secrecy, assuring that the random bits are kept secret until some predefined condition indicates that they are safe to reveal (e.g., the lottery's ticket sale closes), and (ii) robustness, guaranteeing that the random bits are published once the condition holds. We formalize the EVR problem and solve it on top of an Ethereum-like blockchain abstraction, which supports smart contracts and a transferable native coin. Randomness is generated via a distributed open commit-reveal scheme by game-theoretic agents who strive to maximize their coin holdings. Note that in an economic setting, such agents might profit from breaking secrecy or robustness, and may engage in side agreements (via smart contracts) to this end. Our solution creates an incentive structure that counters such attacks. We prove that following the protocol gives rise to a stable state, called Coalition-Proof Nash Equilibrium, from which no coalition comprised of a subset of the players can agree to deviate. In this stable state, robustness and secrecy are satisfied. Finally, we implement our EVR source over Ethereum.
doi_str_mv 10.48550/arxiv.2007.03531
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2007_03531</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2007_03531</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-395aabbfcdd3f036a7befad3ba6118613b913612184b1592e0d3568751c688c43</originalsourceid><addsrcrecordid>eNotzssKgkAUgOHZtAjrAdqUL6DN8TjjuAyxCwRBSFs5cxEEL6EQ-faRtfp3Px9jG-BhrITgexre9SuMOE9CjgJhyba56bu-rQ01zeQ_atKN8-_U2b7t3Diu2KKiZnTrfz1WHPMiOwfX2-mSHa4ByQQCTAWR1pWxFiuOkhLtKrKoSQIoCahTQAkRqFiDSCPHLQqpEgFGKmVi9Njut52B5XOoWxqm8gstZyh-AC9LNt4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Economically Viable Randomness</title><source>arXiv.org</source><creator>Yakira, David ; Asayag, Avi ; Grayevsky, Ido ; Keidar, Idit</creator><creatorcontrib>Yakira, David ; Asayag, Avi ; Grayevsky, Ido ; Keidar, Idit</creatorcontrib><description>We study the problem of providing blockchain applications with \emph{economically viable randomness} (EVR), namely, randomness that has significant economic consequences. Applications of EVR include blockchain-based lotteries and gambling. An EVR source guarantees (i) secrecy, assuring that the random bits are kept secret until some predefined condition indicates that they are safe to reveal (e.g., the lottery's ticket sale closes), and (ii) robustness, guaranteeing that the random bits are published once the condition holds. We formalize the EVR problem and solve it on top of an Ethereum-like blockchain abstraction, which supports smart contracts and a transferable native coin. Randomness is generated via a distributed open commit-reveal scheme by game-theoretic agents who strive to maximize their coin holdings. Note that in an economic setting, such agents might profit from breaking secrecy or robustness, and may engage in side agreements (via smart contracts) to this end. Our solution creates an incentive structure that counters such attacks. We prove that following the protocol gives rise to a stable state, called Coalition-Proof Nash Equilibrium, from which no coalition comprised of a subset of the players can agree to deviate. In this stable state, robustness and secrecy are satisfied. Finally, we implement our EVR source over Ethereum.</description><identifier>DOI: 10.48550/arxiv.2007.03531</identifier><language>eng</language><subject>Computer Science - Computer Science and Game Theory ; Computer Science - Cryptography and Security</subject><creationdate>2020-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2007.03531$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2007.03531$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yakira, David</creatorcontrib><creatorcontrib>Asayag, Avi</creatorcontrib><creatorcontrib>Grayevsky, Ido</creatorcontrib><creatorcontrib>Keidar, Idit</creatorcontrib><title>Economically Viable Randomness</title><description>We study the problem of providing blockchain applications with \emph{economically viable randomness} (EVR), namely, randomness that has significant economic consequences. Applications of EVR include blockchain-based lotteries and gambling. An EVR source guarantees (i) secrecy, assuring that the random bits are kept secret until some predefined condition indicates that they are safe to reveal (e.g., the lottery's ticket sale closes), and (ii) robustness, guaranteeing that the random bits are published once the condition holds. We formalize the EVR problem and solve it on top of an Ethereum-like blockchain abstraction, which supports smart contracts and a transferable native coin. Randomness is generated via a distributed open commit-reveal scheme by game-theoretic agents who strive to maximize their coin holdings. Note that in an economic setting, such agents might profit from breaking secrecy or robustness, and may engage in side agreements (via smart contracts) to this end. Our solution creates an incentive structure that counters such attacks. We prove that following the protocol gives rise to a stable state, called Coalition-Proof Nash Equilibrium, from which no coalition comprised of a subset of the players can agree to deviate. In this stable state, robustness and secrecy are satisfied. Finally, we implement our EVR source over Ethereum.</description><subject>Computer Science - Computer Science and Game Theory</subject><subject>Computer Science - Cryptography and Security</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzssKgkAUgOHZtAjrAdqUL6DN8TjjuAyxCwRBSFs5cxEEL6EQ-faRtfp3Px9jG-BhrITgexre9SuMOE9CjgJhyba56bu-rQ01zeQ_atKN8-_U2b7t3Diu2KKiZnTrfz1WHPMiOwfX2-mSHa4ByQQCTAWR1pWxFiuOkhLtKrKoSQIoCahTQAkRqFiDSCPHLQqpEgFGKmVi9Njut52B5XOoWxqm8gstZyh-AC9LNt4</recordid><startdate>20200707</startdate><enddate>20200707</enddate><creator>Yakira, David</creator><creator>Asayag, Avi</creator><creator>Grayevsky, Ido</creator><creator>Keidar, Idit</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200707</creationdate><title>Economically Viable Randomness</title><author>Yakira, David ; Asayag, Avi ; Grayevsky, Ido ; Keidar, Idit</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-395aabbfcdd3f036a7befad3ba6118613b913612184b1592e0d3568751c688c43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Computer Science and Game Theory</topic><topic>Computer Science - Cryptography and Security</topic><toplevel>online_resources</toplevel><creatorcontrib>Yakira, David</creatorcontrib><creatorcontrib>Asayag, Avi</creatorcontrib><creatorcontrib>Grayevsky, Ido</creatorcontrib><creatorcontrib>Keidar, Idit</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yakira, David</au><au>Asayag, Avi</au><au>Grayevsky, Ido</au><au>Keidar, Idit</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Economically Viable Randomness</atitle><date>2020-07-07</date><risdate>2020</risdate><abstract>We study the problem of providing blockchain applications with \emph{economically viable randomness} (EVR), namely, randomness that has significant economic consequences. Applications of EVR include blockchain-based lotteries and gambling. An EVR source guarantees (i) secrecy, assuring that the random bits are kept secret until some predefined condition indicates that they are safe to reveal (e.g., the lottery's ticket sale closes), and (ii) robustness, guaranteeing that the random bits are published once the condition holds. We formalize the EVR problem and solve it on top of an Ethereum-like blockchain abstraction, which supports smart contracts and a transferable native coin. Randomness is generated via a distributed open commit-reveal scheme by game-theoretic agents who strive to maximize their coin holdings. Note that in an economic setting, such agents might profit from breaking secrecy or robustness, and may engage in side agreements (via smart contracts) to this end. Our solution creates an incentive structure that counters such attacks. We prove that following the protocol gives rise to a stable state, called Coalition-Proof Nash Equilibrium, from which no coalition comprised of a subset of the players can agree to deviate. In this stable state, robustness and secrecy are satisfied. Finally, we implement our EVR source over Ethereum.</abstract><doi>10.48550/arxiv.2007.03531</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2007.03531
ispartof
issn
language eng
recordid cdi_arxiv_primary_2007_03531
source arXiv.org
subjects Computer Science - Computer Science and Game Theory
Computer Science - Cryptography and Security
title Economically Viable Randomness
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T00%3A58%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Economically%20Viable%20Randomness&rft.au=Yakira,%20David&rft.date=2020-07-07&rft_id=info:doi/10.48550/arxiv.2007.03531&rft_dat=%3Carxiv_GOX%3E2007_03531%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true