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 and an ε-Nash equilibrium with probability . 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

References to SciGraph publications

  • 2009. Fairness with an Honest Minority and a Rational Majority in THEORY OF CRYPTOGRAPHY
  • 2009. Purely Rational Secret Sharing (Extended Abstract) in THEORY OF CRYPTOGRAPHY
  • 2006. Rationality and Adversarial Behavior in Multi-party Computation in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2009. Utility Dependence in Correct and Fair Rational Secret Sharing in ADVANCES IN CRYPTOLOGY - CRYPTO 2009
  • 2008. Cryptography and Game Theory: Designing Protocols for Exchanging Information in THEORY OF CRYPTOGRAPHY
  • 2010. Efficient Rational Secret Sharing in Standard Communication Networks in THEORY OF CRYPTOGRAPHY
  • 2008. Rational Secret Sharing with Repeated Games in INFORMATION SECURITY PRACTICE AND EXPERIENCE
  • 2006. Rational Secret Sharing, Revisited in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 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/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }, 
          {
            "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"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Indian Institute of Technology Madras", 
              "id": "https://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": "Indian Institute of Technology Madras", 
              "id": "https://www.grid.ac/institutes/grid.417969.4", 
              "name": [
                "Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Rangan", 
            "givenName": "C. Pandu", 
            "id": "sg:person.016366027737.61", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016366027737.61"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-642-11799-2_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002446205", 
              "https://doi.org/10.1007/978-3-642-11799-2_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-11799-2_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002446205", 
              "https://doi.org/10.1007/978-3-642-11799-2_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1007352.1007447", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018093655"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-00457-5_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018815288", 
              "https://doi.org/10.1007/978-3-642-00457-5_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-00457-5_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018815288", 
              "https://doi.org/10.1007/978-3-642-00457-5_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11832072_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024857952", 
              "https://doi.org/10.1007/11832072_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11832072_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024857952", 
              "https://doi.org/10.1007/11832072_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1374376.1374437", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025129770"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11818175_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026158367", 
              "https://doi.org/10.1007/11818175_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11818175_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026158367", 
              "https://doi.org/10.1007/11818175_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/359168.359176", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036015253"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-79104-1_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036295121", 
              "https://doi.org/10.1007/978-3-540-79104-1_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-79104-1_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036295121", 
              "https://doi.org/10.1007/978-3-540-79104-1_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78524-8_18", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036428940", 
              "https://doi.org/10.1007/978-3-540-78524-8_18"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78524-8_18", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036428940", 
              "https://doi.org/10.1007/978-3-540-78524-8_18"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1146381.1146393", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037494350"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03356-8_33", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047214508", 
              "https://doi.org/10.1007/978-3-642-03356-8_33"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-00457-5_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052871019", 
              "https://doi.org/10.1007/978-3-642-00457-5_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-00457-5_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052871019", 
              "https://doi.org/10.1007/978-3-642-00457-5_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/ipdps.2008.4536558", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093424397"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "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 + 1, 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 \u2212 1. The protocol will have a strict Nash equilibrium with probability and an \u03b5-Nash equilibrium with probability . 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"
        }, 
        "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"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "a08bf1588daa192eff7e576c4910e83cdcfe1ecdc8c1e0b8246355b378b8f735"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "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": "2019-04-16T08:57", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000369_0000000369/records_68969_00000000.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-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.

    139 TRIPLES      23 PREDICATES      40 URIs      20 LITERALS      8 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 N7c863707c5554452ac6d6ad25ce2577d
    4 schema:citation sg:pub.10.1007/11818175_11
    5 sg:pub.10.1007/11832072_16
    6 sg:pub.10.1007/978-3-540-78524-8_18
    7 sg:pub.10.1007/978-3-540-79104-1_24
    8 sg:pub.10.1007/978-3-642-00457-5_3
    9 sg:pub.10.1007/978-3-642-00457-5_4
    10 sg:pub.10.1007/978-3-642-03356-8_33
    11 sg:pub.10.1007/978-3-642-11799-2_25
    12 https://doi.org/10.1109/ipdps.2008.4536558
    13 https://doi.org/10.1145/1007352.1007447
    14 https://doi.org/10.1145/1146381.1146393
    15 https://doi.org/10.1145/1374376.1374437
    16 https://doi.org/10.1145/359168.359176
    17 schema:datePublished 2011
    18 schema:datePublishedReg 2011-01-01
    19 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 and an ε-Nash equilibrium with probability . 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].
    20 schema:editor Nb9feb5225ac44b4ebc37344d42258bce
    21 schema:genre chapter
    22 schema:inLanguage en
    23 schema:isAccessibleForFree true
    24 schema:isPartOf N366ac8ec91e24e87bc495bd408898d08
    25 schema:name Rational Secret Sharing with Honest Players over an Asynchronous Channel
    26 schema:pagination 414-426
    27 schema:productId N540d2dff668b49409caa60032462eb3a
    28 N6e8004c125934098871c05000e67bd28
    29 Nb5066c72f728460885e0297e46c3ab2d
    30 schema:publisher N080bef309306480b82dd529c92a3838b
    31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033702182
    32 https://doi.org/10.1007/978-3-642-22540-6_40
    33 schema:sdDatePublished 2019-04-16T08:57
    34 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    35 schema:sdPublisher N970dbec02ec741f3a58f42cc78f05bdb
    36 schema:url https://link.springer.com/10.1007%2F978-3-642-22540-6_40
    37 sgo:license sg:explorer/license/
    38 sgo:sdDataset chapters
    39 rdf:type schema:Chapter
    40 N015def06430c4ab8989a24b91cdcb651 schema:familyName Chaki
    41 schema:givenName Nabendu
    42 rdf:type schema:Person
    43 N028555e442de42a0a41b8485d2c054d0 rdf:first sg:person.016366027737.61
    44 rdf:rest rdf:nil
    45 N080bef309306480b82dd529c92a3838b schema:location Berlin, Heidelberg
    46 schema:name Springer Berlin Heidelberg
    47 rdf:type schema:Organisation
    48 N17729f36b4204c53b838e7a947dc35ff schema:familyName Wozniak
    49 schema:givenName Michal
    50 rdf:type schema:Person
    51 N366ac8ec91e24e87bc495bd408898d08 schema:isbn 978-3-642-22539-0
    52 978-3-642-22540-6
    53 schema:name Advances in Network Security and Applications
    54 rdf:type schema:Book
    55 N46faa03c0d9440139912ec3fea50f7f6 rdf:first Ncd07f71fad1c4c359fc1e364bb385017
    56 rdf:rest rdf:nil
    57 N540d2dff668b49409caa60032462eb3a schema:name readcube_id
    58 schema:value a08bf1588daa192eff7e576c4910e83cdcfe1ecdc8c1e0b8246355b378b8f735
    59 rdf:type schema:PropertyValue
    60 N660a348d774d4e35ac5463a6bbab3ca5 schema:familyName Meghanathan
    61 schema:givenName Natarajan
    62 rdf:type schema:Person
    63 N6e8004c125934098871c05000e67bd28 schema:name doi
    64 schema:value 10.1007/978-3-642-22540-6_40
    65 rdf:type schema:PropertyValue
    66 N75e2a53945734a40a084b65dad7adc62 schema:familyName Wyld
    67 schema:givenName David C.
    68 rdf:type schema:Person
    69 N7c863707c5554452ac6d6ad25ce2577d rdf:first sg:person.014242317504.39
    70 rdf:rest N028555e442de42a0a41b8485d2c054d0
    71 N81c8bdc755d44847a11d59b2eb5bde2c rdf:first N17729f36b4204c53b838e7a947dc35ff
    72 rdf:rest Ne7aab574e1ac4c42bb5e43e1035a8be6
    73 N970dbec02ec741f3a58f42cc78f05bdb schema:name Springer Nature - SN SciGraph project
    74 rdf:type schema:Organization
    75 Nb5066c72f728460885e0297e46c3ab2d schema:name dimensions_id
    76 schema:value pub.1033702182
    77 rdf:type schema:PropertyValue
    78 Nb9feb5225ac44b4ebc37344d42258bce rdf:first N75e2a53945734a40a084b65dad7adc62
    79 rdf:rest N81c8bdc755d44847a11d59b2eb5bde2c
    80 Ncd07f71fad1c4c359fc1e364bb385017 schema:familyName Nagamalai
    81 schema:givenName Dhinaharan
    82 rdf:type schema:Person
    83 Nd9936891579345c19e58c001ea4ba995 rdf:first N660a348d774d4e35ac5463a6bbab3ca5
    84 rdf:rest N46faa03c0d9440139912ec3fea50f7f6
    85 Ne7aab574e1ac4c42bb5e43e1035a8be6 rdf:first N015def06430c4ab8989a24b91cdcb651
    86 rdf:rest Nd9936891579345c19e58c001ea4ba995
    87 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    88 schema:name Information and Computing Sciences
    89 rdf:type schema:DefinedTerm
    90 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    91 schema:name Data Format
    92 rdf:type schema:DefinedTerm
    93 sg:person.014242317504.39 schema:affiliation https://www.grid.ac/institutes/grid.417969.4
    94 schema:familyName Moses
    95 schema:givenName William K.
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014242317504.39
    97 rdf:type schema:Person
    98 sg:person.016366027737.61 schema:affiliation https://www.grid.ac/institutes/grid.417969.4
    99 schema:familyName Rangan
    100 schema:givenName C. Pandu
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016366027737.61
    102 rdf:type schema:Person
    103 sg:pub.10.1007/11818175_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026158367
    104 https://doi.org/10.1007/11818175_11
    105 rdf:type schema:CreativeWork
    106 sg:pub.10.1007/11832072_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024857952
    107 https://doi.org/10.1007/11832072_16
    108 rdf:type schema:CreativeWork
    109 sg:pub.10.1007/978-3-540-78524-8_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036428940
    110 https://doi.org/10.1007/978-3-540-78524-8_18
    111 rdf:type schema:CreativeWork
    112 sg:pub.10.1007/978-3-540-79104-1_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036295121
    113 https://doi.org/10.1007/978-3-540-79104-1_24
    114 rdf:type schema:CreativeWork
    115 sg:pub.10.1007/978-3-642-00457-5_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052871019
    116 https://doi.org/10.1007/978-3-642-00457-5_3
    117 rdf:type schema:CreativeWork
    118 sg:pub.10.1007/978-3-642-00457-5_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018815288
    119 https://doi.org/10.1007/978-3-642-00457-5_4
    120 rdf:type schema:CreativeWork
    121 sg:pub.10.1007/978-3-642-03356-8_33 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047214508
    122 https://doi.org/10.1007/978-3-642-03356-8_33
    123 rdf:type schema:CreativeWork
    124 sg:pub.10.1007/978-3-642-11799-2_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002446205
    125 https://doi.org/10.1007/978-3-642-11799-2_25
    126 rdf:type schema:CreativeWork
    127 https://doi.org/10.1109/ipdps.2008.4536558 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093424397
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1145/1007352.1007447 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018093655
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1145/1146381.1146393 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037494350
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1145/1374376.1374437 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025129770
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1145/359168.359176 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036015253
    136 rdf:type schema:CreativeWork
    137 https://www.grid.ac/institutes/grid.417969.4 schema:alternateName Indian Institute of Technology Madras
    138 schema:name Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
    139 rdf:type schema:Organization
     




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


    ...