Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2018-08-09

AUTHORS

Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin

ABSTRACT

Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design and secure multiparty computation for big data. Unfortunately, due to a logarithmic lower bound by Goldreich and Ostrovsky (J ACM 43(3):431–473, 1996), ORAM is bound to incur a moderate cost in practice. In particular, with the latest developments in ORAM constructions, we are quickly approaching this limit, and the room for performance improvement is small. In this paper, we consider new models of computation in which the cost of obliviousness can be fundamentally reduced in comparison with the standard ORAM model. We propose the oblivious network RAM model of computation, where a CPU communicates with multiple memory banks, such that the adversary observes only which bank the CPU is communicating with, but not the address offset within each memory bank. In other words, obliviousness within each bank comes for free—either because the architecture prevents a malicious party from observing the address accessed within a bank, or because another solution is used to obfuscate memory accesses within each bank—and hence we only need to obfuscate communication patterns between the CPU and the memory banks. We present new constructions for obliviously simulating general or parallel programs in the network RAM model. We describe applications of our new model in distributed storage applications with a network adversary. More... »

PAGES

941-972

References to SciGraph publications

  • 2014. Garbled RAM Revisited in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2014
  • 2014. Statistically-secure ORAM with Overhead in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2014
  • 2012. Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability in DESIGN AND ANALYSIS OF ALGORITHMS
  • 2013. Distributed Oblivious RAM for Secure Two-Party Computation in THEORY OF CRYPTOGRAPHY
  • 2013. Optimizing ORAM and Using It Efficiently for Secure Computation in PRIVACY ENHANCING TECHNOLOGIES
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00145-018-9301-4

    DOI

    http://dx.doi.org/10.1007/s00145-018-9301-4

    DIMENSIONS

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


    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/0803", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computer Software", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA", 
              "id": "http://www.grid.ac/institutes/grid.410443.6", 
              "name": [
                "Department of Electrical and Computer Engineering, University of Maryland, College Park, USA", 
                "University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Dachman-Soled", 
            "givenName": "Dana", 
            "id": "sg:person.011244513001.85", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011244513001.85"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of California, Berkeley, USA", 
              "id": "http://www.grid.ac/institutes/grid.47840.3f", 
              "name": [
                "University of California, Berkeley, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Liu", 
            "givenName": "Chang", 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA", 
              "id": "http://www.grid.ac/institutes/grid.410443.6", 
              "name": [
                "Department of Electrical and Computer Engineering, University of Maryland, College Park, USA", 
                "University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Papamanthou", 
            "givenName": "Charalampos", 
            "id": "sg:person.010450677547.30", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010450677547.30"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Cornell University, Ithaca, USA", 
              "id": "http://www.grid.ac/institutes/grid.5386.8", 
              "name": [
                "Cornell University, Ithaca, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Shi", 
            "givenName": "Elaine", 
            "id": "sg:person.014706274717.52", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA", 
              "id": "http://www.grid.ac/institutes/grid.410443.6", 
              "name": [
                "Department of Electrical and Computer Engineering, University of Maryland, College Park, USA", 
                "University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Vishkin", 
            "givenName": "Uzi", 
            "id": "sg:person.0646157060.46", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0646157060.46"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-642-34862-4_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033052038", 
              "https://doi.org/10.1007/978-3-642-34862-4_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-39077-7_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008657413", 
              "https://doi.org/10.1007/978-3-642-39077-7_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-45608-8_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023729851", 
              "https://doi.org/10.1007/978-3-662-45608-8_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-55220-5_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047906016", 
              "https://doi.org/10.1007/978-3-642-55220-5_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-36594-2_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020430836", 
              "https://doi.org/10.1007/978-3-642-36594-2_22"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2018-08-09", 
        "datePublishedReg": "2018-08-09", 
        "description": "Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design and secure multiparty computation for big data. Unfortunately, due to a logarithmic lower bound by Goldreich and Ostrovsky (J ACM 43(3):431\u2013473, 1996), ORAM is bound to incur a moderate cost in practice. In particular, with the latest developments in ORAM constructions, we are quickly approaching this limit, and the room for performance improvement is small. In this paper, we consider new models of computation in which the cost of obliviousness can be fundamentally reduced in comparison with the standard ORAM model. We propose the oblivious network RAM model of computation, where a CPU communicates with multiple memory banks, such that the adversary observes only which bank the CPU is communicating with, but not the address offset within each memory bank. In other words, obliviousness within each bank comes for free\u2014either because the architecture prevents a malicious party from observing the address accessed within a bank, or because another solution is used to obfuscate memory accesses within each bank\u2014and hence we only need to obfuscate communication patterns between the CPU and the memory banks. We present new constructions for obliviously simulating general or parallel programs in the network RAM model. We describe applications of our new model in distributed storage applications with a network adversary.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s00145-018-9301-4", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.3485981", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.3934422", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.6933241", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.4178091", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.5545039", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.3135791", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.4727905", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.5540040", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.4456983", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": [
          {
            "id": "sg:journal.1136278", 
            "issn": [
              "0933-2790", 
              "1432-1378"
            ], 
            "name": "Journal of Cryptology", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "32"
          }
        ], 
        "keywords": [
          "Oblivious RAM", 
          "memory banks", 
          "secure processor design", 
          "multiple memory banks", 
          "RAM model", 
          "network adversary", 
          "sensitive data", 
          "multiparty computation", 
          "ORAM constructions", 
          "untrusted memory", 
          "malicious parties", 
          "cryptographic primitives", 
          "access patterns", 
          "parallel programs", 
          "big data", 
          "network RAM", 
          "memory access", 
          "CPU", 
          "processor design", 
          "communication patterns", 
          "performance improvement", 
          "adversary", 
          "computation", 
          "obliviousness", 
          "new model", 
          "address", 
          "moderate cost", 
          "primitives", 
          "applications", 
          "parallelism", 
          "architecture", 
          "Ostrovsky", 
          "rams", 
          "cost", 
          "Goldreich", 
          "model", 
          "new construction", 
          "broad applications", 
          "access", 
          "construction", 
          "memory", 
          "latest developments", 
          "data", 
          "design", 
          "solution", 
          "words", 
          "banks", 
          "parties", 
          "improvement", 
          "program", 
          "room", 
          "patterns", 
          "development", 
          "storage applications", 
          "practice", 
          "comparison", 
          "limit", 
          "paper", 
          "cost of obliviousness", 
          "standard ORAM model", 
          "ORAM model", 
          "oblivious network RAM model", 
          "network RAM model", 
          "Oblivious Network RAM", 
          "Leveraging Parallelism"
        ], 
        "name": "Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness", 
        "pagination": "941-972", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1106081893"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00145-018-9301-4"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00145-018-9301-4", 
          "https://app.dimensions.ai/details/publication/pub.1106081893"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-12-01T19:44", 
        "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/article/article_791.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s00145-018-9301-4"
      }
    ]
     

    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/s00145-018-9301-4'

    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/s00145-018-9301-4'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00145-018-9301-4'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00145-018-9301-4'


     

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

    195 TRIPLES      22 PREDICATES      95 URIs      82 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00145-018-9301-4 schema:about anzsrc-for:08
    2 anzsrc-for:0803
    3 schema:author Ne5abe908cf78404ab2d9938e50e1a854
    4 schema:citation sg:pub.10.1007/978-3-642-34862-4_15
    5 sg:pub.10.1007/978-3-642-36594-2_22
    6 sg:pub.10.1007/978-3-642-39077-7_1
    7 sg:pub.10.1007/978-3-642-55220-5_23
    8 sg:pub.10.1007/978-3-662-45608-8_4
    9 schema:datePublished 2018-08-09
    10 schema:datePublishedReg 2018-08-09
    11 schema:description Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design and secure multiparty computation for big data. Unfortunately, due to a logarithmic lower bound by Goldreich and Ostrovsky (J ACM 43(3):431–473, 1996), ORAM is bound to incur a moderate cost in practice. In particular, with the latest developments in ORAM constructions, we are quickly approaching this limit, and the room for performance improvement is small. In this paper, we consider new models of computation in which the cost of obliviousness can be fundamentally reduced in comparison with the standard ORAM model. We propose the oblivious network RAM model of computation, where a CPU communicates with multiple memory banks, such that the adversary observes only which bank the CPU is communicating with, but not the address offset within each memory bank. In other words, obliviousness within each bank comes for free—either because the architecture prevents a malicious party from observing the address accessed within a bank, or because another solution is used to obfuscate memory accesses within each bank—and hence we only need to obfuscate communication patterns between the CPU and the memory banks. We present new constructions for obliviously simulating general or parallel programs in the network RAM model. We describe applications of our new model in distributed storage applications with a network adversary.
    12 schema:genre article
    13 schema:inLanguage en
    14 schema:isAccessibleForFree true
    15 schema:isPartOf N71273f59142f471c9cca1e080a0d5204
    16 Na3d6d43aa6644c8bada7c39fac4365fe
    17 sg:journal.1136278
    18 schema:keywords CPU
    19 Goldreich
    20 Leveraging Parallelism
    21 ORAM constructions
    22 ORAM model
    23 Oblivious Network RAM
    24 Oblivious RAM
    25 Ostrovsky
    26 RAM model
    27 access
    28 access patterns
    29 address
    30 adversary
    31 applications
    32 architecture
    33 banks
    34 big data
    35 broad applications
    36 communication patterns
    37 comparison
    38 computation
    39 construction
    40 cost
    41 cost of obliviousness
    42 cryptographic primitives
    43 data
    44 design
    45 development
    46 improvement
    47 latest developments
    48 limit
    49 malicious parties
    50 memory
    51 memory access
    52 memory banks
    53 model
    54 moderate cost
    55 multiparty computation
    56 multiple memory banks
    57 network RAM
    58 network RAM model
    59 network adversary
    60 new construction
    61 new model
    62 oblivious network RAM model
    63 obliviousness
    64 paper
    65 parallel programs
    66 parallelism
    67 parties
    68 patterns
    69 performance improvement
    70 practice
    71 primitives
    72 processor design
    73 program
    74 rams
    75 room
    76 secure processor design
    77 sensitive data
    78 solution
    79 standard ORAM model
    80 storage applications
    81 untrusted memory
    82 words
    83 schema:name Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness
    84 schema:pagination 941-972
    85 schema:productId Na3eb0d040d5b44babb46d6f19eae62da
    86 Nd3d3e421f813432288d27fe7ca46e2d7
    87 schema:sameAs https://app.dimensions.ai/details/publication/pub.1106081893
    88 https://doi.org/10.1007/s00145-018-9301-4
    89 schema:sdDatePublished 2021-12-01T19:44
    90 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    91 schema:sdPublisher Nca75b8001b7e446ea4f71a51b33dade6
    92 schema:url https://doi.org/10.1007/s00145-018-9301-4
    93 sgo:license sg:explorer/license/
    94 sgo:sdDataset articles
    95 rdf:type schema:ScholarlyArticle
    96 N25e879d58a1c41d1b39c4fffb556d4d9 rdf:first sg:person.0646157060.46
    97 rdf:rest rdf:nil
    98 N32600dc873e94cf79c36a40df7cddbb3 rdf:first sg:person.014706274717.52
    99 rdf:rest N25e879d58a1c41d1b39c4fffb556d4d9
    100 N6a5e2012067347718b576ee5e2072bd1 rdf:first sg:person.010450677547.30
    101 rdf:rest N32600dc873e94cf79c36a40df7cddbb3
    102 N71273f59142f471c9cca1e080a0d5204 schema:volumeNumber 32
    103 rdf:type schema:PublicationVolume
    104 N7b34120cadeb412e89c882ccb92c9f08 schema:affiliation grid-institutes:grid.47840.3f
    105 schema:familyName Liu
    106 schema:givenName Chang
    107 rdf:type schema:Person
    108 Na3d6d43aa6644c8bada7c39fac4365fe schema:issueNumber 3
    109 rdf:type schema:PublicationIssue
    110 Na3eb0d040d5b44babb46d6f19eae62da schema:name dimensions_id
    111 schema:value pub.1106081893
    112 rdf:type schema:PropertyValue
    113 Nca75b8001b7e446ea4f71a51b33dade6 schema:name Springer Nature - SN SciGraph project
    114 rdf:type schema:Organization
    115 Nd3d3e421f813432288d27fe7ca46e2d7 schema:name doi
    116 schema:value 10.1007/s00145-018-9301-4
    117 rdf:type schema:PropertyValue
    118 Ne322a4e67e854f4d849c7b2efb1f63df rdf:first N7b34120cadeb412e89c882ccb92c9f08
    119 rdf:rest N6a5e2012067347718b576ee5e2072bd1
    120 Ne5abe908cf78404ab2d9938e50e1a854 rdf:first sg:person.011244513001.85
    121 rdf:rest Ne322a4e67e854f4d849c7b2efb1f63df
    122 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    123 schema:name Information and Computing Sciences
    124 rdf:type schema:DefinedTerm
    125 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
    126 schema:name Computer Software
    127 rdf:type schema:DefinedTerm
    128 sg:grant.3135791 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    129 rdf:type schema:MonetaryGrant
    130 sg:grant.3485981 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    131 rdf:type schema:MonetaryGrant
    132 sg:grant.3934422 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    133 rdf:type schema:MonetaryGrant
    134 sg:grant.4178091 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    135 rdf:type schema:MonetaryGrant
    136 sg:grant.4456983 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    137 rdf:type schema:MonetaryGrant
    138 sg:grant.4727905 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    139 rdf:type schema:MonetaryGrant
    140 sg:grant.5540040 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    141 rdf:type schema:MonetaryGrant
    142 sg:grant.5545039 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    143 rdf:type schema:MonetaryGrant
    144 sg:grant.6933241 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-018-9301-4
    145 rdf:type schema:MonetaryGrant
    146 sg:journal.1136278 schema:issn 0933-2790
    147 1432-1378
    148 schema:name Journal of Cryptology
    149 schema:publisher Springer Nature
    150 rdf:type schema:Periodical
    151 sg:person.010450677547.30 schema:affiliation grid-institutes:grid.410443.6
    152 schema:familyName Papamanthou
    153 schema:givenName Charalampos
    154 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010450677547.30
    155 rdf:type schema:Person
    156 sg:person.011244513001.85 schema:affiliation grid-institutes:grid.410443.6
    157 schema:familyName Dachman-Soled
    158 schema:givenName Dana
    159 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011244513001.85
    160 rdf:type schema:Person
    161 sg:person.014706274717.52 schema:affiliation grid-institutes:grid.5386.8
    162 schema:familyName Shi
    163 schema:givenName Elaine
    164 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52
    165 rdf:type schema:Person
    166 sg:person.0646157060.46 schema:affiliation grid-institutes:grid.410443.6
    167 schema:familyName Vishkin
    168 schema:givenName Uzi
    169 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0646157060.46
    170 rdf:type schema:Person
    171 sg:pub.10.1007/978-3-642-34862-4_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033052038
    172 https://doi.org/10.1007/978-3-642-34862-4_15
    173 rdf:type schema:CreativeWork
    174 sg:pub.10.1007/978-3-642-36594-2_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020430836
    175 https://doi.org/10.1007/978-3-642-36594-2_22
    176 rdf:type schema:CreativeWork
    177 sg:pub.10.1007/978-3-642-39077-7_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008657413
    178 https://doi.org/10.1007/978-3-642-39077-7_1
    179 rdf:type schema:CreativeWork
    180 sg:pub.10.1007/978-3-642-55220-5_23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047906016
    181 https://doi.org/10.1007/978-3-642-55220-5_23
    182 rdf:type schema:CreativeWork
    183 sg:pub.10.1007/978-3-662-45608-8_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023729851
    184 https://doi.org/10.1007/978-3-662-45608-8_4
    185 rdf:type schema:CreativeWork
    186 grid-institutes:grid.410443.6 schema:alternateName University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA
    187 schema:name Department of Electrical and Computer Engineering, University of Maryland, College Park, USA
    188 University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, USA
    189 rdf:type schema:Organization
    190 grid-institutes:grid.47840.3f schema:alternateName University of California, Berkeley, USA
    191 schema:name University of California, Berkeley, USA
    192 rdf:type schema:Organization
    193 grid-institutes:grid.5386.8 schema:alternateName Cornell University, Ithaca, USA
    194 schema:name Cornell University, Ithaca, USA
    195 rdf:type schema:Organization
     




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


    ...