Ontology type: schema:Chapter
2004
AUTHORSLea Kissner , Alina Oprea , Michael K. Reiter , Dawn Song , Ke Yang
ABSTRACTWe propose a new keyword-based Private Information Retrieval (PIR) model that allows private modification of the database from which information is requested. In our model, the database is distributed over n servers, any one of which can act as a transparent interface for clients. We present protocols that support operations for accessing data, focusing on privately appending labelled records to the database (push) and privately retrieving the next unseen record appended under a given label (pull). The communication complexity between the client and servers is independent of the number of records in the database (or more generally, the number of previous push and pull operations) and of the number of servers. Our scheme also supports access control oblivious to the database servers by implicitly including a public key in each push, so that only the party holding the private key can retrieve the record via pull. To our knowledge, this is the first system that achieves the following properties: private database modification, private retrieval of multiple records with the same keyword, and oblivious access control. We also provide a number of extensions to our protocols and, as a demonstrative application, an unlinkable anonymous communication service using them. More... »
PAGES16-30
Applied Cryptography and Network Security
ISBN
978-3-540-22217-0
978-3-540-24852-1
http://scigraph.springernature.com/pub.10.1007/978-3-540-24852-1_2
DOIhttp://dx.doi.org/10.1007/978-3-540-24852-1_2
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1053508018
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/0806",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information Systems",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Dept. of Computer Science, Carnegie Mellon University",
"id": "http://www.grid.ac/institutes/grid.147455.6",
"name": [
"Dept. of Computer Science, Carnegie Mellon University"
],
"type": "Organization"
},
"familyName": "Kissner",
"givenName": "Lea",
"id": "sg:person.010203554137.83",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010203554137.83"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Dept. of Computer Science, Carnegie Mellon University",
"id": "http://www.grid.ac/institutes/grid.147455.6",
"name": [
"Dept. of Computer Science, Carnegie Mellon University"
],
"type": "Organization"
},
"familyName": "Oprea",
"givenName": "Alina",
"id": "sg:person.015602242357.32",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015602242357.32"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Dept, of Electrical and Computer Engineering, Carnegie Mellon University",
"id": "http://www.grid.ac/institutes/grid.147455.6",
"name": [
"Dept. of Computer Science, Carnegie Mellon University",
"Dept, of Electrical and Computer Engineering, Carnegie Mellon University"
],
"type": "Organization"
},
"familyName": "Reiter",
"givenName": "Michael K.",
"id": "sg:person.01265200500.82",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01265200500.82"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Dept, of Electrical and Computer Engineering, Carnegie Mellon University",
"id": "http://www.grid.ac/institutes/grid.147455.6",
"name": [
"Dept. of Computer Science, Carnegie Mellon University",
"Dept, of Electrical and Computer Engineering, Carnegie Mellon University"
],
"type": "Organization"
},
"familyName": "Song",
"givenName": "Dawn",
"id": "sg:person.01143152610.86",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01143152610.86"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Dept. of Computer Science, Carnegie Mellon University",
"id": "http://www.grid.ac/institutes/grid.147455.6",
"name": [
"Dept. of Computer Science, Carnegie Mellon University"
],
"type": "Organization"
},
"familyName": "Yang",
"givenName": "Ke",
"id": "sg:person.012134523233.36",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012134523233.36"
],
"type": "Person"
}
],
"datePublished": "2004",
"datePublishedReg": "2004-01-01",
"description": "We propose a new keyword-based Private Information Retrieval (PIR) model that allows private modification of the database from which information is requested. In our model, the database is distributed over n servers, any one of which can act as a transparent interface for clients. We present protocols that support operations for accessing data, focusing on privately appending labelled records to the database (push) and privately retrieving the next unseen record appended under a given label (pull). The communication complexity between the client and servers is independent of the number of records in the database (or more generally, the number of previous push and pull operations) and of the number of servers. Our scheme also supports access control oblivious to the database servers by implicitly including a public key in each push, so that only the party holding the private key can retrieve the record via pull. To our knowledge, this is the first system that achieves the following properties: private database modification, private retrieval of multiple records with the same keyword, and oblivious access control. We also provide a number of extensions to our protocols and, as a demonstrative application, an unlinkable anonymous communication service using them.",
"editor": [
{
"familyName": "Jakobsson",
"givenName": "Markus",
"type": "Person"
},
{
"familyName": "Yung",
"givenName": "Moti",
"type": "Person"
},
{
"familyName": "Zhou",
"givenName": "Jianying",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-540-24852-1_2",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-540-22217-0",
"978-3-540-24852-1"
],
"name": "Applied Cryptography and Network Security",
"type": "Book"
},
"keywords": [
"access control",
"oblivious access control",
"information retrieval model",
"anonymous communication services",
"number of servers",
"private retrieval",
"database server",
"private key",
"anonymous communication",
"public key",
"database modifications",
"retrieval model",
"unseen records",
"communication services",
"number of extensions",
"server",
"communication complexity",
"same keywords",
"transparent interface",
"number of records",
"multiple records",
"demonstrative application",
"first system",
"database",
"keywords",
"clients",
"key",
"retrieval",
"protocol",
"applications",
"complexity",
"services",
"communication",
"scheme",
"labels",
"information",
"push",
"interface",
"model",
"number",
"operation",
"system",
"extension",
"records",
"parties",
"knowledge",
"data",
"control",
"modification",
"pull",
"properties"
],
"name": "Private Keyword-Based Push and Pull with Applications to Anonymous Communication",
"pagination": "16-30",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1053508018"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-540-24852-1_2"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-540-24852-1_2",
"https://app.dimensions.ai/details/publication/pub.1053508018"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:47",
"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_323.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-540-24852-1_2"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
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-540-24852-1_2'
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-540-24852-1_2'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24852-1_2'
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-540-24852-1_2'
This table displays all metadata directly associated to this object as RDF triples.
151 TRIPLES
23 PREDICATES
77 URIs
70 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/978-3-540-24852-1_2 | schema:about | anzsrc-for:08 |
2 | ″ | ″ | anzsrc-for:0806 |
3 | ″ | schema:author | Nece639c90a7c42fbae9260a810c847de |
4 | ″ | schema:datePublished | 2004 |
5 | ″ | schema:datePublishedReg | 2004-01-01 |
6 | ″ | schema:description | We propose a new keyword-based Private Information Retrieval (PIR) model that allows private modification of the database from which information is requested. In our model, the database is distributed over n servers, any one of which can act as a transparent interface for clients. We present protocols that support operations for accessing data, focusing on privately appending labelled records to the database (push) and privately retrieving the next unseen record appended under a given label (pull). The communication complexity between the client and servers is independent of the number of records in the database (or more generally, the number of previous push and pull operations) and of the number of servers. Our scheme also supports access control oblivious to the database servers by implicitly including a public key in each push, so that only the party holding the private key can retrieve the record via pull. To our knowledge, this is the first system that achieves the following properties: private database modification, private retrieval of multiple records with the same keyword, and oblivious access control. We also provide a number of extensions to our protocols and, as a demonstrative application, an unlinkable anonymous communication service using them. |
7 | ″ | schema:editor | N5e9cabec8e0f4792b167f6cd951d30da |
8 | ″ | schema:genre | chapter |
9 | ″ | schema:inLanguage | en |
10 | ″ | schema:isAccessibleForFree | false |
11 | ″ | schema:isPartOf | Nc83b7f8e0d8e4eef9fbf159d0f91a440 |
12 | ″ | schema:keywords | access control |
13 | ″ | ″ | anonymous communication |
14 | ″ | ″ | anonymous communication services |
15 | ″ | ″ | applications |
16 | ″ | ″ | clients |
17 | ″ | ″ | communication |
18 | ″ | ″ | communication complexity |
19 | ″ | ″ | communication services |
20 | ″ | ″ | complexity |
21 | ″ | ″ | control |
22 | ″ | ″ | data |
23 | ″ | ″ | database |
24 | ″ | ″ | database modifications |
25 | ″ | ″ | database server |
26 | ″ | ″ | demonstrative application |
27 | ″ | ″ | extension |
28 | ″ | ″ | first system |
29 | ″ | ″ | information |
30 | ″ | ″ | information retrieval model |
31 | ″ | ″ | interface |
32 | ″ | ″ | key |
33 | ″ | ″ | keywords |
34 | ″ | ″ | knowledge |
35 | ″ | ″ | labels |
36 | ″ | ″ | model |
37 | ″ | ″ | modification |
38 | ″ | ″ | multiple records |
39 | ″ | ″ | number |
40 | ″ | ″ | number of extensions |
41 | ″ | ″ | number of records |
42 | ″ | ″ | number of servers |
43 | ″ | ″ | oblivious access control |
44 | ″ | ″ | operation |
45 | ″ | ″ | parties |
46 | ″ | ″ | private key |
47 | ″ | ″ | private retrieval |
48 | ″ | ″ | properties |
49 | ″ | ″ | protocol |
50 | ″ | ″ | public key |
51 | ″ | ″ | pull |
52 | ″ | ″ | push |
53 | ″ | ″ | records |
54 | ″ | ″ | retrieval |
55 | ″ | ″ | retrieval model |
56 | ″ | ″ | same keywords |
57 | ″ | ″ | scheme |
58 | ″ | ″ | server |
59 | ″ | ″ | services |
60 | ″ | ″ | system |
61 | ″ | ″ | transparent interface |
62 | ″ | ″ | unseen records |
63 | ″ | schema:name | Private Keyword-Based Push and Pull with Applications to Anonymous Communication |
64 | ″ | schema:pagination | 16-30 |
65 | ″ | schema:productId | N4f30d942bd1e4656a02a5d74e57f443b |
66 | ″ | ″ | Ncd37846fabfd45778f67525882d74147 |
67 | ″ | schema:publisher | Nf67ccc90d8ef484ca89a8afbb6f44016 |
68 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1053508018 |
69 | ″ | ″ | https://doi.org/10.1007/978-3-540-24852-1_2 |
70 | ″ | schema:sdDatePublished | 2022-05-10T10:47 |
71 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
72 | ″ | schema:sdPublisher | N7f53d35278094ff59c71a30dc688c607 |
73 | ″ | schema:url | https://doi.org/10.1007/978-3-540-24852-1_2 |
74 | ″ | sgo:license | sg:explorer/license/ |
75 | ″ | sgo:sdDataset | chapters |
76 | ″ | rdf:type | schema:Chapter |
77 | N2422cca4fbd64f18936e9d5e9358ef22 | rdf:first | Nb7539db626f14509b749de098e96c50e |
78 | ″ | rdf:rest | N3859ee3b978240169a393a8f6a210488 |
79 | N3859ee3b978240169a393a8f6a210488 | rdf:first | N3c40fa2e192e432cab80128b5128b215 |
80 | ″ | rdf:rest | rdf:nil |
81 | N3c40fa2e192e432cab80128b5128b215 | schema:familyName | Zhou |
82 | ″ | schema:givenName | Jianying |
83 | ″ | rdf:type | schema:Person |
84 | N4277e92d2e7c4554b98f7fdd43bc21fe | schema:familyName | Jakobsson |
85 | ″ | schema:givenName | Markus |
86 | ″ | rdf:type | schema:Person |
87 | N4f30d942bd1e4656a02a5d74e57f443b | schema:name | dimensions_id |
88 | ″ | schema:value | pub.1053508018 |
89 | ″ | rdf:type | schema:PropertyValue |
90 | N51a5630a6db04e08a6f413ccf7bb462f | rdf:first | sg:person.01143152610.86 |
91 | ″ | rdf:rest | Nfc607daaadbd435885b07a9c5163710d |
92 | N5e9cabec8e0f4792b167f6cd951d30da | rdf:first | N4277e92d2e7c4554b98f7fdd43bc21fe |
93 | ″ | rdf:rest | N2422cca4fbd64f18936e9d5e9358ef22 |
94 | N6edc72492aa54a9ca780f33fe1576863 | rdf:first | sg:person.01265200500.82 |
95 | ″ | rdf:rest | N51a5630a6db04e08a6f413ccf7bb462f |
96 | N7f53d35278094ff59c71a30dc688c607 | schema:name | Springer Nature - SN SciGraph project |
97 | ″ | rdf:type | schema:Organization |
98 | Na677a0a0b3a74e68a5944e3371a08c7a | rdf:first | sg:person.015602242357.32 |
99 | ″ | rdf:rest | N6edc72492aa54a9ca780f33fe1576863 |
100 | Nb7539db626f14509b749de098e96c50e | schema:familyName | Yung |
101 | ″ | schema:givenName | Moti |
102 | ″ | rdf:type | schema:Person |
103 | Nc83b7f8e0d8e4eef9fbf159d0f91a440 | schema:isbn | 978-3-540-22217-0 |
104 | ″ | ″ | 978-3-540-24852-1 |
105 | ″ | schema:name | Applied Cryptography and Network Security |
106 | ″ | rdf:type | schema:Book |
107 | Ncd37846fabfd45778f67525882d74147 | schema:name | doi |
108 | ″ | schema:value | 10.1007/978-3-540-24852-1_2 |
109 | ″ | rdf:type | schema:PropertyValue |
110 | Nece639c90a7c42fbae9260a810c847de | rdf:first | sg:person.010203554137.83 |
111 | ″ | rdf:rest | Na677a0a0b3a74e68a5944e3371a08c7a |
112 | Nf67ccc90d8ef484ca89a8afbb6f44016 | schema:name | Springer Nature |
113 | ″ | rdf:type | schema:Organisation |
114 | Nfc607daaadbd435885b07a9c5163710d | rdf:first | sg:person.012134523233.36 |
115 | ″ | rdf:rest | rdf:nil |
116 | anzsrc-for:08 | schema:inDefinedTermSet | anzsrc-for: |
117 | ″ | schema:name | Information and Computing Sciences |
118 | ″ | rdf:type | schema:DefinedTerm |
119 | anzsrc-for:0806 | schema:inDefinedTermSet | anzsrc-for: |
120 | ″ | schema:name | Information Systems |
121 | ″ | rdf:type | schema:DefinedTerm |
122 | sg:person.010203554137.83 | schema:affiliation | grid-institutes:grid.147455.6 |
123 | ″ | schema:familyName | Kissner |
124 | ″ | schema:givenName | Lea |
125 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010203554137.83 |
126 | ″ | rdf:type | schema:Person |
127 | sg:person.01143152610.86 | schema:affiliation | grid-institutes:grid.147455.6 |
128 | ″ | schema:familyName | Song |
129 | ″ | schema:givenName | Dawn |
130 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01143152610.86 |
131 | ″ | rdf:type | schema:Person |
132 | sg:person.012134523233.36 | schema:affiliation | grid-institutes:grid.147455.6 |
133 | ″ | schema:familyName | Yang |
134 | ″ | schema:givenName | Ke |
135 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012134523233.36 |
136 | ″ | rdf:type | schema:Person |
137 | sg:person.01265200500.82 | schema:affiliation | grid-institutes:grid.147455.6 |
138 | ″ | schema:familyName | Reiter |
139 | ″ | schema:givenName | Michael K. |
140 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01265200500.82 |
141 | ″ | rdf:type | schema:Person |
142 | sg:person.015602242357.32 | schema:affiliation | grid-institutes:grid.147455.6 |
143 | ″ | schema:familyName | Oprea |
144 | ″ | schema:givenName | Alina |
145 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015602242357.32 |
146 | ″ | rdf:type | schema:Person |
147 | grid-institutes:grid.147455.6 | schema:alternateName | Dept, of Electrical and Computer Engineering, Carnegie Mellon University |
148 | ″ | ″ | Dept. of Computer Science, Carnegie Mellon University |
149 | ″ | schema:name | Dept, of Electrical and Computer Engineering, Carnegie Mellon University |
150 | ″ | ″ | Dept. of Computer Science, Carnegie Mellon University |
151 | ″ | rdf:type | schema:Organization |