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": "IOHK, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "IOHK, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Badertscher", 
        "givenName": "Christian", 
        "id": "sg:person.010232721040.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010232721040.24"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Zurich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Zurich, 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": "ETH Zurich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Portmann", 
        "givenName": "Christopher", 
        "id": "sg:person.012175151063.55", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012175151063.55"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Zurich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rito", 
        "givenName": "Guilherme", 
        "id": "sg:person.013404447221.98", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013404447221.98"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2021-05-01", 
    "datePublishedReg": "2021-05-01", 
    "description": "This paper takes a fresh approach to systematically characterizing, comparing, and understanding CCA-type security definitions for public-key encryption (PKE), a topic with a long history. The justification for a concrete security definition X is relative to a benchmark application (e.g. confidential communication): Does the use of a PKE scheme satisfying X imply the security of the application? Because unnecessarily strong definitions may lead to unnecessarily inefficient schemes or unnecessarily strong computational assumptions, security definitions should be as weak as possible, i.e. as close as possible to (but above) the benchmark. Understanding the hierarchy of security definitions, partially ordered by the implication (i.e. at least as strong) relation, is hence important, as is placing the relevant applications as benchmark levels within the hierarchy.CCA-2 security is apparently the strongest notion, but because it is arguably too strong, Canetti, Krawczyk, and Nielsen (Crypto 2003) proposed the relaxed notions of Replayable CCA security (RCCA) as perhaps the weakest meaningful definition, and they investigated the space between CCA and RCCA security by proposing two versions of Detectable RCCA (d-RCCA) security which are meant to ensure that replays of ciphertexts are either publicly or secretly detectable (and hence preventable).The contributions of this paper are three-fold. First, following the work of Coretti, Maurer, and Tackmann (Asiacrypt 2013), we formalize the three benchmark applications of PKE that serve as the natural motivation for security notions, namely the construction of certain types of (possibly replay-protected) confidential channels (from an insecure and an authenticated communication channel). Second, we prove that RCCA does not achieve the confidentiality benchmark and, contrary to previous belief, that the proposed d-RCCA notions are not even relaxations of CCA-2 security. Third, we propose the natural security notions corresponding to the three benchmarks: an appropriately strengthened version of RCCA to ensure confidentiality, as well as two notions for capturing public and secret replay detectability.", 
    "editor": [
      {
        "familyName": "Garay", 
        "givenName": "Juan A.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-030-75248-4_7", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-030-75247-7", 
        "978-3-030-75248-4"
      ], 
      "name": "Public-Key Cryptography \u2013 PKC 2021", 
      "type": "Book"
    }, 
    "keywords": [
      "benchmark applications", 
      "stronger computational assumptions", 
      "relaxed notion", 
      "natural motivation", 
      "scheme", 
      "computational assumptions", 
      "relevant applications", 
      "stronger notion", 
      "implication relations", 
      "meaningful definition", 
      "certain types", 
      "security definitions", 
      "applications", 
      "stronger definition", 
      "inefficient schemes", 
      "benchmarks", 
      "notion", 
      "space", 
      "version", 
      "definition", 
      "assumption", 
      "hierarchy", 
      "Krawczyk", 
      "security notions", 
      "relaxation", 
      "approach", 
      "Maurer", 
      "detectability", 
      "fresh approach", 
      "public key encryption", 
      "justification", 
      "Nielsen", 
      "work", 
      "construction", 
      "confidential channel", 
      "channels", 
      "previous belief", 
      "topic", 
      "security", 
      "relation", 
      "Canetti", 
      "contribution", 
      "three-fold", 
      "encryption", 
      "long history", 
      "PKE scheme", 
      "ciphertext", 
      "motivation", 
      "types", 
      "use", 
      "replay", 
      "replay protection", 
      "levels", 
      "Replayable CCA (RCCA) security", 
      "CCA", 
      "confidentiality", 
      "benchmark levels", 
      "CCA security", 
      "RCCA security", 
      "history", 
      "Tackmann", 
      "beliefs", 
      "protection", 
      "paper"
    ], 
    "name": "Revisiting (R)CCA Security and Replay Protection", 
    "pagination": "173-202", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1137654854"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-75248-4_7"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-75248-4_7", 
      "https://app.dimensions.ai/details/publication/pub.1137654854"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:44", 
    "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_256.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-030-75248-4_7"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

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

148 TRIPLES      23 PREDICATES      89 URIs      82 LITERALS      7 BLANK NODES