An Hierarchical Threshold Scheme with Unique Partial Keys View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1996

AUTHORS

Hannes Hassler , Vesna Hassler , Reinhard Posch

ABSTRACT

We will present an extension of Shamir’s threshold scheme (Shamir 1979). Shamir’s scheme demonstrates how to divide a master key D into n pieces so that it is easily reconstructed from any k pieces, where even complete knowledge of k — 1 pieces reveals nothing about D. Shamir calls it a (k,n) threshold scheme. We propose a method that enables the creation of hierarchical information threshold schemes with s security levels, so that kl partial keys (shares) are required for computation of a master key Dl for level l. The higher the security level, the more partial keys required. We call our scheme a (kl, s,n) multithreshold scheme, l =1,…,s. More... »

PAGES

219-226

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-1-5041-2919-0_19

DOI

http://dx.doi.org/10.1007/978-1-5041-2919-0_19

DIMENSIONS

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


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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria", 
          "id": "http://www.grid.ac/institutes/grid.410413.3", 
          "name": [
            "Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hassler", 
        "givenName": "Hannes", 
        "id": "sg:person.013761354111.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013761354111.24"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria", 
          "id": "http://www.grid.ac/institutes/grid.410413.3", 
          "name": [
            "Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hassler", 
        "givenName": "Vesna", 
        "id": "sg:person.016626361111.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016626361111.21"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria", 
          "id": "http://www.grid.ac/institutes/grid.410413.3", 
          "name": [
            "Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Posch", 
        "givenName": "Reinhard", 
        "id": "sg:person.011236005071.18", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011236005071.18"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1996", 
    "datePublishedReg": "1996-01-01", 
    "description": "We will present an extension of Shamir\u2019s threshold scheme (Shamir 1979). Shamir\u2019s scheme demonstrates how to divide a master key D into n pieces so that it is easily reconstructed from any k pieces, where even complete knowledge of k \u2014 1 pieces reveals nothing about D. Shamir calls it a (k,n) threshold scheme. We propose a method that enables the creation of hierarchical information threshold schemes with s security levels, so that kl partial keys (shares) are required for computation of a master key Dl for level l. The higher the security level, the more partial keys required. We call our scheme a (kl, s,n) multithreshold scheme, l =1,\u2026,s.", 
    "editor": [
      {
        "familyName": "Katsikas", 
        "givenName": "Sokratis K.", 
        "type": "Person"
      }, 
      {
        "familyName": "Gritzalis", 
        "givenName": "Dimitris", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-1-5041-2919-0_19", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-1-5041-2921-3", 
        "978-1-5041-2919-0"
      ], 
      "name": "Information Systems Security", 
      "type": "Book"
    }, 
    "keywords": [
      "threshold scheme", 
      "partial keys", 
      "security level", 
      "Shamir threshold scheme", 
      "Shamir's scheme", 
      "level l.", 
      "scheme", 
      "complete knowledge", 
      "key", 
      "Shamir", 
      "computation", 
      "pieces", 
      "creation", 
      "extension", 
      "knowledge", 
      "method", 
      "levels", 
      "dl", 
      "L.", 
      "master key D", 
      "key D", 
      "hierarchical information threshold schemes", 
      "information threshold schemes", 
      "master key Dl", 
      "key Dl", 
      "multithreshold scheme", 
      "Hierarchical Threshold Scheme", 
      "Unique Partial Keys"
    ], 
    "name": "An Hierarchical Threshold Scheme with Unique Partial Keys", 
    "pagination": "219-226", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1003900026"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-5041-2919-0_19"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-5041-2919-0_19", 
      "https://app.dimensions.ai/details/publication/pub.1003900026"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:11", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_190.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-1-5041-2919-0_19"
  }
]
 

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-1-5041-2919-0_19'

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-1-5041-2919-0_19'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-1-5041-2919-0_19'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-1-5041-2919-0_19'


 

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

107 TRIPLES      23 PREDICATES      54 URIs      47 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-1-5041-2919-0_19 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N8ef08bacff7b47679c0efb01f0a3d0b5
4 schema:datePublished 1996
5 schema:datePublishedReg 1996-01-01
6 schema:description We will present an extension of Shamir’s threshold scheme (Shamir 1979). Shamir’s scheme demonstrates how to divide a master key D into n pieces so that it is easily reconstructed from any k pieces, where even complete knowledge of k — 1 pieces reveals nothing about D. Shamir calls it a (k,n) threshold scheme. We propose a method that enables the creation of hierarchical information threshold schemes with s security levels, so that kl partial keys (shares) are required for computation of a master key Dl for level l. The higher the security level, the more partial keys required. We call our scheme a (kl, s,n) multithreshold scheme, l =1,…,s.
7 schema:editor Ncbe9a978af4743ab94c7e129f5fd6c33
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N5da548bdf5b74903b4554cb9871403ed
12 schema:keywords Hierarchical Threshold Scheme
13 L.
14 Shamir
15 Shamir threshold scheme
16 Shamir's scheme
17 Unique Partial Keys
18 complete knowledge
19 computation
20 creation
21 dl
22 extension
23 hierarchical information threshold schemes
24 information threshold schemes
25 key
26 key D
27 key Dl
28 knowledge
29 level l.
30 levels
31 master key D
32 master key Dl
33 method
34 multithreshold scheme
35 partial keys
36 pieces
37 scheme
38 security level
39 threshold scheme
40 schema:name An Hierarchical Threshold Scheme with Unique Partial Keys
41 schema:pagination 219-226
42 schema:productId N0cbff34dd4434e1db6c9cafbdcae2d26
43 Ndca4bee163c541e7bdda47fb6765c144
44 schema:publisher N09dae45539da45dfb5ce0bb3def0a38f
45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003900026
46 https://doi.org/10.1007/978-1-5041-2919-0_19
47 schema:sdDatePublished 2022-01-01T19:11
48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
49 schema:sdPublisher N8f74555b045a4012a56887cfe3858e45
50 schema:url https://doi.org/10.1007/978-1-5041-2919-0_19
51 sgo:license sg:explorer/license/
52 sgo:sdDataset chapters
53 rdf:type schema:Chapter
54 N09dae45539da45dfb5ce0bb3def0a38f schema:name Springer Nature
55 rdf:type schema:Organisation
56 N0cbff34dd4434e1db6c9cafbdcae2d26 schema:name dimensions_id
57 schema:value pub.1003900026
58 rdf:type schema:PropertyValue
59 N1e0fb5a883724fbfae18b74ae55dbc3c schema:familyName Katsikas
60 schema:givenName Sokratis K.
61 rdf:type schema:Person
62 N5da548bdf5b74903b4554cb9871403ed schema:isbn 978-1-5041-2919-0
63 978-1-5041-2921-3
64 schema:name Information Systems Security
65 rdf:type schema:Book
66 N69c78db836e14fd8be95a34d27f844c9 schema:familyName Gritzalis
67 schema:givenName Dimitris
68 rdf:type schema:Person
69 N6f95d298383e4754b026aac86b275606 rdf:first sg:person.011236005071.18
70 rdf:rest rdf:nil
71 N789562707a8c4ba1889bd829733ab760 rdf:first N69c78db836e14fd8be95a34d27f844c9
72 rdf:rest rdf:nil
73 N791548100e8f4819bf789d390692aec1 rdf:first sg:person.016626361111.21
74 rdf:rest N6f95d298383e4754b026aac86b275606
75 N8ef08bacff7b47679c0efb01f0a3d0b5 rdf:first sg:person.013761354111.24
76 rdf:rest N791548100e8f4819bf789d390692aec1
77 N8f74555b045a4012a56887cfe3858e45 schema:name Springer Nature - SN SciGraph project
78 rdf:type schema:Organization
79 Ncbe9a978af4743ab94c7e129f5fd6c33 rdf:first N1e0fb5a883724fbfae18b74ae55dbc3c
80 rdf:rest N789562707a8c4ba1889bd829733ab760
81 Ndca4bee163c541e7bdda47fb6765c144 schema:name doi
82 schema:value 10.1007/978-1-5041-2919-0_19
83 rdf:type schema:PropertyValue
84 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
85 schema:name Information and Computing Sciences
86 rdf:type schema:DefinedTerm
87 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
88 schema:name Data Format
89 rdf:type schema:DefinedTerm
90 sg:person.011236005071.18 schema:affiliation grid-institutes:grid.410413.3
91 schema:familyName Posch
92 schema:givenName Reinhard
93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011236005071.18
94 rdf:type schema:Person
95 sg:person.013761354111.24 schema:affiliation grid-institutes:grid.410413.3
96 schema:familyName Hassler
97 schema:givenName Hannes
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013761354111.24
99 rdf:type schema:Person
100 sg:person.016626361111.21 schema:affiliation grid-institutes:grid.410413.3
101 schema:familyName Hassler
102 schema:givenName Vesna
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016626361111.21
104 rdf:type schema:Person
105 grid-institutes:grid.410413.3 schema:alternateName Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria
106 schema:name Graz University of Technology, Institute for Applied Information Processing and Communications, Klosterwiesgasse 32/I, A-8010, Graz, Austria
107 rdf:type schema:Organization
 




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


...