Universal Composition with Joint State View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2003

AUTHORS

Ran Canetti , Tal Rabin

ABSTRACT

Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples include systems where multiple protocol instances use the same public-key infrastructure, or the same common reference string.) Rather than attempting to analyze the entire system as a single unit, we would like to be able to analyze each such protocol instance as stand-alone, and then use a general composition theorem to deduce the security of the entire system. However, no known composition theorem applies in this setting, since they all assume that the composed protocol instances have disjoint internal states, and that the internal random choices in the various executions are independent. We propose a new composition operation that can handle the case where different components have some amount of joint state and randomness, and demonstrate sufficient conditions for when the new operation preserves security. The new operation, which is called universal composition with joint state (and is based on the recently proposed universal composition operation), turns out to be very useful in a number of quite different scenarios such as those mentioned above. More... »

PAGES

265-281

Book

TITLE

Advances in Cryptology - CRYPTO 2003

ISBN

978-3-540-40674-7
978-3-540-45146-4

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-45146-4_16

DOI

http://dx.doi.org/10.1007/978-3-540-45146-4_16

DIMENSIONS

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


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": "IBM T.J. Watson Research Center", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Canetti", 
        "givenName": "Ran", 
        "id": "sg:person.012320111457.74", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012320111457.74"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center"
          ], 
          "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": "2003", 
    "datePublishedReg": "2003-01-01", 
    "description": "Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples include systems where multiple protocol instances use the same public-key infrastructure, or the same common reference string.) Rather than attempting to analyze the entire system as a single unit, we would like to be able to analyze each such protocol instance as stand-alone, and then use a general composition theorem to deduce the security of the entire system. However, no known composition theorem applies in this setting, since they all assume that the composed protocol instances have disjoint internal states, and that the internal random choices in the various executions are independent. We propose a new composition operation that can handle the case where different components have some amount of joint state and randomness, and demonstrate sufficient conditions for when the new operation preserves security. The new operation, which is called universal composition with joint state (and is based on the recently proposed universal composition operation), turns out to be very useful in a number of quite different scenarios such as those mentioned above.", 
    "editor": [
      {
        "familyName": "Boneh", 
        "givenName": "Dan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-45146-4_16", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-40674-7", 
        "978-3-540-45146-4"
      ], 
      "name": "Advances in Cryptology - CRYPTO 2003", 
      "type": "Book"
    }, 
    "keywords": [
      "joint state", 
      "composition theorem", 
      "new composition operation", 
      "multiple concurrent instances", 
      "general composition theorem", 
      "sufficient conditions", 
      "random choice", 
      "theorem", 
      "cryptographic systems", 
      "concurrent instances", 
      "entire system", 
      "randomness", 
      "composition operations", 
      "new operation", 
      "internal states", 
      "different scenarios", 
      "universal composition", 
      "instances", 
      "system", 
      "state", 
      "operation", 
      "protocol instances", 
      "scenarios", 
      "number", 
      "different components", 
      "cases", 
      "conditions", 
      "choice", 
      "single unit", 
      "components", 
      "security", 
      "execution", 
      "units", 
      "amount", 
      "setting", 
      "protocol", 
      "composition", 
      "stands"
    ], 
    "name": "Universal Composition with Joint State", 
    "pagination": "265-281", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1011582012"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-45146-4_16"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-45146-4_16", 
      "https://app.dimensions.ai/details/publication/pub.1011582012"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:45", 
    "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_289.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-45146-4_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-540-45146-4_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-540-45146-4_16'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-45146-4_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-540-45146-4_16'


 

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

105 TRIPLES      23 PREDICATES      64 URIs      57 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-45146-4_16 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N2563edc54d2748d49f0bb77181943fa6
4 schema:datePublished 2003
5 schema:datePublishedReg 2003-01-01
6 schema:description Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples include systems where multiple protocol instances use the same public-key infrastructure, or the same common reference string.) Rather than attempting to analyze the entire system as a single unit, we would like to be able to analyze each such protocol instance as stand-alone, and then use a general composition theorem to deduce the security of the entire system. However, no known composition theorem applies in this setting, since they all assume that the composed protocol instances have disjoint internal states, and that the internal random choices in the various executions are independent. We propose a new composition operation that can handle the case where different components have some amount of joint state and randomness, and demonstrate sufficient conditions for when the new operation preserves security. The new operation, which is called universal composition with joint state (and is based on the recently proposed universal composition operation), turns out to be very useful in a number of quite different scenarios such as those mentioned above.
7 schema:editor Nc6513c521af04f40b7ebdcbd1e8c65d9
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N2afe03670e574556a40a3a518977bf60
12 schema:keywords amount
13 cases
14 choice
15 components
16 composition
17 composition operations
18 composition theorem
19 concurrent instances
20 conditions
21 cryptographic systems
22 different components
23 different scenarios
24 entire system
25 execution
26 general composition theorem
27 instances
28 internal states
29 joint state
30 multiple concurrent instances
31 new composition operation
32 new operation
33 number
34 operation
35 protocol
36 protocol instances
37 random choice
38 randomness
39 scenarios
40 security
41 setting
42 single unit
43 stands
44 state
45 sufficient conditions
46 system
47 theorem
48 units
49 universal composition
50 schema:name Universal Composition with Joint State
51 schema:pagination 265-281
52 schema:productId Nc1c96aec09ac4fe09d4659ee6598cc90
53 Nda77f8498e7e43f2b252887090f696a0
54 schema:publisher N7d2d555ace41470dbb16b8fd03993be0
55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011582012
56 https://doi.org/10.1007/978-3-540-45146-4_16
57 schema:sdDatePublished 2022-05-20T07:45
58 schema:sdLicense https://scigraph.springernature.com/explorer/license/
59 schema:sdPublisher N780c8d3310a940c895681064f27bf07c
60 schema:url https://doi.org/10.1007/978-3-540-45146-4_16
61 sgo:license sg:explorer/license/
62 sgo:sdDataset chapters
63 rdf:type schema:Chapter
64 N2563edc54d2748d49f0bb77181943fa6 rdf:first sg:person.012320111457.74
65 rdf:rest N3a820b960d29453eb426d266f9812c55
66 N2afe03670e574556a40a3a518977bf60 schema:isbn 978-3-540-40674-7
67 978-3-540-45146-4
68 schema:name Advances in Cryptology - CRYPTO 2003
69 rdf:type schema:Book
70 N3a820b960d29453eb426d266f9812c55 rdf:first sg:person.015473523512.58
71 rdf:rest rdf:nil
72 N780c8d3310a940c895681064f27bf07c schema:name Springer Nature - SN SciGraph project
73 rdf:type schema:Organization
74 N7d2d555ace41470dbb16b8fd03993be0 schema:name Springer Nature
75 rdf:type schema:Organisation
76 N825905d5a6904962a1e0372f1fc9812e schema:familyName Boneh
77 schema:givenName Dan
78 rdf:type schema:Person
79 Nc1c96aec09ac4fe09d4659ee6598cc90 schema:name doi
80 schema:value 10.1007/978-3-540-45146-4_16
81 rdf:type schema:PropertyValue
82 Nc6513c521af04f40b7ebdcbd1e8c65d9 rdf:first N825905d5a6904962a1e0372f1fc9812e
83 rdf:rest rdf:nil
84 Nda77f8498e7e43f2b252887090f696a0 schema:name dimensions_id
85 schema:value pub.1011582012
86 rdf:type schema:PropertyValue
87 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
88 schema:name Information and Computing Sciences
89 rdf:type schema:DefinedTerm
90 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
91 schema:name Data Format
92 rdf:type schema:DefinedTerm
93 sg:person.012320111457.74 schema:affiliation grid-institutes:grid.481554.9
94 schema:familyName Canetti
95 schema:givenName Ran
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012320111457.74
97 rdf:type schema:Person
98 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
99 schema:familyName Rabin
100 schema:givenName Tal
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
102 rdf:type schema:Person
103 grid-institutes:grid.481554.9 schema:alternateName IBM T.J. Watson Research Center
104 schema:name IBM T.J. Watson Research Center
105 rdf:type schema:Organization
 




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


...