OptORAMa: Optimal Oblivious RAM View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2020-05-01

AUTHORS

Gilad Asharov , Ilan Komargodski , Wei-Kai Lin , Kartik Nayak , Enoch Peserico , Elaine Shi

ABSTRACT

Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC ’87 and J. ACM ’96) is a technique for provably obfuscating programs’ access patterns, such that the access patterns leak no information about the programs’ secret inputs. To compile a general program to an oblivious counterpart, it is well-known that Ω(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varOmega (\log N)$$\end{document} amortized blowup is necessary, where N is the size of the logical memory. This was shown in Goldreich and Ostrovksy’s original ORAM work for statistical security and in a somewhat restricted model (the so called balls-and-bins model), and recently by Larsen and Nielsen (CRYPTO ’18) for computational security.A long standing open question is whether there exists an optimal ORAM construction that matches the aforementioned logarithmic lower bounds (without making large memory word assumptions, and assuming a constant number of CPU registers). In this paper, we resolve this problem and present the first secure ORAM with O(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log N)$$\end{document} amortized blowup, assuming one-way functions. Our result is inspired by and non-trivially improves on the recent beautiful work of Patel et al. (FOCS ’18) who gave a construction with O(logN·loglogN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log N\cdot \log \log N)$$\end{document} amortized blowup, assuming one-way functions.One of our building blocks of independent interest is a linear-time deterministic oblivious algorithm for tight compaction: Given an array of n elements where some elements are marked, we permute the elements in the array so that all marked elements end up in the front of the array. Our O(n) algorithm improves the previously best known deterministic or randomized algorithms whose running time is O(n·logn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n \cdot \log n)$$\end{document} or O(n·loglogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n \cdot \log \log n)$$\end{document}, respectively. More... »

PAGES

403-432

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-030-45724-2_14

DOI

http://dx.doi.org/10.1007/978-3-030-45724-2_14

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Bar-Ilan University, 52900, Ramat Gan, Israel", 
          "id": "http://www.grid.ac/institutes/grid.22098.31", 
          "name": [
            "Bar-Ilan University, 52900, Ramat Gan, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Asharov", 
        "givenName": "Gilad", 
        "id": "sg:person.016347606461.90", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016347606461.90"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "NTT Research, 94303, Palo Alto, CA, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "NTT Research, 94303, Palo Alto, CA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Komargodski", 
        "givenName": "Ilan", 
        "id": "sg:person.012204235441.12", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012204235441.12"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Cornell University, 14850, Ithaca, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.5386.8", 
          "name": [
            "Cornell University, 14850, Ithaca, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lin", 
        "givenName": "Wei-Kai", 
        "id": "sg:person.015030115735.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015030115735.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Duke University, 27708, Durham, NC, USA", 
          "id": "http://www.grid.ac/institutes/grid.26009.3d", 
          "name": [
            "Duke University, 27708, Durham, NC, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Nayak", 
        "givenName": "Kartik", 
        "id": "sg:person.011031600672.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011031600672.42"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Universit\u00e0 degli Studi di Padova, Padova, PD, Italy", 
          "id": "http://www.grid.ac/institutes/grid.5608.b", 
          "name": [
            "Universit\u00e0 degli Studi di Padova, Padova, PD, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Peserico", 
        "givenName": "Enoch", 
        "id": "sg:person.0755702417.79", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0755702417.79"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Cornell University, 14850, Ithaca, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.5386.8", 
          "name": [
            "Cornell University, 14850, Ithaca, NY, 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"
      }
    ], 
    "datePublished": "2020-05-01", 
    "datePublishedReg": "2020-05-01", 
    "description": "Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC \u201987 and J. ACM \u201996) is a technique for provably obfuscating programs\u2019 access patterns, such that the access patterns leak no information about the programs\u2019 secret inputs. To compile a general program to an oblivious counterpart, it is well-known that \u03a9(logN)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$\\varOmega (\\log N)$$\\end{document} amortized blowup is necessary, where N is the size of the logical memory. This was shown in Goldreich and Ostrovksy\u2019s original ORAM work for statistical security and in a somewhat restricted model (the so called balls-and-bins model), and recently by Larsen and Nielsen (CRYPTO \u201918) for computational security.A long standing open question is whether there exists an optimal ORAM construction that matches the aforementioned logarithmic lower bounds (without making large memory word assumptions, and assuming a constant number of CPU registers). In this paper, we resolve this problem and present the first secure ORAM with O(logN)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$O(\\log N)$$\\end{document} amortized blowup, assuming one-way functions. Our result is inspired by and non-trivially improves on the recent beautiful work of Patel et al. (FOCS \u201918) who gave a construction with O(logN\u00b7loglogN)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$O(\\log N\\cdot \\log \\log N)$$\\end{document} amortized blowup, assuming one-way functions.One of our building blocks of independent interest is a linear-time deterministic oblivious algorithm for tight compaction: Given an array of n elements where some elements are marked, we permute the elements in the array so that all marked elements end up in the front of the array. Our O(n) algorithm improves the previously best known deterministic or randomized algorithms whose running time is O(n\u00b7logn)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$O(n \\cdot \\log n)$$\\end{document} or O(n\u00b7loglogn)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$O(n \\cdot \\log \\log n)$$\\end{document}, respectively.", 
    "editor": [
      {
        "familyName": "Canteaut", 
        "givenName": "Anne", 
        "type": "Person"
      }, 
      {
        "familyName": "Ishai", 
        "givenName": "Yuval", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-030-45724-2_14", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-030-45723-5", 
        "978-3-030-45724-2"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2020", 
      "type": "Book"
    }, 
    "keywords": [
      "Oblivious RAM", 
      "one-way functions", 
      "access patterns", 
      "logarithmic lower bounds", 
      "deterministic oblivious algorithm", 
      "computational security", 
      "ORAM constructions", 
      "lower bounds", 
      "secret inputs", 
      "statistical security", 
      "independent interest", 
      "obfuscating programs", 
      "blowup", 
      "oblivious algorithms", 
      "restricted model", 
      "algorithm", 
      "security", 
      "Goldreich", 
      "general program", 
      "n elements", 
      "beautiful work", 
      "open question", 
      "bounds", 
      "et al", 
      "deterministic", 
      "rams", 
      "building blocks", 
      "ground-breaking work", 
      "Ostrovsky", 
      "work", 
      "problem", 
      "array", 
      "function", 
      "information", 
      "construction", 
      "input", 
      "memory", 
      "model", 
      "Patel et al", 
      "elements", 
      "program", 
      "front", 
      "technique", 
      "Larsen", 
      "block", 
      "Nielsen", 
      "al", 
      "interest", 
      "counterparts", 
      "results", 
      "patterns", 
      "size", 
      "time", 
      "questions", 
      "compaction", 
      "logical memory", 
      "paper", 
      "tight compaction"
    ], 
    "name": "OptORAMa: Optimal Oblivious RAM", 
    "pagination": "403-432", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1127314719"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-45724-2_14"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-45724-2_14", 
      "https://app.dimensions.ai/details/publication/pub.1127314719"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:48", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_342.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-030-45724-2_14"
  }
]
 

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-030-45724-2_14'

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-030-45724-2_14'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-45724-2_14'

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-030-45724-2_14'


 

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

170 TRIPLES      23 PREDICATES      83 URIs      76 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-030-45724-2_14 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Ne6fe382b50244a8089cde2482aee5d84
4 schema:datePublished 2020-05-01
5 schema:datePublishedReg 2020-05-01
6 schema:description Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC ’87 and J. ACM ’96) is a technique for provably obfuscating programs’ access patterns, such that the access patterns leak no information about the programs’ secret inputs. To compile a general program to an oblivious counterpart, it is well-known that Ω(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varOmega (\log N)$$\end{document} amortized blowup is necessary, where N is the size of the logical memory. This was shown in Goldreich and Ostrovksy’s original ORAM work for statistical security and in a somewhat restricted model (the so called balls-and-bins model), and recently by Larsen and Nielsen (CRYPTO ’18) for computational security.A long standing open question is whether there exists an optimal ORAM construction that matches the aforementioned logarithmic lower bounds (without making large memory word assumptions, and assuming a constant number of CPU registers). In this paper, we resolve this problem and present the first secure ORAM with O(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log N)$$\end{document} amortized blowup, assuming one-way functions. Our result is inspired by and non-trivially improves on the recent beautiful work of Patel et al. (FOCS ’18) who gave a construction with O(logN·loglogN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log N\cdot \log \log N)$$\end{document} amortized blowup, assuming one-way functions.One of our building blocks of independent interest is a linear-time deterministic oblivious algorithm for tight compaction: Given an array of n elements where some elements are marked, we permute the elements in the array so that all marked elements end up in the front of the array. Our O(n) algorithm improves the previously best known deterministic or randomized algorithms whose running time is O(n·logn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n \cdot \log n)$$\end{document} or O(n·loglogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n \cdot \log \log n)$$\end{document}, respectively.
7 schema:editor Nc31859b0b4804e70b804cc008678f4cd
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Ndac45db76114467fb632817412ca3d59
12 schema:keywords Goldreich
13 Larsen
14 Nielsen
15 ORAM constructions
16 Oblivious RAM
17 Ostrovsky
18 Patel et al
19 access patterns
20 al
21 algorithm
22 array
23 beautiful work
24 block
25 blowup
26 bounds
27 building blocks
28 compaction
29 computational security
30 construction
31 counterparts
32 deterministic
33 deterministic oblivious algorithm
34 elements
35 et al
36 front
37 function
38 general program
39 ground-breaking work
40 independent interest
41 information
42 input
43 interest
44 logarithmic lower bounds
45 logical memory
46 lower bounds
47 memory
48 model
49 n elements
50 obfuscating programs
51 oblivious algorithms
52 one-way functions
53 open question
54 paper
55 patterns
56 problem
57 program
58 questions
59 rams
60 restricted model
61 results
62 secret inputs
63 security
64 size
65 statistical security
66 technique
67 tight compaction
68 time
69 work
70 schema:name OptORAMa: Optimal Oblivious RAM
71 schema:pagination 403-432
72 schema:productId Nacf8ba99a7fd40c78fe575c17ea4aaab
73 Neb4861ccd4884b23878108496490d2cb
74 schema:publisher N350ab6dc6c2d4ea0964f61227eb63b88
75 schema:sameAs https://app.dimensions.ai/details/publication/pub.1127314719
76 https://doi.org/10.1007/978-3-030-45724-2_14
77 schema:sdDatePublished 2022-05-10T10:48
78 schema:sdLicense https://scigraph.springernature.com/explorer/license/
79 schema:sdPublisher Nbfb23389dacd4a91973ff06e75635b04
80 schema:url https://doi.org/10.1007/978-3-030-45724-2_14
81 sgo:license sg:explorer/license/
82 sgo:sdDataset chapters
83 rdf:type schema:Chapter
84 N350ab6dc6c2d4ea0964f61227eb63b88 schema:name Springer Nature
85 rdf:type schema:Organisation
86 N899c2ad5fccf42a4b082027f8b9a51ef rdf:first sg:person.014706274717.52
87 rdf:rest rdf:nil
88 N8ba6130187144da89c511920bd09b48b rdf:first sg:person.015030115735.91
89 rdf:rest Nf7a905bcd9474447b44ed5fb1d41cc2f
90 N8dd59fe61ec74b27a1a212ac482117b9 rdf:first Nadb88a6ca7c54afe9d457b1a3c95e1c8
91 rdf:rest rdf:nil
92 N93616d19f571421191aded65b70c61fa rdf:first sg:person.0755702417.79
93 rdf:rest N899c2ad5fccf42a4b082027f8b9a51ef
94 Nacf8ba99a7fd40c78fe575c17ea4aaab schema:name doi
95 schema:value 10.1007/978-3-030-45724-2_14
96 rdf:type schema:PropertyValue
97 Nadb88a6ca7c54afe9d457b1a3c95e1c8 schema:familyName Ishai
98 schema:givenName Yuval
99 rdf:type schema:Person
100 Nbfb23389dacd4a91973ff06e75635b04 schema:name Springer Nature - SN SciGraph project
101 rdf:type schema:Organization
102 Nc31859b0b4804e70b804cc008678f4cd rdf:first Ne8d5a136ec354b9291e671d908907bc2
103 rdf:rest N8dd59fe61ec74b27a1a212ac482117b9
104 Ndac45db76114467fb632817412ca3d59 schema:isbn 978-3-030-45723-5
105 978-3-030-45724-2
106 schema:name Advances in Cryptology – EUROCRYPT 2020
107 rdf:type schema:Book
108 Ne1ee40981f704485946d2c036716abaa rdf:first sg:person.012204235441.12
109 rdf:rest N8ba6130187144da89c511920bd09b48b
110 Ne6fe382b50244a8089cde2482aee5d84 rdf:first sg:person.016347606461.90
111 rdf:rest Ne1ee40981f704485946d2c036716abaa
112 Ne8d5a136ec354b9291e671d908907bc2 schema:familyName Canteaut
113 schema:givenName Anne
114 rdf:type schema:Person
115 Neb4861ccd4884b23878108496490d2cb schema:name dimensions_id
116 schema:value pub.1127314719
117 rdf:type schema:PropertyValue
118 Nf7a905bcd9474447b44ed5fb1d41cc2f rdf:first sg:person.011031600672.42
119 rdf:rest N93616d19f571421191aded65b70c61fa
120 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
121 schema:name Information and Computing Sciences
122 rdf:type schema:DefinedTerm
123 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
124 schema:name Computation Theory and Mathematics
125 rdf:type schema:DefinedTerm
126 sg:person.011031600672.42 schema:affiliation grid-institutes:grid.26009.3d
127 schema:familyName Nayak
128 schema:givenName Kartik
129 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011031600672.42
130 rdf:type schema:Person
131 sg:person.012204235441.12 schema:affiliation grid-institutes:None
132 schema:familyName Komargodski
133 schema:givenName Ilan
134 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012204235441.12
135 rdf:type schema:Person
136 sg:person.014706274717.52 schema:affiliation grid-institutes:grid.5386.8
137 schema:familyName Shi
138 schema:givenName Elaine
139 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52
140 rdf:type schema:Person
141 sg:person.015030115735.91 schema:affiliation grid-institutes:grid.5386.8
142 schema:familyName Lin
143 schema:givenName Wei-Kai
144 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015030115735.91
145 rdf:type schema:Person
146 sg:person.016347606461.90 schema:affiliation grid-institutes:grid.22098.31
147 schema:familyName Asharov
148 schema:givenName Gilad
149 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016347606461.90
150 rdf:type schema:Person
151 sg:person.0755702417.79 schema:affiliation grid-institutes:grid.5608.b
152 schema:familyName Peserico
153 schema:givenName Enoch
154 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0755702417.79
155 rdf:type schema:Person
156 grid-institutes:None schema:alternateName NTT Research, 94303, Palo Alto, CA, USA
157 schema:name NTT Research, 94303, Palo Alto, CA, USA
158 rdf:type schema:Organization
159 grid-institutes:grid.22098.31 schema:alternateName Bar-Ilan University, 52900, Ramat Gan, Israel
160 schema:name Bar-Ilan University, 52900, Ramat Gan, Israel
161 rdf:type schema:Organization
162 grid-institutes:grid.26009.3d schema:alternateName Duke University, 27708, Durham, NC, USA
163 schema:name Duke University, 27708, Durham, NC, USA
164 rdf:type schema:Organization
165 grid-institutes:grid.5386.8 schema:alternateName Cornell University, 14850, Ithaca, NY, USA
166 schema:name Cornell University, 14850, Ithaca, NY, USA
167 rdf:type schema:Organization
168 grid-institutes:grid.5608.b schema:alternateName Università degli Studi di Padova, Padova, PD, Italy
169 schema:name Università degli Studi di Padova, Padova, PD, Italy
170 rdf:type schema:Organization
 




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


...