A Constructive Perspective on Key Encapsulation View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2013

AUTHORS

Sandro Coretti , Ueli Maurer , Björn Tackmann

ABSTRACT

A key-encapsulation mechanism (KEM) is a cryptographic primitive that allows anyone in possession of some party’s public key to securely transmit a key to that party. A KEM can be viewed as a key-exchange protocol in which only a single message is transmitted; the main application is in combination with symmetric encryption to achieve public-key encryption of messages of arbitrary length.The security of KEMs is usually defined in terms of a certain game that no efficient adversary can win with non-negligible advantage. A main drawback of game-based definitions is that they often do not have clear semantics, and that the security of each higher-level protocol that makes use of KEMs needs to be proved by showing a tailor-made security reduction from breaking the security of the KEM to breaking the security of the combined protocol.We propose a novel approach to the security and applications of KEMs, following the constructive cryptography paradigm by Maurer and Renner (ICS 2011). The goal of a KEM is to construct a resource that models a shared key available to the honest parties. This resource can be used in designing and proving higher-level protocols; the composition theorem guarantees the security of the combined protocol without the need for a specific reduction. More... »

PAGES

226-239

Book

TITLE

ISBN

978-3-642-42000-9
978-3-642-42001-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-42001-6_16

DOI

http://dx.doi.org/10.1007/978-3-642-42001-6_16

DIMENSIONS

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


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": "Department of Computer Science, ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Coretti", 
        "givenName": "Sandro", 
        "id": "sg:person.0756652750.76", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0756652750.76"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maurer", 
        "givenName": "Ueli", 
        "id": "sg:person.01316567627.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tackmann", 
        "givenName": "Bj\u00f6rn", 
        "id": "sg:person.07617171521.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "A key-encapsulation mechanism (KEM) is a cryptographic primitive that allows anyone in possession of some party\u2019s public key to securely transmit a key to that party. A KEM can be viewed as a key-exchange protocol in which only a single message is transmitted; the main application is in combination with symmetric encryption to achieve public-key encryption of messages of arbitrary length.The security of KEMs is usually defined in terms of a certain game that no efficient adversary can win with non-negligible advantage. A main drawback of game-based definitions is that they often do not have clear semantics, and that the security of each higher-level protocol that makes use of KEMs needs to be proved by showing a tailor-made security reduction from breaking the security of the KEM to breaking the security of the combined protocol.We propose a novel approach to the security and applications of KEMs, following the constructive cryptography paradigm by Maurer and Renner\u00a0(ICS 2011). The goal of a KEM is to construct a resource that models a shared key available to the honest parties. This resource can be used in designing and proving higher-level protocols; the composition theorem guarantees the security of the combined protocol without the need for a specific reduction.", 
    "editor": [
      {
        "familyName": "Fischlin", 
        "givenName": "Marc", 
        "type": "Person"
      }, 
      {
        "familyName": "Katzenbeisser", 
        "givenName": "Stefan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-42001-6_16", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-42000-9", 
        "978-3-642-42001-6"
      ], 
      "name": "\u2018", 
      "type": "Book"
    }, 
    "keywords": [
      "key encapsulation mechanism", 
      "higher-level protocols", 
      "public key", 
      "public key encryption", 
      "game-based definition", 
      "key exchange protocol", 
      "symmetric encryption", 
      "non-negligible advantage", 
      "cryptographic primitives", 
      "clear semantics", 
      "key encapsulation", 
      "efficient adversary", 
      "security reduction", 
      "honest parties", 
      "single message", 
      "security", 
      "composition theorem", 
      "encryption", 
      "novel approach", 
      "arbitrary length", 
      "certain games", 
      "main drawback", 
      "main applications", 
      "messages", 
      "key", 
      "protocol", 
      "adversary", 
      "primitives", 
      "semantics", 
      "resources", 
      "applications", 
      "constructive perspective", 
      "game", 
      "paradigm", 
      "parties", 
      "drawbacks", 
      "Maurer", 
      "need", 
      "advantages", 
      "goal", 
      "definition", 
      "terms", 
      "use", 
      "perspective", 
      "combination", 
      "Renner", 
      "theorem", 
      "possession", 
      "mechanism", 
      "encapsulation", 
      "reduction", 
      "length", 
      "specific reduction", 
      "approach"
    ], 
    "name": "A Constructive Perspective on Key Encapsulation", 
    "pagination": "226-239", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1038803253"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-42001-6_16"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-42001-6_16", 
      "https://app.dimensions.ai/details/publication/pub.1038803253"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:46", 
    "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_368.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-42001-6_16"
  }
]
 

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-642-42001-6_16'

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-642-42001-6_16'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-42001-6_16'

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-642-42001-6_16'


 

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

133 TRIPLES      23 PREDICATES      80 URIs      73 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-42001-6_16 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N2174dd4057cd4b5086ce59106b703aaf
4 schema:datePublished 2013
5 schema:datePublishedReg 2013-01-01
6 schema:description A key-encapsulation mechanism (KEM) is a cryptographic primitive that allows anyone in possession of some party’s public key to securely transmit a key to that party. A KEM can be viewed as a key-exchange protocol in which only a single message is transmitted; the main application is in combination with symmetric encryption to achieve public-key encryption of messages of arbitrary length.The security of KEMs is usually defined in terms of a certain game that no efficient adversary can win with non-negligible advantage. A main drawback of game-based definitions is that they often do not have clear semantics, and that the security of each higher-level protocol that makes use of KEMs needs to be proved by showing a tailor-made security reduction from breaking the security of the KEM to breaking the security of the combined protocol.We propose a novel approach to the security and applications of KEMs, following the constructive cryptography paradigm by Maurer and Renner (ICS 2011). The goal of a KEM is to construct a resource that models a shared key available to the honest parties. This resource can be used in designing and proving higher-level protocols; the composition theorem guarantees the security of the combined protocol without the need for a specific reduction.
7 schema:editor Nf81c3fa923e544748f2561095386474e
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N6102c48668554e3a9a6b5d22560bd50f
12 schema:keywords Maurer
13 Renner
14 advantages
15 adversary
16 applications
17 approach
18 arbitrary length
19 certain games
20 clear semantics
21 combination
22 composition theorem
23 constructive perspective
24 cryptographic primitives
25 definition
26 drawbacks
27 efficient adversary
28 encapsulation
29 encryption
30 game
31 game-based definition
32 goal
33 higher-level protocols
34 honest parties
35 key
36 key encapsulation
37 key encapsulation mechanism
38 key exchange protocol
39 length
40 main applications
41 main drawback
42 mechanism
43 messages
44 need
45 non-negligible advantage
46 novel approach
47 paradigm
48 parties
49 perspective
50 possession
51 primitives
52 protocol
53 public key
54 public key encryption
55 reduction
56 resources
57 security
58 security reduction
59 semantics
60 single message
61 specific reduction
62 symmetric encryption
63 terms
64 theorem
65 use
66 schema:name A Constructive Perspective on Key Encapsulation
67 schema:pagination 226-239
68 schema:productId N41eef303e80545b890e918f67ac58cb8
69 Nd190731f1bf74c1dbf1a8b0b0f3e0034
70 schema:publisher N298a6e29f122417e89a66f8d130e61d2
71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038803253
72 https://doi.org/10.1007/978-3-642-42001-6_16
73 schema:sdDatePublished 2022-05-20T07:46
74 schema:sdLicense https://scigraph.springernature.com/explorer/license/
75 schema:sdPublisher N024e9611f2f5425993a8e0244089885d
76 schema:url https://doi.org/10.1007/978-3-642-42001-6_16
77 sgo:license sg:explorer/license/
78 sgo:sdDataset chapters
79 rdf:type schema:Chapter
80 N024e9611f2f5425993a8e0244089885d schema:name Springer Nature - SN SciGraph project
81 rdf:type schema:Organization
82 N2174dd4057cd4b5086ce59106b703aaf rdf:first sg:person.0756652750.76
83 rdf:rest Nc87017da1f304249bbea72272a619f5b
84 N298a6e29f122417e89a66f8d130e61d2 schema:name Springer Nature
85 rdf:type schema:Organisation
86 N414987c7931f404e87e713806023b0e9 schema:familyName Fischlin
87 schema:givenName Marc
88 rdf:type schema:Person
89 N41eef303e80545b890e918f67ac58cb8 schema:name doi
90 schema:value 10.1007/978-3-642-42001-6_16
91 rdf:type schema:PropertyValue
92 N4428b14a7aa34ec5a81619ec744ec3a2 rdf:first Nfc68142724b046c7b987a0d6d1b5a596
93 rdf:rest rdf:nil
94 N6102c48668554e3a9a6b5d22560bd50f schema:isbn 978-3-642-42000-9
95 978-3-642-42001-6
96 schema:name
97 rdf:type schema:Book
98 N95e8c1fcc96c4edaba22f7e35b5aebfe rdf:first sg:person.07617171521.69
99 rdf:rest rdf:nil
100 Nc87017da1f304249bbea72272a619f5b rdf:first sg:person.01316567627.91
101 rdf:rest N95e8c1fcc96c4edaba22f7e35b5aebfe
102 Nd190731f1bf74c1dbf1a8b0b0f3e0034 schema:name dimensions_id
103 schema:value pub.1038803253
104 rdf:type schema:PropertyValue
105 Nf81c3fa923e544748f2561095386474e rdf:first N414987c7931f404e87e713806023b0e9
106 rdf:rest N4428b14a7aa34ec5a81619ec744ec3a2
107 Nfc68142724b046c7b987a0d6d1b5a596 schema:familyName Katzenbeisser
108 schema:givenName Stefan
109 rdf:type schema:Person
110 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
111 schema:name Information and Computing Sciences
112 rdf:type schema:DefinedTerm
113 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
114 schema:name Data Format
115 rdf:type schema:DefinedTerm
116 sg:person.01316567627.91 schema:affiliation grid-institutes:grid.5801.c
117 schema:familyName Maurer
118 schema:givenName Ueli
119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91
120 rdf:type schema:Person
121 sg:person.0756652750.76 schema:affiliation grid-institutes:grid.5801.c
122 schema:familyName Coretti
123 schema:givenName Sandro
124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0756652750.76
125 rdf:type schema:Person
126 sg:person.07617171521.69 schema:affiliation grid-institutes:grid.5801.c
127 schema:familyName Tackmann
128 schema:givenName Björn
129 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69
130 rdf:type schema:Person
131 grid-institutes:grid.5801.c schema:alternateName Department of Computer Science, ETH Zürich, Switzerland
132 schema:name Department of Computer Science, ETH Zürich, Switzerland
133 rdf:type schema:Organization
 




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


...