Loading…
An incentive-compatible rational secret sharing scheme using blockchain and smart contract
In the rational cryptographic protocol, the two rational players often fall into the prisoner’s dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that ratio...
Saved in:
Published in: | Science China. Information sciences 2021-10, Vol.64 (10), p.202301, Article 202301 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53 |
---|---|
cites | cdi_FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53 |
container_end_page | |
container_issue | 10 |
container_start_page | 202301 |
container_title | Science China. Information sciences |
container_volume | 64 |
creator | Chen, Zerui Tian, Youliang Peng, Changgen |
description | In the rational cryptographic protocol, the two rational players often fall into the prisoner’s dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that rational participants will fall into the prisoner’s dilemma, resulting in no participants being able to reconstruct the secret correctly. Next, to solve this problem, we propose an incentive-compatible rational secret scheme. Specifically, the game tree with imperfect information is constructed to facilitate our analysis and proof, and the strictly dominated strategies are directly eliminated to simplify the game tree. Further more, we describe the motivation of the verifier. Then, we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly. Finally, we complete the simulation using the smart contract and analyze our entire scheme. In addition, the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium, i.e., the game always follows the rational path. |
doi_str_mv | 10.1007/s11432-019-2858-8 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918568537</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918568537</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53</originalsourceid><addsrcrecordid>eNp1UE1LAzEUDKJgqf0B3gKeo3nJZpMcS_ELCl4UxEvIplm7dZtdk1Tw35ulgiffZd6DmWHeIHQJ9BoolTcJoOKMUNCEKaGIOkEzULUmoEGflr2WFZGcv56jRUo7WoZzyqSaobdlwF1wPuTuyxM37Eebu6b3OBYcgu1x8i76jNPWxi684-S2fu_xIU1H0w_uw21tF7ANG5z2NmbshpCjdfkCnbW2T37xi3P0cnf7vHog66f7x9VyTRwXOhNNK8dEpRqhac2Yso1QshKVEMxJYG2tLdXcNnLDmrbhlaV8A0UgKVgFXvA5ujr6jnH4PPiUzW44xBI9GaZBiVoJLgsLjiwXh5Sib80Yu5L32wA1U4vm2KIpLZqpRaOKhh01aZx-9_HP-X_RDxkWdCQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918568537</pqid></control><display><type>article</type><title>An incentive-compatible rational secret sharing scheme using blockchain and smart contract</title><source>Springer Nature</source><creator>Chen, Zerui ; Tian, Youliang ; Peng, Changgen</creator><creatorcontrib>Chen, Zerui ; Tian, Youliang ; Peng, Changgen</creatorcontrib><description>In the rational cryptographic protocol, the two rational players often fall into the prisoner’s dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that rational participants will fall into the prisoner’s dilemma, resulting in no participants being able to reconstruct the secret correctly. Next, to solve this problem, we propose an incentive-compatible rational secret scheme. Specifically, the game tree with imperfect information is constructed to facilitate our analysis and proof, and the strictly dominated strategies are directly eliminated to simplify the game tree. Further more, we describe the motivation of the verifier. Then, we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly. Finally, we complete the simulation using the smart contract and analyze our entire scheme. In addition, the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium, i.e., the game always follows the rational path.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-019-2858-8</identifier><language>eng</language><publisher>Beijing: Science China Press</publisher><subject>Computer Science ; Cryptography ; Equilibrium ; Game theory ; Games ; Information Systems and Communication Service ; Players ; Prisoners ; Research Paper</subject><ispartof>Science China. Information sciences, 2021-10, Vol.64 (10), p.202301, Article 202301</ispartof><rights>Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2021</rights><rights>Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53</citedby><cites>FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Chen, Zerui</creatorcontrib><creatorcontrib>Tian, Youliang</creatorcontrib><creatorcontrib>Peng, Changgen</creatorcontrib><title>An incentive-compatible rational secret sharing scheme using blockchain and smart contract</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><description>In the rational cryptographic protocol, the two rational players often fall into the prisoner’s dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that rational participants will fall into the prisoner’s dilemma, resulting in no participants being able to reconstruct the secret correctly. Next, to solve this problem, we propose an incentive-compatible rational secret scheme. Specifically, the game tree with imperfect information is constructed to facilitate our analysis and proof, and the strictly dominated strategies are directly eliminated to simplify the game tree. Further more, we describe the motivation of the verifier. Then, we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly. Finally, we complete the simulation using the smart contract and analyze our entire scheme. In addition, the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium, i.e., the game always follows the rational path.</description><subject>Computer Science</subject><subject>Cryptography</subject><subject>Equilibrium</subject><subject>Game theory</subject><subject>Games</subject><subject>Information Systems and Communication Service</subject><subject>Players</subject><subject>Prisoners</subject><subject>Research Paper</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp1UE1LAzEUDKJgqf0B3gKeo3nJZpMcS_ELCl4UxEvIplm7dZtdk1Tw35ulgiffZd6DmWHeIHQJ9BoolTcJoOKMUNCEKaGIOkEzULUmoEGflr2WFZGcv56jRUo7WoZzyqSaobdlwF1wPuTuyxM37Eebu6b3OBYcgu1x8i76jNPWxi684-S2fu_xIU1H0w_uw21tF7ANG5z2NmbshpCjdfkCnbW2T37xi3P0cnf7vHog66f7x9VyTRwXOhNNK8dEpRqhac2Yso1QshKVEMxJYG2tLdXcNnLDmrbhlaV8A0UgKVgFXvA5ujr6jnH4PPiUzW44xBI9GaZBiVoJLgsLjiwXh5Sib80Yu5L32wA1U4vm2KIpLZqpRaOKhh01aZx-9_HP-X_RDxkWdCQ</recordid><startdate>20211001</startdate><enddate>20211001</enddate><creator>Chen, Zerui</creator><creator>Tian, Youliang</creator><creator>Peng, Changgen</creator><general>Science China Press</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20211001</creationdate><title>An incentive-compatible rational secret sharing scheme using blockchain and smart contract</title><author>Chen, Zerui ; Tian, Youliang ; Peng, Changgen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science</topic><topic>Cryptography</topic><topic>Equilibrium</topic><topic>Game theory</topic><topic>Games</topic><topic>Information Systems and Communication Service</topic><topic>Players</topic><topic>Prisoners</topic><topic>Research Paper</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Zerui</creatorcontrib><creatorcontrib>Tian, Youliang</creatorcontrib><creatorcontrib>Peng, Changgen</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Zerui</au><au>Tian, Youliang</au><au>Peng, Changgen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An incentive-compatible rational secret sharing scheme using blockchain and smart contract</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><date>2021-10-01</date><risdate>2021</risdate><volume>64</volume><issue>10</issue><spage>202301</spage><pages>202301-</pages><artnum>202301</artnum><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>In the rational cryptographic protocol, the two rational players often fall into the prisoner’s dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that rational participants will fall into the prisoner’s dilemma, resulting in no participants being able to reconstruct the secret correctly. Next, to solve this problem, we propose an incentive-compatible rational secret scheme. Specifically, the game tree with imperfect information is constructed to facilitate our analysis and proof, and the strictly dominated strategies are directly eliminated to simplify the game tree. Further more, we describe the motivation of the verifier. Then, we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly. Finally, we complete the simulation using the smart contract and analyze our entire scheme. In addition, the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium, i.e., the game always follows the rational path.</abstract><cop>Beijing</cop><pub>Science China Press</pub><doi>10.1007/s11432-019-2858-8</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1674-733X |
ispartof | Science China. Information sciences, 2021-10, Vol.64 (10), p.202301, Article 202301 |
issn | 1674-733X 1869-1919 |
language | eng |
recordid | cdi_proquest_journals_2918568537 |
source | Springer Nature |
subjects | Computer Science Cryptography Equilibrium Game theory Games Information Systems and Communication Service Players Prisoners Research Paper |
title | An incentive-compatible rational secret sharing scheme using blockchain and smart contract |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T10%3A17%3A50IST&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=An%20incentive-compatible%20rational%20secret%20sharing%20scheme%20using%20blockchain%20and%20smart%20contract&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Chen,%20Zerui&rft.date=2021-10-01&rft.volume=64&rft.issue=10&rft.spage=202301&rft.pages=202301-&rft.artnum=202301&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-019-2858-8&rft_dat=%3Cproquest_cross%3E2918568537%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c359t-904c2548b5906228ab587454552c712f69a093ab7d2bfb34a03d1254701a81e53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2918568537&rft_id=info:pmid/&rfr_iscdi=true |