Secure distributed storage and retrieval View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1997

AUTHORS

Juan A. Garay , Rosario Gennaro , Charanjit Jutla , Tal Rabin

ABSTRACT

In his well-known Information Dispersal Algorithm paper, Rabin showed a way to distribute information among n processors in such a way that recovery of the information is possible in the presence of up to t inactive processors. An enhanced mechanism to enable construction in the presence of malicious faults, which can intentionally modify their shares of the information, was later presented by Krawczyk. Yet, this method assumed that the malicious faults occur only at reconstruction time. In this paper we address the more general problem of secure storage and retrieval of information (SSRI), and guarantee that also the process of storing the information is correct even when some of the processors fail. Our protocols achieve this while maintaining the (asymptotical) space optimality of the above methods. We also consider SSRI with the added requirement of confidentiality, by which no party except for the rightful owner of the information is able to learn anything about it. This is achieved through novel applications of cryptographic techniques, such as the distributed generation of receipts, distributed key management via threshold cryptography, and “blinding.” An interesting byproduct of our scheme is the construction of a secret sharing scheme with shorter shares size in the amortized sense. An immediate practical application of our work is a system for the secure deposit of sensitive data. More... »

PAGES

275-289

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bfb0030690

DOI

http://dx.doi.org/10.1007/bfb0030690

DIMENSIONS

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


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"
      }, 
      {
        "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"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Garay", 
        "givenName": "Juan A.", 
        "id": "sg:person.015655737162.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015655737162.07"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gennaro", 
        "givenName": "Rosario", 
        "id": "sg:person.013573255563.35", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jutla", 
        "givenName": "Charanjit", 
        "id": "sg:person.010304550767.20", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010304550767.20"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rabin", 
        "givenName": "Tal", 
        "id": "sg:person.015473523512.58", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1997", 
    "datePublishedReg": "1997-01-01", 
    "description": "In his well-known Information Dispersal Algorithm paper, Rabin showed a way to distribute information among n processors in such a way that recovery of the information is possible in the presence of up to t inactive processors. An enhanced mechanism to enable construction in the presence of malicious faults, which can intentionally modify their shares of the information, was later presented by Krawczyk. Yet, this method assumed that the malicious faults occur only at reconstruction time. In this paper we address the more general problem of secure storage and retrieval of information (SSRI), and guarantee that also the process of storing the information is correct even when some of the processors fail. Our protocols achieve this while maintaining the (asymptotical) space optimality of the above methods. We also consider SSRI with the added requirement of confidentiality, by which no party except for the rightful owner of the information is able to learn anything about it. This is achieved through novel applications of cryptographic techniques, such as the distributed generation of receipts, distributed key management via threshold cryptography, and \u201cblinding.\u201d An interesting byproduct of our scheme is the construction of a secret sharing scheme with shorter shares size in the amortized sense. An immediate practical application of our work is a system for the secure deposit of sensitive data.", 
    "editor": [
      {
        "familyName": "Mavronicolas", 
        "givenName": "Marios", 
        "type": "Person"
      }, 
      {
        "familyName": "Tsigas", 
        "givenName": "Philippas", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0030690", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-63575-8", 
        "978-3-540-69600-1"
      ], 
      "name": "Distributed Algorithms", 
      "type": "Book"
    }, 
    "keywords": [
      "malicious faults", 
      "shorter shares size", 
      "secret sharing scheme", 
      "requirements of confidentiality", 
      "retrieval of information", 
      "cryptographic techniques", 
      "threshold cryptography", 
      "key management", 
      "sensitive data", 
      "secure storage", 
      "sharing scheme", 
      "share size", 
      "reconstruction time", 
      "space optimality", 
      "processors", 
      "rightful owner", 
      "retrieval", 
      "enhanced mechanism", 
      "information", 
      "general problem", 
      "novel application", 
      "scheme", 
      "cryptography", 
      "immediate practical application", 
      "interesting byproduct", 
      "Distributed Generation", 
      "above methods", 
      "confidentiality", 
      "practical applications", 
      "Krawczyk", 
      "applications", 
      "faults", 
      "storage", 
      "optimality", 
      "requirements", 
      "Rabin", 
      "way", 
      "protocol", 
      "method", 
      "owners", 
      "construction", 
      "system", 
      "technique", 
      "parties", 
      "work", 
      "management", 
      "data", 
      "generation", 
      "process", 
      "time", 
      "share", 
      "sense", 
      "size", 
      "mechanism", 
      "receipt", 
      "recovery", 
      "byproducts", 
      "presence", 
      "paper", 
      "problem", 
      "deposits", 
      "SSRIs"
    ], 
    "name": "Secure distributed storage and retrieval", 
    "pagination": "275-289", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1025846391"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0030690"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0030690", 
      "https://app.dimensions.ai/details/publication/pub.1025846391"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:47", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_377.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0030690"
  }
]
 

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/bfb0030690'

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/bfb0030690'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bfb0030690'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bfb0030690'


 

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

156 TRIPLES      23 PREDICATES      90 URIs      81 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bfb0030690 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 anzsrc-for:0803
4 anzsrc-for:0804
5 schema:author N83d842305c6e49ba8e7ae5487857fe38
6 schema:datePublished 1997
7 schema:datePublishedReg 1997-01-01
8 schema:description In his well-known Information Dispersal Algorithm paper, Rabin showed a way to distribute information among n processors in such a way that recovery of the information is possible in the presence of up to t inactive processors. An enhanced mechanism to enable construction in the presence of malicious faults, which can intentionally modify their shares of the information, was later presented by Krawczyk. Yet, this method assumed that the malicious faults occur only at reconstruction time. In this paper we address the more general problem of secure storage and retrieval of information (SSRI), and guarantee that also the process of storing the information is correct even when some of the processors fail. Our protocols achieve this while maintaining the (asymptotical) space optimality of the above methods. We also consider SSRI with the added requirement of confidentiality, by which no party except for the rightful owner of the information is able to learn anything about it. This is achieved through novel applications of cryptographic techniques, such as the distributed generation of receipts, distributed key management via threshold cryptography, and “blinding.” An interesting byproduct of our scheme is the construction of a secret sharing scheme with shorter shares size in the amortized sense. An immediate practical application of our work is a system for the secure deposit of sensitive data.
9 schema:editor Nbc81f74ffdb145d0953a6205fc29bb1c
10 schema:genre chapter
11 schema:inLanguage en
12 schema:isAccessibleForFree false
13 schema:isPartOf Nf651b3611877407dbcdf986e22658b72
14 schema:keywords Distributed Generation
15 Krawczyk
16 Rabin
17 SSRIs
18 above methods
19 applications
20 byproducts
21 confidentiality
22 construction
23 cryptographic techniques
24 cryptography
25 data
26 deposits
27 enhanced mechanism
28 faults
29 general problem
30 generation
31 immediate practical application
32 information
33 interesting byproduct
34 key management
35 malicious faults
36 management
37 mechanism
38 method
39 novel application
40 optimality
41 owners
42 paper
43 parties
44 practical applications
45 presence
46 problem
47 process
48 processors
49 protocol
50 receipt
51 reconstruction time
52 recovery
53 requirements
54 requirements of confidentiality
55 retrieval
56 retrieval of information
57 rightful owner
58 scheme
59 secret sharing scheme
60 secure storage
61 sense
62 sensitive data
63 share
64 share size
65 sharing scheme
66 shorter shares size
67 size
68 space optimality
69 storage
70 system
71 technique
72 threshold cryptography
73 time
74 way
75 work
76 schema:name Secure distributed storage and retrieval
77 schema:pagination 275-289
78 schema:productId N66444e701d104a0db6f839dc3ab9b4b7
79 Nb8d4913e4cc64fe09cc9a4fc4205db3c
80 schema:publisher Nffb608295a17421e8819cd1eaf15a4b5
81 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025846391
82 https://doi.org/10.1007/bfb0030690
83 schema:sdDatePublished 2022-05-20T07:47
84 schema:sdLicense https://scigraph.springernature.com/explorer/license/
85 schema:sdPublisher N167477e9152449a9a6898f08a4a74418
86 schema:url https://doi.org/10.1007/bfb0030690
87 sgo:license sg:explorer/license/
88 sgo:sdDataset chapters
89 rdf:type schema:Chapter
90 N167477e9152449a9a6898f08a4a74418 schema:name Springer Nature - SN SciGraph project
91 rdf:type schema:Organization
92 N3c2600fe373446fdaf610b528db5ead3 rdf:first sg:person.013573255563.35
93 rdf:rest N555ab61d708a41ab828551689e883eaf
94 N538ff8e5d8e440188840c0917b92048f schema:familyName Mavronicolas
95 schema:givenName Marios
96 rdf:type schema:Person
97 N555ab61d708a41ab828551689e883eaf rdf:first sg:person.010304550767.20
98 rdf:rest Ne89230c43b594c00b19a4ed109c0d622
99 N66444e701d104a0db6f839dc3ab9b4b7 schema:name doi
100 schema:value 10.1007/bfb0030690
101 rdf:type schema:PropertyValue
102 N73f79f53972a4cd4ad0e72dce926c696 rdf:first Ne866387652634b23aa9719e2ad708c7d
103 rdf:rest rdf:nil
104 N83d842305c6e49ba8e7ae5487857fe38 rdf:first sg:person.015655737162.07
105 rdf:rest N3c2600fe373446fdaf610b528db5ead3
106 Nb8d4913e4cc64fe09cc9a4fc4205db3c schema:name dimensions_id
107 schema:value pub.1025846391
108 rdf:type schema:PropertyValue
109 Nbc81f74ffdb145d0953a6205fc29bb1c rdf:first N538ff8e5d8e440188840c0917b92048f
110 rdf:rest N73f79f53972a4cd4ad0e72dce926c696
111 Ne866387652634b23aa9719e2ad708c7d schema:familyName Tsigas
112 schema:givenName Philippas
113 rdf:type schema:Person
114 Ne89230c43b594c00b19a4ed109c0d622 rdf:first sg:person.015473523512.58
115 rdf:rest rdf:nil
116 Nf651b3611877407dbcdf986e22658b72 schema:isbn 978-3-540-63575-8
117 978-3-540-69600-1
118 schema:name Distributed Algorithms
119 rdf:type schema:Book
120 Nffb608295a17421e8819cd1eaf15a4b5 schema:name Springer Nature
121 rdf:type schema:Organisation
122 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
123 schema:name Information and Computing Sciences
124 rdf:type schema:DefinedTerm
125 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
126 schema:name Computation Theory and Mathematics
127 rdf:type schema:DefinedTerm
128 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
129 schema:name Computer Software
130 rdf:type schema:DefinedTerm
131 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
132 schema:name Data Format
133 rdf:type schema:DefinedTerm
134 sg:person.010304550767.20 schema:affiliation grid-institutes:grid.481554.9
135 schema:familyName Jutla
136 schema:givenName Charanjit
137 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010304550767.20
138 rdf:type schema:Person
139 sg:person.013573255563.35 schema:affiliation grid-institutes:grid.481554.9
140 schema:familyName Gennaro
141 schema:givenName Rosario
142 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35
143 rdf:type schema:Person
144 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
145 schema:familyName Rabin
146 schema:givenName Tal
147 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
148 rdf:type schema:Person
149 sg:person.015655737162.07 schema:affiliation grid-institutes:grid.481554.9
150 schema:familyName Garay
151 schema:givenName Juan A.
152 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015655737162.07
153 rdf:type schema:Person
154 grid-institutes:grid.481554.9 schema:alternateName IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA
155 schema:name IBM T.J. Watson Research Center, PO Box 704, NY 10598, Yorktown Heights, USA
156 rdf:type schema:Organization
 




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


...