Asynchronous Byzantine Agreement with optimal resilience View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2014-04

AUTHORS

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

ABSTRACT

We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting at most t out of the n parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham et al. (PODC 2008), our protocol is significantly more efficient in terms of the communication complexity. Our ABA protocol is built on a new statistical asynchronous verifiable secret sharing (AVSS) protocol with optimal resilience. Our AVSS protocol significantly improves the communication complexity of the only known statistical and optimally-resilient AVSS protocol of Canetti et al. Our AVSS protocol is further built on an asynchronous primitive called asynchronous weak commitment (AWC), while the AVSS of Canetti et al. is built on the primitive called asynchronous weak secret sharing (AWSS). We observe that AWC has weaker requirements than AWSS and hence it can be designed more efficiently than AWSS. The common coin primitive is one of the most important building blocks for the construction of an ABA protocol. In this paper, we extend the existing common coin protocol to make it compatible with our new AVSS protocol that shares multiple secrets simultaneously. As a byproduct, our new common coin protocol is more communication efficient than all the existing common coin protocols. More... »

PAGES

111-146

References to SciGraph publications

  • 1999-04-15. Efficient Multiparty Computations Secure Against an Adaptive Adversary in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’99
  • 2009. The Round Complexity of Verifiable Secret Sharing Revisited in ADVANCES IN CRYPTOLOGY - CRYPTO 2009
  • 2007-01. Secure Distributed Key Generation for Discrete-Log Based Cryptosystems in JOURNAL OF CRYPTOLOGY
  • 2005. Multiparty Computation, an Introduction in CONTEMPORARY CRYPTOLOGY
  • 2006. Round-Optimal and Efficient Verifiable Secret Sharing in THEORY OF CRYPTOGRAPHY
  • 2001-05-18. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing in ADVANCES IN CRYPTOLOGY — CRYPTO ’91
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00446-013-0200-5

    DOI

    http://dx.doi.org/10.1007/s00446-013-0200-5

    DIMENSIONS

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


    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/1005", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Communications Technologies", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Technology", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Bristol", 
              "id": "https://www.grid.ac/institutes/grid.5337.2", 
              "name": [
                "Department of Computer Science, University of Bristol, Bristol, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Patra", 
            "givenName": "Arpita", 
            "id": "sg:person.016570701367.19", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016570701367.19"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Bristol", 
              "id": "https://www.grid.ac/institutes/grid.5337.2", 
              "name": [
                "Department of Computer Science, University of Bristol, Bristol, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Choudhury", 
            "givenName": "Ashish", 
            "id": "sg:person.011205617357.10", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011205617357.10"
            ], 
            "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, IIT 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/s00145-006-0347-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000307063", 
              "https://doi.org/10.1007/s00145-006-0347-3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03356-8_29", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002582525", 
              "https://doi.org/10.1007/978-3-642-03356-8_29"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/73007.73014", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008903577"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11681878_17", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012831785", 
              "https://doi.org/10.1007/11681878_17"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11681878_17", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012831785", 
              "https://doi.org/10.1007/11681878_17"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/322186.322188", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019357895"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021532235", 
              "https://doi.org/10.1007/3-540-46766-1_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021532235", 
              "https://doi.org/10.1007/3-540-46766-1_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-7643-7394-6_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024815826", 
              "https://doi.org/10.1007/3-7643-7394-6_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/2332432.2332454", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025476836"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1400751.1400804", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030287032"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1582716.1582736", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034853544"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/359168.359176", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036015253"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/3149.214121", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038326732"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48910-x_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041055798", 
              "https://doi.org/10.1007/3-540-48910-x_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48910-x_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041055798", 
              "https://doi.org/10.1007/3-540-48910-x_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/62212.62213", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044033157"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/167088.167105", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044099843"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/380752.380853", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048685744"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/18.476316", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061099776"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/0217014", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062842033"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/s0097539790187084", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062879639"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1983.48", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086253441"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1002/0471478210", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1098661292"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1002/0471478210", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1098661292"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2014-04", 
        "datePublishedReg": "2014-04-01", 
        "description": "We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting at most t out of the n parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham et al. (PODC 2008), our protocol is significantly more efficient in terms of the communication complexity. Our ABA protocol is built on a new statistical asynchronous verifiable secret sharing (AVSS) protocol with optimal resilience. Our AVSS protocol significantly improves the communication complexity of the only known statistical and optimally-resilient AVSS protocol of Canetti et al. Our AVSS protocol is further built on an asynchronous primitive called asynchronous weak commitment (AWC), while the AVSS of Canetti et al. is built on the primitive called asynchronous weak secret sharing (AWSS). We observe that AWC has weaker requirements than AWSS and hence it can be designed more efficiently than AWSS. The common coin primitive is one of the most important building blocks for the construction of an ABA protocol. In this paper, we extend the existing common coin protocol to make it compatible with our new AVSS protocol that shares multiple secrets simultaneously. As a byproduct, our new common coin protocol is more communication efficient than all the existing common coin protocols.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s00446-013-0200-5", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.2782093", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.3782002", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": [
          {
            "id": "sg:journal.1052621", 
            "issn": [
              "0178-2770", 
              "1432-0452"
            ], 
            "name": "Distributed Computing", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "27"
          }
        ], 
        "name": "Asynchronous Byzantine Agreement with optimal resilience", 
        "pagination": "111-146", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "b8b6de85c52687df98f4aebf675340630e8ceefe286ce280ee0bc6dfed0cd71e"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00446-013-0200-5"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1038776452"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00446-013-0200-5", 
          "https://app.dimensions.ai/details/publication/pub.1038776452"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-10T18:15", 
        "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/0000000001_0000000264/records_8675_00000490.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007/s00446-013-0200-5"
      }
    ]
     

    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/s00446-013-0200-5'

    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/s00446-013-0200-5'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00446-013-0200-5'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00446-013-0200-5'


     

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

    151 TRIPLES      21 PREDICATES      48 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00446-013-0200-5 schema:about anzsrc-for:10
    2 anzsrc-for:1005
    3 schema:author N565d9f3b7276455fbe85b0abcaf3364d
    4 schema:citation sg:pub.10.1007/11681878_17
    5 sg:pub.10.1007/3-540-46766-1_9
    6 sg:pub.10.1007/3-540-48910-x_22
    7 sg:pub.10.1007/3-7643-7394-6_2
    8 sg:pub.10.1007/978-3-642-03356-8_29
    9 sg:pub.10.1007/s00145-006-0347-3
    10 https://doi.org/10.1002/0471478210
    11 https://doi.org/10.1109/18.476316
    12 https://doi.org/10.1109/sfcs.1983.48
    13 https://doi.org/10.1137/0217014
    14 https://doi.org/10.1137/s0097539790187084
    15 https://doi.org/10.1145/1400751.1400804
    16 https://doi.org/10.1145/1582716.1582736
    17 https://doi.org/10.1145/167088.167105
    18 https://doi.org/10.1145/2332432.2332454
    19 https://doi.org/10.1145/3149.214121
    20 https://doi.org/10.1145/322186.322188
    21 https://doi.org/10.1145/359168.359176
    22 https://doi.org/10.1145/380752.380853
    23 https://doi.org/10.1145/62212.62213
    24 https://doi.org/10.1145/73007.73014
    25 schema:datePublished 2014-04
    26 schema:datePublishedReg 2014-04-01
    27 schema:description We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting at most t out of the n parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham et al. (PODC 2008), our protocol is significantly more efficient in terms of the communication complexity. Our ABA protocol is built on a new statistical asynchronous verifiable secret sharing (AVSS) protocol with optimal resilience. Our AVSS protocol significantly improves the communication complexity of the only known statistical and optimally-resilient AVSS protocol of Canetti et al. Our AVSS protocol is further built on an asynchronous primitive called asynchronous weak commitment (AWC), while the AVSS of Canetti et al. is built on the primitive called asynchronous weak secret sharing (AWSS). We observe that AWC has weaker requirements than AWSS and hence it can be designed more efficiently than AWSS. The common coin primitive is one of the most important building blocks for the construction of an ABA protocol. In this paper, we extend the existing common coin protocol to make it compatible with our new AVSS protocol that shares multiple secrets simultaneously. As a byproduct, our new common coin protocol is more communication efficient than all the existing common coin protocols.
    28 schema:genre research_article
    29 schema:inLanguage en
    30 schema:isAccessibleForFree false
    31 schema:isPartOf N0fd2f856b4264e5e9f784bfa6a54aef2
    32 N85fd988d53c14a85a48136fd29fef32e
    33 sg:journal.1052621
    34 schema:name Asynchronous Byzantine Agreement with optimal resilience
    35 schema:pagination 111-146
    36 schema:productId N25f04ef98b75497d896b9039fe538a75
    37 N5e7d63545831443b890b8cedaa057306
    38 N6fbdc30368d64746a7c613f30d38086b
    39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038776452
    40 https://doi.org/10.1007/s00446-013-0200-5
    41 schema:sdDatePublished 2019-04-10T18:15
    42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    43 schema:sdPublisher N1dfe733bbac64b5bab65d05be006c591
    44 schema:url http://link.springer.com/10.1007/s00446-013-0200-5
    45 sgo:license sg:explorer/license/
    46 sgo:sdDataset articles
    47 rdf:type schema:ScholarlyArticle
    48 N0fd2f856b4264e5e9f784bfa6a54aef2 schema:volumeNumber 27
    49 rdf:type schema:PublicationVolume
    50 N1dfe733bbac64b5bab65d05be006c591 schema:name Springer Nature - SN SciGraph project
    51 rdf:type schema:Organization
    52 N25f04ef98b75497d896b9039fe538a75 schema:name readcube_id
    53 schema:value b8b6de85c52687df98f4aebf675340630e8ceefe286ce280ee0bc6dfed0cd71e
    54 rdf:type schema:PropertyValue
    55 N2e07a567680243009c44991d6720e9fc rdf:first sg:person.016366027737.61
    56 rdf:rest rdf:nil
    57 N565d9f3b7276455fbe85b0abcaf3364d rdf:first sg:person.016570701367.19
    58 rdf:rest Ncecec6cb80c44bcaa808eb71e30dec0c
    59 N5e7d63545831443b890b8cedaa057306 schema:name dimensions_id
    60 schema:value pub.1038776452
    61 rdf:type schema:PropertyValue
    62 N6fbdc30368d64746a7c613f30d38086b schema:name doi
    63 schema:value 10.1007/s00446-013-0200-5
    64 rdf:type schema:PropertyValue
    65 N85fd988d53c14a85a48136fd29fef32e schema:issueNumber 2
    66 rdf:type schema:PublicationIssue
    67 Ncecec6cb80c44bcaa808eb71e30dec0c rdf:first sg:person.011205617357.10
    68 rdf:rest N2e07a567680243009c44991d6720e9fc
    69 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
    70 schema:name Technology
    71 rdf:type schema:DefinedTerm
    72 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
    73 schema:name Communications Technologies
    74 rdf:type schema:DefinedTerm
    75 sg:grant.2782093 http://pending.schema.org/fundedItem sg:pub.10.1007/s00446-013-0200-5
    76 rdf:type schema:MonetaryGrant
    77 sg:grant.3782002 http://pending.schema.org/fundedItem sg:pub.10.1007/s00446-013-0200-5
    78 rdf:type schema:MonetaryGrant
    79 sg:journal.1052621 schema:issn 0178-2770
    80 1432-0452
    81 schema:name Distributed Computing
    82 rdf:type schema:Periodical
    83 sg:person.011205617357.10 schema:affiliation https://www.grid.ac/institutes/grid.5337.2
    84 schema:familyName Choudhury
    85 schema:givenName Ashish
    86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011205617357.10
    87 rdf:type schema:Person
    88 sg:person.016366027737.61 schema:affiliation https://www.grid.ac/institutes/grid.417969.4
    89 schema:familyName Rangan
    90 schema:givenName C. Pandu
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016366027737.61
    92 rdf:type schema:Person
    93 sg:person.016570701367.19 schema:affiliation https://www.grid.ac/institutes/grid.5337.2
    94 schema:familyName Patra
    95 schema:givenName Arpita
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016570701367.19
    97 rdf:type schema:Person
    98 sg:pub.10.1007/11681878_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012831785
    99 https://doi.org/10.1007/11681878_17
    100 rdf:type schema:CreativeWork
    101 sg:pub.10.1007/3-540-46766-1_9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021532235
    102 https://doi.org/10.1007/3-540-46766-1_9
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/3-540-48910-x_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041055798
    105 https://doi.org/10.1007/3-540-48910-x_22
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/3-7643-7394-6_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024815826
    108 https://doi.org/10.1007/3-7643-7394-6_2
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/978-3-642-03356-8_29 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002582525
    111 https://doi.org/10.1007/978-3-642-03356-8_29
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/s00145-006-0347-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000307063
    114 https://doi.org/10.1007/s00145-006-0347-3
    115 rdf:type schema:CreativeWork
    116 https://doi.org/10.1002/0471478210 schema:sameAs https://app.dimensions.ai/details/publication/pub.1098661292
    117 rdf:type schema:CreativeWork
    118 https://doi.org/10.1109/18.476316 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061099776
    119 rdf:type schema:CreativeWork
    120 https://doi.org/10.1109/sfcs.1983.48 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086253441
    121 rdf:type schema:CreativeWork
    122 https://doi.org/10.1137/0217014 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062842033
    123 rdf:type schema:CreativeWork
    124 https://doi.org/10.1137/s0097539790187084 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879639
    125 rdf:type schema:CreativeWork
    126 https://doi.org/10.1145/1400751.1400804 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030287032
    127 rdf:type schema:CreativeWork
    128 https://doi.org/10.1145/1582716.1582736 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034853544
    129 rdf:type schema:CreativeWork
    130 https://doi.org/10.1145/167088.167105 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044099843
    131 rdf:type schema:CreativeWork
    132 https://doi.org/10.1145/2332432.2332454 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025476836
    133 rdf:type schema:CreativeWork
    134 https://doi.org/10.1145/3149.214121 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038326732
    135 rdf:type schema:CreativeWork
    136 https://doi.org/10.1145/322186.322188 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019357895
    137 rdf:type schema:CreativeWork
    138 https://doi.org/10.1145/359168.359176 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036015253
    139 rdf:type schema:CreativeWork
    140 https://doi.org/10.1145/380752.380853 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048685744
    141 rdf:type schema:CreativeWork
    142 https://doi.org/10.1145/62212.62213 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044033157
    143 rdf:type schema:CreativeWork
    144 https://doi.org/10.1145/73007.73014 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008903577
    145 rdf:type schema:CreativeWork
    146 https://www.grid.ac/institutes/grid.417969.4 schema:alternateName Indian Institute of Technology Madras
    147 schema:name Department of Computer Science and Engineering, IIT Madras, Chennai, India
    148 rdf:type schema:Organization
    149 https://www.grid.ac/institutes/grid.5337.2 schema:alternateName University of Bristol
    150 schema:name Department of Computer Science, University of Bristol, Bristol, UK
    151 rdf:type schema:Organization
     




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


    ...