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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, Hawthorne, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, Hawthorne, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Halevi", 
        "givenName": "Shai", 
        "id": "sg:person.015100320721.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015100320721.93"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, Hawthorne, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, Hawthorne, NY, 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": "2008-01-01", 
    "datePublishedReg": "2008-01-01", 
    "description": "What happens when you use a partially defective bit- commitment protocol to commit to the same bit many times? For example, suppose that the protocol allows the receiver to guess the committed bit with advantage , and that you used that protocol to commit to the same bit more than  times. Or suppose that you encrypted some message many times (to many people), only to discover later that the encryption scheme that you were using is partially defective, and an eavesdropper has some noticeable advantage in guessing the encrypted message from the ciphertext. Can we at least show that even after many such encryptions, the eavesdropper could not have learned the message with certainty?In this work we take another look at amplification and degradation of computational hardness. We describe a rather generic setting where one can argue about amplification or degradation of computational hardness via sequential repetition of interactive protocols, and prove that in all the cases that we consider, it behaves as one would expect from the corresponding information theoretic bounds. In particular, for the example above we can prove that after committing to the same bit for n times, the receiver\u2019s advantage in guessing the encrypted bit is negligibly close to .Our results for hardness amplification follow just by observing that some of the known proofs for Yao\u2019s lemmas can be easily extended also to handle interactive protocols. On the other hand, the question of hardness degradation was never considered before as far as we know, and we prove these results from scratch.", 
    "editor": [
      {
        "familyName": "Canetti", 
        "givenName": "Ran", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-78524-8_34", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-78523-1", 
        "978-3-540-78524-8"
      ], 
      "name": "Theory of Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "computational hardness", 
      "interactive protocol", 
      "same bit", 
      "information-theoretic bounds", 
      "such encryption", 
      "encryption scheme", 
      "theoretic bounds", 
      "bit commitment protocol", 
      "messages", 
      "bits", 
      "hardness amplification", 
      "eavesdropper", 
      "generic setting", 
      "Yao\u2019s Lemma", 
      "noticeable advantages", 
      "protocol", 
      "encryption", 
      "ciphertext", 
      "advantages", 
      "scratch", 
      "scheme", 
      "example", 
      "proof", 
      "time", 
      "bounds", 
      "lemma", 
      "work", 
      "receiver", 
      "results", 
      "sequential repetition", 
      "look", 
      "hand", 
      "setting", 
      "hardness degradation", 
      "certainty", 
      "questions", 
      "repetition", 
      "cases", 
      "degradation", 
      "hardness", 
      "amplification"
    ], 
    "name": "Degradation and Amplification of Computational Hardness", 
    "pagination": "626-643", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1022842874"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-78524-8_34"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-78524-8_34", 
      "https://app.dimensions.ai/details/publication/pub.1022842874"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:41", 
    "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_115.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-78524-8_34"
  }
]

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.

108 TRIPLES      23 PREDICATES      66 URIs      59 LITERALS      7 BLANK NODES