Rational Secret Sharing with Honest Players over an Asynchronous Channel View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2011

AUTHORS

William K. Moses , C. Pandu Rangan

ABSTRACT

We consider the problem of rational secret sharing introduced by Halpern and Teague [5], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several positive results have already been published to efficiently solve the problem of rational secret sharing but only a handful of papers have touched upon the use of an asynchronous broadcast channel. [3] used cryptographic primitives, [11] used an interactive dealer, and [14] used an honest minority of players in order to handle an asynchronous broadcast channel.In our paper, we propose an m-out-of-n rational secret sharing scheme which can function over an asynchronous broadcast channel without the use of cryptographic primitives and with a non-interactive dealer. This is possible because our scheme uses a small number, k + 1, of honest players. The protocol is resilient to coalitions of size up to k and furthermore it is ε-resilient to coalitions of size up to m − 1. The protocol will have a strict Nash equilibrium with probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$Pr(\frac{k+1}{n})$\end{document} and an ε-Nash equilibrium with probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$Pr(\frac{n-k-1}{n})$\end{document}. Furthermore, our protocol is immune to backward induction.Later on in the paper, we extend our results to include malicious players as well.We also show that our protocol handles the possibility of a player deviating in order to force another player to get a wrong value in what we believe to be a more time efficient manner than was done in Asharov and Lindell [2]. More... »

PAGES

414-426

Book

TITLE

Advances in Network Security and Applications

ISBN

978-3-642-22539-0
978-3-642-22540-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-22540-6_40

DOI

http://dx.doi.org/10.1007/978-3-642-22540-6_40

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1033702182


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India", 
          "id": "http://www.grid.ac/institutes/grid.417969.4", 
          "name": [
            "Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Moses", 
        "givenName": "William K.", 
        "id": "sg:person.014242317504.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014242317504.39"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India", 
          "id": "http://www.grid.ac/institutes/grid.417969.4", 
          "name": [
            "Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Pandu Rangan", 
        "givenName": "C.", 
        "id": "sg:person.014536762501.08", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014536762501.08"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2011", 
    "datePublishedReg": "2011-01-01", 
    "description": "We consider the problem of rational secret sharing introduced by Halpern and Teague [5], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several positive results have already been published to efficiently solve the problem of rational secret sharing but only a handful of papers have touched upon the use of an asynchronous broadcast channel. [3] used cryptographic primitives, [11] used an interactive dealer, and [14] used an honest minority of players in order to handle an asynchronous broadcast channel.In our paper, we propose an m-out-of-n rational secret sharing scheme which can function over an asynchronous broadcast channel without the use of cryptographic primitives and with a non-interactive dealer. This is possible because our scheme uses a small number, k\u2009+\u20091, of honest players. The protocol is resilient to coalitions of size up to k and furthermore it is \u03b5-resilient to coalitions of size up to m\u2009\u2212\u20091. The protocol will have a strict Nash equilibrium with probability \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$Pr(\\frac{k+1}{n})$\\end{document} and an \u03b5-Nash equilibrium with probability \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$Pr(\\frac{n-k-1}{n})$\\end{document}. Furthermore, our protocol is immune to backward induction.Later on in the paper, we extend our results to include malicious players as well.We also show that our protocol handles the possibility of a player deviating in order to force another player to get a wrong value in what we believe to be a more time efficient manner than was done in Asharov and Lindell [2].", 
    "editor": [
      {
        "familyName": "Wyld", 
        "givenName": "David C.", 
        "type": "Person"
      }, 
      {
        "familyName": "Wozniak", 
        "givenName": "Michal", 
        "type": "Person"
      }, 
      {
        "familyName": "Chaki", 
        "givenName": "Nabendu", 
        "type": "Person"
      }, 
      {
        "familyName": "Meghanathan", 
        "givenName": "Natarajan", 
        "type": "Person"
      }, 
      {
        "familyName": "Nagamalai", 
        "givenName": "Dhinaharan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-22540-6_40", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-22539-0", 
        "978-3-642-22540-6"
      ], 
      "name": "Advances in Network Security and Applications", 
      "type": "Book"
    }, 
    "keywords": [
      "secret sharing", 
      "cryptographic primitives", 
      "rational secret sharing", 
      "broadcast channel", 
      "rational secret sharing scheme", 
      "honest players", 
      "secret sharing scheme", 
      "coalitions of size", 
      "Nash equilibrium", 
      "sharing scheme", 
      "malicious players", 
      "time efficient manner", 
      "efficient manner", 
      "asynchronous channels", 
      "sharing", 
      "form of preferences", 
      "primitives", 
      "more time efficient manner", 
      "secrets", 
      "scheme", 
      "protocol", 
      "backward induction", 
      "wrong values", 
      "resilient", 
      "Lindell", 
      "players", 
      "channels", 
      "small number", 
      "strict Nash equilibrium", 
      "order", 
      "Asharov", 
      "Halpern", 
      "advantages", 
      "handful of papers", 
      "dealers", 
      "probability", 
      "Teague", 
      "use", 
      "coalition", 
      "preferences", 
      "results", 
      "number", 
      "size", 
      "manner", 
      "play", 
      "handful", 
      "possibility", 
      "form", 
      "positive results", 
      "values", 
      "equilibrium", 
      "less preference", 
      "problem", 
      "minority", 
      "paper", 
      "induction", 
      "secret sharing play", 
      "sharing play", 
      "asynchronous broadcast channel", 
      "interactive dealer", 
      "honest minority", 
      "non-interactive dealer"
    ], 
    "name": "Rational Secret Sharing with Honest Players over an Asynchronous Channel", 
    "pagination": "414-426", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1033702182"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-22540-6_40"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-22540-6_40", 
      "https://app.dimensions.ai/details/publication/pub.1033702182"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T19:57", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_160.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-22540-6_40"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-22540-6_40'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-22540-6_40'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-22540-6_40'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-22540-6_40'


 

This table displays all metadata directly associated to this object as RDF triples.

149 TRIPLES      23 PREDICATES      88 URIs      81 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-22540-6_40 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Nbc862db25c974971bcaa34a279616d11
4 schema:datePublished 2011
5 schema:datePublishedReg 2011-01-01
6 schema:description We consider the problem of rational secret sharing introduced by Halpern and Teague [5], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several positive results have already been published to efficiently solve the problem of rational secret sharing but only a handful of papers have touched upon the use of an asynchronous broadcast channel. [3] used cryptographic primitives, [11] used an interactive dealer, and [14] used an honest minority of players in order to handle an asynchronous broadcast channel.In our paper, we propose an m-out-of-n rational secret sharing scheme which can function over an asynchronous broadcast channel without the use of cryptographic primitives and with a non-interactive dealer. This is possible because our scheme uses a small number, k + 1, of honest players. The protocol is resilient to coalitions of size up to k and furthermore it is ε-resilient to coalitions of size up to m − 1. The protocol will have a strict Nash equilibrium with probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$Pr(\frac{k+1}{n})$\end{document} and an ε-Nash equilibrium with probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$Pr(\frac{n-k-1}{n})$\end{document}. Furthermore, our protocol is immune to backward induction.Later on in the paper, we extend our results to include malicious players as well.We also show that our protocol handles the possibility of a player deviating in order to force another player to get a wrong value in what we believe to be a more time efficient manner than was done in Asharov and Lindell [2].
7 schema:editor Nc0c4f97bfa284dfc8dc23be758b16b11
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N85bf0a63301c4e2bb17387fd71926207
12 schema:keywords Asharov
13 Halpern
14 Lindell
15 Nash equilibrium
16 Teague
17 advantages
18 asynchronous broadcast channel
19 asynchronous channels
20 backward induction
21 broadcast channel
22 channels
23 coalition
24 coalitions of size
25 cryptographic primitives
26 dealers
27 efficient manner
28 equilibrium
29 form
30 form of preferences
31 handful
32 handful of papers
33 honest minority
34 honest players
35 induction
36 interactive dealer
37 less preference
38 malicious players
39 manner
40 minority
41 more time efficient manner
42 non-interactive dealer
43 number
44 order
45 paper
46 play
47 players
48 positive results
49 possibility
50 preferences
51 primitives
52 probability
53 problem
54 protocol
55 rational secret sharing
56 rational secret sharing scheme
57 resilient
58 results
59 scheme
60 secret sharing
61 secret sharing play
62 secret sharing scheme
63 secrets
64 sharing
65 sharing play
66 sharing scheme
67 size
68 small number
69 strict Nash equilibrium
70 time efficient manner
71 use
72 values
73 wrong values
74 schema:name Rational Secret Sharing with Honest Players over an Asynchronous Channel
75 schema:pagination 414-426
76 schema:productId N9aa634899bb0415b8ab359fc2b6b200c
77 Na2c464fda99a4faa9a0431bec1128029
78 schema:publisher Nb22831feb3464e50a9e38a4a719da342
79 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033702182
80 https://doi.org/10.1007/978-3-642-22540-6_40
81 schema:sdDatePublished 2021-12-01T19:57
82 schema:sdLicense https://scigraph.springernature.com/explorer/license/
83 schema:sdPublisher N74263fdb4541449da0543974d3acccf4
84 schema:url https://doi.org/10.1007/978-3-642-22540-6_40
85 sgo:license sg:explorer/license/
86 sgo:sdDataset chapters
87 rdf:type schema:Chapter
88 N1e9c45a5ce934e7596329024fdc8f291 rdf:first N5366f435e5924492b794aadf4a2ce46e
89 rdf:rest Nd2a10030d4d84e5cbef2ad742e4dea23
90 N42f013759f88405599be1880f5cf51b5 schema:familyName Chaki
91 schema:givenName Nabendu
92 rdf:type schema:Person
93 N4772e938907941f78b6365eae3c5ef84 schema:familyName Meghanathan
94 schema:givenName Natarajan
95 rdf:type schema:Person
96 N499d48eef6ac498a9a92cd5ccf30b2ab schema:familyName Nagamalai
97 schema:givenName Dhinaharan
98 rdf:type schema:Person
99 N5366f435e5924492b794aadf4a2ce46e schema:familyName Wozniak
100 schema:givenName Michal
101 rdf:type schema:Person
102 N74263fdb4541449da0543974d3acccf4 schema:name Springer Nature - SN SciGraph project
103 rdf:type schema:Organization
104 N8140a0d6807d4ae59e53eaa90a759d99 schema:familyName Wyld
105 schema:givenName David C.
106 rdf:type schema:Person
107 N85bf0a63301c4e2bb17387fd71926207 schema:isbn 978-3-642-22539-0
108 978-3-642-22540-6
109 schema:name Advances in Network Security and Applications
110 rdf:type schema:Book
111 N9aa634899bb0415b8ab359fc2b6b200c schema:name doi
112 schema:value 10.1007/978-3-642-22540-6_40
113 rdf:type schema:PropertyValue
114 Na2c464fda99a4faa9a0431bec1128029 schema:name dimensions_id
115 schema:value pub.1033702182
116 rdf:type schema:PropertyValue
117 Nb22831feb3464e50a9e38a4a719da342 schema:name Springer Nature
118 rdf:type schema:Organisation
119 Nbc862db25c974971bcaa34a279616d11 rdf:first sg:person.014242317504.39
120 rdf:rest Nf9b110d62b754fefa63ff55764e5ceb2
121 Nc0c4f97bfa284dfc8dc23be758b16b11 rdf:first N8140a0d6807d4ae59e53eaa90a759d99
122 rdf:rest N1e9c45a5ce934e7596329024fdc8f291
123 Nc329fa50ca6441a09a95101200335f1a rdf:first N499d48eef6ac498a9a92cd5ccf30b2ab
124 rdf:rest rdf:nil
125 Nd2a10030d4d84e5cbef2ad742e4dea23 rdf:first N42f013759f88405599be1880f5cf51b5
126 rdf:rest Ndccefc742c1c4679be0e4087aa425ecf
127 Ndccefc742c1c4679be0e4087aa425ecf rdf:first N4772e938907941f78b6365eae3c5ef84
128 rdf:rest Nc329fa50ca6441a09a95101200335f1a
129 Nf9b110d62b754fefa63ff55764e5ceb2 rdf:first sg:person.014536762501.08
130 rdf:rest rdf:nil
131 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
132 schema:name Information and Computing Sciences
133 rdf:type schema:DefinedTerm
134 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
135 schema:name Data Format
136 rdf:type schema:DefinedTerm
137 sg:person.014242317504.39 schema:affiliation grid-institutes:grid.417969.4
138 schema:familyName Moses
139 schema:givenName William K.
140 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014242317504.39
141 rdf:type schema:Person
142 sg:person.014536762501.08 schema:affiliation grid-institutes:grid.417969.4
143 schema:familyName Pandu Rangan
144 schema:givenName C.
145 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014536762501.08
146 rdf:type schema:Person
147 grid-institutes:grid.417969.4 schema:alternateName Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
148 schema:name Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
149 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...