Round Efficiency of Multi-party Computation with a Dishonest Majority View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2003-05-13

AUTHORS

Jonathan Katz , Rafail Ostrovsky , Adam Smith

ABSTRACT

We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality and up to n − 1 of these players may be arbitrarily malicious. Previous protocols for this setting (when a broadcast channel is available) require O(n) rounds. We present two protocols with improved round complexity: The first assumes only the existence of trapdoor permutations and dense cryptosystems, and achieves round complexity O(log n) based on a proof scheduling technique of Chor and Rabin [[13]]; the second requires a stronger hardness assumption (along with the non-black-box techniques of Barak [[2]]) and achieves O(1) round complexity. More... »

PAGES

578-595

References to SciGraph publications

Book

TITLE

Advances in Cryptology — EUROCRYPT 2003

ISBN

978-3-540-14039-9
978-3-540-39200-2

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-39200-9_36

DOI

http://dx.doi.org/10.1007/3-540-39200-9_36

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "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": "University System of Maryland", 
          "id": "https://www.grid.ac/institutes/grid.410443.6", 
          "name": [
            "Dept. of Computer Science, University of Maryland, College Park, MD"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Katz", 
        "givenName": "Jonathan", 
        "id": "sg:person.01354261156.67", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Ericsson (United States)", 
          "id": "https://www.grid.ac/institutes/grid.432790.b", 
          "name": [
            "Telcordia Technologies, Morristown, NJ"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ostrovsky", 
        "givenName": "Rafail", 
        "id": "sg:person.015474716573.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Massachusetts Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "MIT Lab. for Computer Science, Cambridge, MA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Smith", 
        "givenName": "Adam", 
        "id": "sg:person.013307226666.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/224964.224979", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000350264"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/72981.72995", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004101073"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44647-8_7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007571880", 
          "https://doi.org/10.1007/3-540-44647-8_7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44647-8_7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007571880", 
          "https://doi.org/10.1007/3-540-44647-8_7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/571825.571841", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009114551"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s001459910006", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010883744", 
          "https://doi.org/10.1007/s001459910006"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s001459900037", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012436680", 
          "https://doi.org/10.1007/s001459900037"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-46766-1_32", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014420912", 
          "https://doi.org/10.1007/3-540-46766-1_32"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-46766-1_32", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014420912", 
          "https://doi.org/10.1007/3-540-46766-1_32"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/0-387-34805-0_46", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018356824", 
          "https://doi.org/10.1007/0-387-34805-0_46"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/0-387-34805-0_46", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018356824", 
          "https://doi.org/10.1007/0-387-34805-0_46"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/41840.41862", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019745678"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/100216.100287", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020325790"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-38424-3_6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029702463", 
          "https://doi.org/10.1007/3-540-38424-3_6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-38424-3_6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029702463", 
          "https://doi.org/10.1007/3-540-38424-3_6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44647-8_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040117135", 
          "https://doi.org/10.1007/3-540-44647-8_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44647-8_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040117135", 
          "https://doi.org/10.1007/3-540-44647-8_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-46766-1_31", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040525580", 
          "https://doi.org/10.1007/3-540-46766-1_31"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-46766-1_31", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040525580", 
          "https://doi.org/10.1007/3-540-46766-1_31"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/62212.62213", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044033157"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/0-387-34799-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046245850", 
          "https://doi.org/10.1007/0-387-34799-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/0-387-34799-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046245850", 
          "https://doi.org/10.1007/0-387-34799-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/380752.380853", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048685744"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf00195207", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051079135", 
          "https://doi.org/10.1007/bf00195207"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf00195207", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051079135", 
          "https://doi.org/10.1007/bf00195207"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/12130.12168", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051427960"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44647-8_10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051805139", 
          "https://doi.org/10.1007/3-540-44647-8_10"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44647-8_10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051805139", 
          "https://doi.org/10.1007/3-540-44647-8_10"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/0212045", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062841725"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539795291562", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062880061"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539797321742", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062880180"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.1986.25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086214875"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.1992.267809", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086312967"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.2001.959888", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095204750"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.2001.959888", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095204750"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.2001.959888", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095204750"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.2000.892118", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095736977"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2003-05-13", 
    "datePublishedReg": "2003-05-13", 
    "description": "We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality and up to n \u2212 1 of these players may be arbitrarily malicious. Previous protocols for this setting (when a broadcast channel is available) require O(n) rounds. We present two protocols with improved round complexity: The first assumes only the existence of trapdoor permutations and dense cryptosystems, and achieves round complexity O(log n) based on a proof scheduling technique of Chor and Rabin [[13]]; the second requires a stronger hardness assumption (along with the non-black-box techniques of Barak [[2]]) and achieves O(1) round complexity.", 
    "editor": [
      {
        "familyName": "Biham", 
        "givenName": "Eli", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-39200-9_36", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-14039-9", 
        "978-3-540-39200-2"
      ], 
      "name": "Advances in Cryptology \u2014 EUROCRYPT 2003", 
      "type": "Book"
    }, 
    "name": "Round Efficiency of Multi-party Computation with a Dishonest Majority", 
    "pagination": "578-595", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-39200-9_36"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "d5c15627ab899babf79f6b4b01a1d2453cb3fa8e511171ef5b804bd8a6add9e8"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044875514"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-39200-9_36", 
      "https://app.dimensions.ai/details/publication/pub.1044875514"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T05:28", 
    "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/0000000345_0000000345/records_64119_00000001.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F3-540-39200-9_36"
  }
]
 

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/3-540-39200-9_36'

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/3-540-39200-9_36'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-39200-9_36'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-39200-9_36'


 

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

174 TRIPLES      23 PREDICATES      52 URIs      19 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-39200-9_36 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N04dee72bc1904b1da3dac4d7c2fda184
4 schema:citation sg:pub.10.1007/0-387-34799-2
5 sg:pub.10.1007/0-387-34805-0_46
6 sg:pub.10.1007/3-540-38424-3_6
7 sg:pub.10.1007/3-540-44647-8_10
8 sg:pub.10.1007/3-540-44647-8_2
9 sg:pub.10.1007/3-540-44647-8_7
10 sg:pub.10.1007/3-540-46766-1_31
11 sg:pub.10.1007/3-540-46766-1_32
12 sg:pub.10.1007/bf00195207
13 sg:pub.10.1007/s001459900037
14 sg:pub.10.1007/s001459910006
15 https://doi.org/10.1109/sfcs.1986.25
16 https://doi.org/10.1109/sfcs.1992.267809
17 https://doi.org/10.1109/sfcs.2000.892118
18 https://doi.org/10.1109/sfcs.2001.959888
19 https://doi.org/10.1137/0212045
20 https://doi.org/10.1137/s0097539795291562
21 https://doi.org/10.1137/s0097539797321742
22 https://doi.org/10.1145/100216.100287
23 https://doi.org/10.1145/12130.12168
24 https://doi.org/10.1145/224964.224979
25 https://doi.org/10.1145/380752.380853
26 https://doi.org/10.1145/41840.41862
27 https://doi.org/10.1145/571825.571841
28 https://doi.org/10.1145/62212.62213
29 https://doi.org/10.1145/72981.72995
30 schema:datePublished 2003-05-13
31 schema:datePublishedReg 2003-05-13
32 schema:description We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality and up to n − 1 of these players may be arbitrarily malicious. Previous protocols for this setting (when a broadcast channel is available) require O(n) rounds. We present two protocols with improved round complexity: The first assumes only the existence of trapdoor permutations and dense cryptosystems, and achieves round complexity O(log n) based on a proof scheduling technique of Chor and Rabin [[13]]; the second requires a stronger hardness assumption (along with the non-black-box techniques of Barak [[2]]) and achieves O(1) round complexity.
33 schema:editor N83a8c5a0b3114f58bb134be06feda223
34 schema:genre chapter
35 schema:inLanguage en
36 schema:isAccessibleForFree true
37 schema:isPartOf Ncfb68b1f15b6496287acaaa51779c469
38 schema:name Round Efficiency of Multi-party Computation with a Dishonest Majority
39 schema:pagination 578-595
40 schema:productId N1eff2b2fee1b453f9b83268f89d613b0
41 Na1240445e12b4616863627ebe0edc746
42 Nedc0c3daee714484a37fd3541f7beae0
43 schema:publisher N49511194194e4744aa8cf810cf211c03
44 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044875514
45 https://doi.org/10.1007/3-540-39200-9_36
46 schema:sdDatePublished 2019-04-16T05:28
47 schema:sdLicense https://scigraph.springernature.com/explorer/license/
48 schema:sdPublisher N0d06aaa17242484fbc90a557d8e2572f
49 schema:url https://link.springer.com/10.1007%2F3-540-39200-9_36
50 sgo:license sg:explorer/license/
51 sgo:sdDataset chapters
52 rdf:type schema:Chapter
53 N04dee72bc1904b1da3dac4d7c2fda184 rdf:first sg:person.01354261156.67
54 rdf:rest N20d2eacc086240bc9b4508d3d93e33f6
55 N0d06aaa17242484fbc90a557d8e2572f schema:name Springer Nature - SN SciGraph project
56 rdf:type schema:Organization
57 N1eff2b2fee1b453f9b83268f89d613b0 schema:name readcube_id
58 schema:value d5c15627ab899babf79f6b4b01a1d2453cb3fa8e511171ef5b804bd8a6add9e8
59 rdf:type schema:PropertyValue
60 N1fa6cd4cc2474db7b782379e8abcf6b0 rdf:first sg:person.013307226666.21
61 rdf:rest rdf:nil
62 N20d2eacc086240bc9b4508d3d93e33f6 rdf:first sg:person.015474716573.95
63 rdf:rest N1fa6cd4cc2474db7b782379e8abcf6b0
64 N49511194194e4744aa8cf810cf211c03 schema:location Berlin, Heidelberg
65 schema:name Springer Berlin Heidelberg
66 rdf:type schema:Organisation
67 N83a8c5a0b3114f58bb134be06feda223 rdf:first Nad1ce57eb6c94c18a20a92b8f5d61783
68 rdf:rest rdf:nil
69 Na1240445e12b4616863627ebe0edc746 schema:name dimensions_id
70 schema:value pub.1044875514
71 rdf:type schema:PropertyValue
72 Nad1ce57eb6c94c18a20a92b8f5d61783 schema:familyName Biham
73 schema:givenName Eli
74 rdf:type schema:Person
75 Ncfb68b1f15b6496287acaaa51779c469 schema:isbn 978-3-540-14039-9
76 978-3-540-39200-2
77 schema:name Advances in Cryptology — EUROCRYPT 2003
78 rdf:type schema:Book
79 Nedc0c3daee714484a37fd3541f7beae0 schema:name doi
80 schema:value 10.1007/3-540-39200-9_36
81 rdf:type schema:PropertyValue
82 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
83 schema:name Information and Computing Sciences
84 rdf:type schema:DefinedTerm
85 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
86 schema:name Computation Theory and Mathematics
87 rdf:type schema:DefinedTerm
88 sg:person.013307226666.21 schema:affiliation https://www.grid.ac/institutes/grid.116068.8
89 schema:familyName Smith
90 schema:givenName Adam
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21
92 rdf:type schema:Person
93 sg:person.01354261156.67 schema:affiliation https://www.grid.ac/institutes/grid.410443.6
94 schema:familyName Katz
95 schema:givenName Jonathan
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67
97 rdf:type schema:Person
98 sg:person.015474716573.95 schema:affiliation https://www.grid.ac/institutes/grid.432790.b
99 schema:familyName Ostrovsky
100 schema:givenName Rafail
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95
102 rdf:type schema:Person
103 sg:pub.10.1007/0-387-34799-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046245850
104 https://doi.org/10.1007/0-387-34799-2
105 rdf:type schema:CreativeWork
106 sg:pub.10.1007/0-387-34805-0_46 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018356824
107 https://doi.org/10.1007/0-387-34805-0_46
108 rdf:type schema:CreativeWork
109 sg:pub.10.1007/3-540-38424-3_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029702463
110 https://doi.org/10.1007/3-540-38424-3_6
111 rdf:type schema:CreativeWork
112 sg:pub.10.1007/3-540-44647-8_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051805139
113 https://doi.org/10.1007/3-540-44647-8_10
114 rdf:type schema:CreativeWork
115 sg:pub.10.1007/3-540-44647-8_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040117135
116 https://doi.org/10.1007/3-540-44647-8_2
117 rdf:type schema:CreativeWork
118 sg:pub.10.1007/3-540-44647-8_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007571880
119 https://doi.org/10.1007/3-540-44647-8_7
120 rdf:type schema:CreativeWork
121 sg:pub.10.1007/3-540-46766-1_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040525580
122 https://doi.org/10.1007/3-540-46766-1_31
123 rdf:type schema:CreativeWork
124 sg:pub.10.1007/3-540-46766-1_32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014420912
125 https://doi.org/10.1007/3-540-46766-1_32
126 rdf:type schema:CreativeWork
127 sg:pub.10.1007/bf00195207 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051079135
128 https://doi.org/10.1007/bf00195207
129 rdf:type schema:CreativeWork
130 sg:pub.10.1007/s001459900037 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012436680
131 https://doi.org/10.1007/s001459900037
132 rdf:type schema:CreativeWork
133 sg:pub.10.1007/s001459910006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010883744
134 https://doi.org/10.1007/s001459910006
135 rdf:type schema:CreativeWork
136 https://doi.org/10.1109/sfcs.1986.25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086214875
137 rdf:type schema:CreativeWork
138 https://doi.org/10.1109/sfcs.1992.267809 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086312967
139 rdf:type schema:CreativeWork
140 https://doi.org/10.1109/sfcs.2000.892118 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095736977
141 rdf:type schema:CreativeWork
142 https://doi.org/10.1109/sfcs.2001.959888 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095204750
143 rdf:type schema:CreativeWork
144 https://doi.org/10.1137/0212045 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062841725
145 rdf:type schema:CreativeWork
146 https://doi.org/10.1137/s0097539795291562 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062880061
147 rdf:type schema:CreativeWork
148 https://doi.org/10.1137/s0097539797321742 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062880180
149 rdf:type schema:CreativeWork
150 https://doi.org/10.1145/100216.100287 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020325790
151 rdf:type schema:CreativeWork
152 https://doi.org/10.1145/12130.12168 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051427960
153 rdf:type schema:CreativeWork
154 https://doi.org/10.1145/224964.224979 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000350264
155 rdf:type schema:CreativeWork
156 https://doi.org/10.1145/380752.380853 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048685744
157 rdf:type schema:CreativeWork
158 https://doi.org/10.1145/41840.41862 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019745678
159 rdf:type schema:CreativeWork
160 https://doi.org/10.1145/571825.571841 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009114551
161 rdf:type schema:CreativeWork
162 https://doi.org/10.1145/62212.62213 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044033157
163 rdf:type schema:CreativeWork
164 https://doi.org/10.1145/72981.72995 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004101073
165 rdf:type schema:CreativeWork
166 https://www.grid.ac/institutes/grid.116068.8 schema:alternateName Massachusetts Institute of Technology
167 schema:name MIT Lab. for Computer Science, Cambridge, MA
168 rdf:type schema:Organization
169 https://www.grid.ac/institutes/grid.410443.6 schema:alternateName University System of Maryland
170 schema:name Dept. of Computer Science, University of Maryland, College Park, MD
171 rdf:type schema:Organization
172 https://www.grid.ac/institutes/grid.432790.b schema:alternateName Ericsson (United States)
173 schema:name Telcordia Technologies, Morristown, NJ
174 rdf:type schema:Organization
 




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


...