Universally Composable Synchronous Computation View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2013

AUTHORS

Jonathan Katz , Ueli Maurer , Björn Tackmann , Vassilis Zikas

ABSTRACT

In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: they can simultaneously achieve input completeness (all honest parties’ inputs are included in the computation) and guaranteed termination (honest parties do not “hang” indefinitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channels have (known) bounded latency and parties have loosely synchronized clocks.The widely-used framework of universal composability (UC) is inherently asynchronous, but several approaches for adding synchrony to the framework have been proposed. However, we show that the existing proposals do not provide the expected guarantees. Given this, we propose a novel approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be achieved given these functionalities, and that previous similar models can all be expressed within our new framework. More... »

PAGES

477-498

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-36594-2_27

DOI

http://dx.doi.org/10.1007/978-3-642-36594-2_27

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, University of Maryland, USA", 
          "id": "http://www.grid.ac/institutes/grid.410443.6", 
          "name": [
            "Dept. of Computer Science, University of Maryland, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Katz", 
        "givenName": "Jonathan", 
        "id": "sg:person.01354261156.67", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept.of Computer Science, ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Dept.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": "Dept.of Computer Science, ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Dept.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"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, UCLA, USA", 
          "id": "http://www.grid.ac/institutes/grid.19006.3e", 
          "name": [
            "Dept. of Computer Science, UCLA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zikas", 
        "givenName": "Vassilis", 
        "id": "sg:person.012007513121.08", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012007513121.08"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: they can simultaneously achieve input completeness (all honest parties\u2019 inputs are included in the computation) and guaranteed termination (honest parties do not \u201chang\u201d indefinitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channels have (known) bounded latency and parties have loosely synchronized clocks.The widely-used framework of universal composability (UC) is inherently asynchronous, but several approaches for adding synchrony to the framework have been proposed. However, we show that the existing proposals do not provide the expected guarantees. Given this, we propose a novel approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be achieved given these functionalities, and that previous similar models can all be expressed within our new framework.", 
    "editor": [
      {
        "familyName": "Sahai", 
        "givenName": "Amit", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-36594-2_27", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-36593-5", 
        "978-3-642-36594-2"
      ], 
      "name": "Theory of Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "universal composability", 
      "synchronous computations", 
      "synchronous network", 
      "security guarantees", 
      "UC framework", 
      "asynchronous world", 
      "new framework", 
      "guarantees", 
      "network", 
      "novel approach", 
      "framework", 
      "computation", 
      "functionality", 
      "composability", 
      "previous similar models", 
      "latency", 
      "proposal", 
      "similar models", 
      "protocol", 
      "completeness", 
      "clock", 
      "parties", 
      "world", 
      "model", 
      "channels", 
      "practice", 
      "synchrony", 
      "termination", 
      "bounded-delay networks", 
      "approach"
    ], 
    "name": "Universally Composable Synchronous Computation", 
    "pagination": "477-498", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1025348353"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-36594-2_27"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-36594-2_27", 
      "https://app.dimensions.ai/details/publication/pub.1025348353"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:42", 
    "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_133.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-36594-2_27"
  }
]
 

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-36594-2_27'

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-36594-2_27'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-36594-2_27'

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-36594-2_27'


 

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

117 TRIPLES      23 PREDICATES      56 URIs      49 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-36594-2_27 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Ne7debd026bfb41ad8f3bce0e3922ebaa
4 schema:datePublished 2013
5 schema:datePublishedReg 2013-01-01
6 schema:description In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: they can simultaneously achieve input completeness (all honest parties’ inputs are included in the computation) and guaranteed termination (honest parties do not “hang” indefinitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channels have (known) bounded latency and parties have loosely synchronized clocks.The widely-used framework of universal composability (UC) is inherently asynchronous, but several approaches for adding synchrony to the framework have been proposed. However, we show that the existing proposals do not provide the expected guarantees. Given this, we propose a novel approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be achieved given these functionalities, and that previous similar models can all be expressed within our new framework.
7 schema:editor N557185cd1a9c47ef8e74f7db275ed9ae
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N150707a6ced04cda8f95e33f559ed1aa
12 schema:keywords UC framework
13 approach
14 asynchronous world
15 bounded-delay networks
16 channels
17 clock
18 completeness
19 composability
20 computation
21 framework
22 functionality
23 guarantees
24 latency
25 model
26 network
27 new framework
28 novel approach
29 parties
30 practice
31 previous similar models
32 proposal
33 protocol
34 security guarantees
35 similar models
36 synchronous computations
37 synchronous network
38 synchrony
39 termination
40 universal composability
41 world
42 schema:name Universally Composable Synchronous Computation
43 schema:pagination 477-498
44 schema:productId N04f13667da064baab85d9de5697e36c5
45 N7e3caa3f7e334fe480704b3dde02f2f7
46 schema:publisher N4bc160a05c704a5aac180a432a006b67
47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025348353
48 https://doi.org/10.1007/978-3-642-36594-2_27
49 schema:sdDatePublished 2022-05-20T07:42
50 schema:sdLicense https://scigraph.springernature.com/explorer/license/
51 schema:sdPublisher Nd764592949a54141a10b4b53937a9248
52 schema:url https://doi.org/10.1007/978-3-642-36594-2_27
53 sgo:license sg:explorer/license/
54 sgo:sdDataset chapters
55 rdf:type schema:Chapter
56 N046bf13b7fee42a4a91ce4e7ad5730be rdf:first sg:person.012007513121.08
57 rdf:rest rdf:nil
58 N04f13667da064baab85d9de5697e36c5 schema:name dimensions_id
59 schema:value pub.1025348353
60 rdf:type schema:PropertyValue
61 N150707a6ced04cda8f95e33f559ed1aa schema:isbn 978-3-642-36593-5
62 978-3-642-36594-2
63 schema:name Theory of Cryptography
64 rdf:type schema:Book
65 N1e56d617b3df41e0a3e5fb70d16c375f schema:familyName Sahai
66 schema:givenName Amit
67 rdf:type schema:Person
68 N4bc160a05c704a5aac180a432a006b67 schema:name Springer Nature
69 rdf:type schema:Organisation
70 N557185cd1a9c47ef8e74f7db275ed9ae rdf:first N1e56d617b3df41e0a3e5fb70d16c375f
71 rdf:rest rdf:nil
72 N7e3caa3f7e334fe480704b3dde02f2f7 schema:name doi
73 schema:value 10.1007/978-3-642-36594-2_27
74 rdf:type schema:PropertyValue
75 N9fcb19b01d804e0fb62a829f83f05117 rdf:first sg:person.01316567627.91
76 rdf:rest Nbf2fe5b6d8054dc89c8048b4a58e5e73
77 Nbf2fe5b6d8054dc89c8048b4a58e5e73 rdf:first sg:person.07617171521.69
78 rdf:rest N046bf13b7fee42a4a91ce4e7ad5730be
79 Nd764592949a54141a10b4b53937a9248 schema:name Springer Nature - SN SciGraph project
80 rdf:type schema:Organization
81 Ne7debd026bfb41ad8f3bce0e3922ebaa rdf:first sg:person.01354261156.67
82 rdf:rest N9fcb19b01d804e0fb62a829f83f05117
83 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
84 schema:name Information and Computing Sciences
85 rdf:type schema:DefinedTerm
86 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
87 schema:name Computation Theory and Mathematics
88 rdf:type schema:DefinedTerm
89 sg:person.012007513121.08 schema:affiliation grid-institutes:grid.19006.3e
90 schema:familyName Zikas
91 schema:givenName Vassilis
92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012007513121.08
93 rdf:type schema:Person
94 sg:person.01316567627.91 schema:affiliation grid-institutes:grid.5801.c
95 schema:familyName Maurer
96 schema:givenName Ueli
97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91
98 rdf:type schema:Person
99 sg:person.01354261156.67 schema:affiliation grid-institutes:grid.410443.6
100 schema:familyName Katz
101 schema:givenName Jonathan
102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67
103 rdf:type schema:Person
104 sg:person.07617171521.69 schema:affiliation grid-institutes:grid.5801.c
105 schema:familyName Tackmann
106 schema:givenName Björn
107 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69
108 rdf:type schema:Person
109 grid-institutes:grid.19006.3e schema:alternateName Dept. of Computer Science, UCLA, USA
110 schema:name Dept. of Computer Science, UCLA, USA
111 rdf:type schema:Organization
112 grid-institutes:grid.410443.6 schema:alternateName Dept. of Computer Science, University of Maryland, USA
113 schema:name Dept. of Computer Science, University of Maryland, USA
114 rdf:type schema:Organization
115 grid-institutes:grid.5801.c schema:alternateName Dept.of Computer Science, ETH Zürich, Switzerland
116 schema:name Dept.of Computer Science, ETH Zürich, Switzerland
117 rdf:type schema:Organization
 




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


...