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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Eindhoven University of Technology, The Netherlands", 
          "id": "http://www.grid.ac/institutes/grid.6852.9", 
          "name": [
            "Eindhoven University of Technology, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chatzikokolakis", 
        "givenName": "Konstantinos", 
        "id": "sg:person.011335525015.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011335525015.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Oxford Computing Laboratory, UK", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Oxford Computing Laboratory, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Norman", 
        "givenName": "Gethin", 
        "id": "sg:person.016323171577.36", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016323171577.36"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Oxford Computing Laboratory, UK", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Oxford Computing Laboratory, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Parker", 
        "givenName": "David", 
        "id": "sg:person.014007552600.37", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014007552600.37"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2009", 
    "datePublishedReg": "2009-01-01", 
    "description": "Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the process and collaborates with the attacker can allow him to distinguish two processes even though they are bisimilar. This phenomenon is related to the issue that bisimilarity is not preserved by refinement. As a solution, we introduce a finer variant of bisimulation in which processes are required to simulate each other under the \u201csame\u201d scheduler. We formalize this notion in a variant of CCS with explicit schedulers and show that this new bisimilarity can be characterized by a refinement-preserving traditional bisimilarity. Using a third characterization of this equivalence, we show how to verify it for finite systems. We then apply the new equivalence to anonymity and show that it implies strong probabilistic anonymity, while the traditional bisimulation does not. Finally, to illustrate the usefulness of our approach, we perform a compositional analysis of the Dining Cryptographers with a non-deterministic order of announcements and for an arbitrary number of cryptographers.", 
    "editor": [
      {
        "familyName": "de Alfaro", 
        "givenName": "Luca", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-00596-1_23", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-00595-4", 
        "978-3-642-00596-1"
      ], 
      "name": "Foundations of Software Science and Computational Structures", 
      "type": "Book"
    }, 
    "keywords": [
      "process", 
      "successful method", 
      "information", 
      "variants", 
      "notion", 
      "equivalence", 
      "certain cases", 
      "cases", 
      "collaborate", 
      "phenomenon", 
      "issues", 
      "anonymity", 
      "usefulness", 
      "full information", 
      "approach", 
      "number", 
      "method", 
      "refinement", 
      "analysis", 
      "order", 
      "announcements", 
      "characterization", 
      "system", 
      "properties", 
      "compositional analysis", 
      "attacker", 
      "CCS", 
      "third characterization", 
      "finite systems", 
      "new equivalence", 
      "arbitrary number", 
      "bisimulation", 
      "scheduler", 
      "bisimilarity", 
      "solution", 
      "probabilistic anonymity", 
      "Dining Cryptographers", 
      "cryptographers", 
      "security properties", 
      "finer variant", 
      "variant of CCS", 
      "explicit scheduler", 
      "non-deterministic order"
    ], 
    "name": "Bisimulation for Demonic Schedulers", 
    "pagination": "318-332", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1006002399"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-00596-1_23"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-00596-1_23", 
      "https://app.dimensions.ai/details/publication/pub.1006002399"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:42", 
    "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_230.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-00596-1_23"
  }
]

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.

120 TRIPLES      23 PREDICATES      69 URIs      62 LITERALS      7 BLANK NODES