2020-12-09
AUTHORSChen-Da Liu-Zhang , Ueli Maurer
ABSTRACTThis paper proposes a simple synchronous composable security framework as an instantiation of the Constructive Cryptography framework, aiming to capture minimally, without unnecessary artefacts, exactly what is needed to state synchronous security guarantees. The objects of study are specifications (i.e., sets) of systems, and traditional security properties like consistency and validity can naturally be understood as specifications, thus unifying composable and property-based definitions. The framework’s simplicity is in contrast to current composable frameworks for synchronous computation which are built on top of an asynchronous framework (e.g. the UC framework), thus not only inheriting artefacts and complex features used to handle asynchronous communication, but adding additional overhead to capture synchronous communication.As a second, independent contribution we demonstrate how secure (synchronous) multi-party computation protocols can be understood as constructing a computer that allows a set of parties to perform an arbitrary, on-going computation. An interesting aspect is that the instructions of the computation need not be fixed before the protocol starts but can also be determined during an on-going computation, possibly depending on previous outputs. More... »
PAGES439-472
Theory of Cryptography
ISBN
978-3-030-64377-5
978-3-030-64378-2
http://scigraph.springernature.com/pub.10.1007/978-3-030-64378-2_16
DOIhttp://dx.doi.org/10.1007/978-3-030-64378-2_16
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1133471683
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"
},
{
"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": "ETH Zurich, Z\u00fcrich, Switzerland",
"id": "http://www.grid.ac/institutes/grid.5801.c",
"name": [
"ETH Zurich, Z\u00fcrich, Switzerland"
],
"type": "Organization"
},
"familyName": "Liu-Zhang",
"givenName": "Chen-Da",
"id": "sg:person.011544110647.05",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011544110647.05"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "ETH Zurich, Z\u00fcrich, Switzerland",
"id": "http://www.grid.ac/institutes/grid.5801.c",
"name": [
"ETH Zurich, 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"
}
],
"datePublished": "2020-12-09",
"datePublishedReg": "2020-12-09",
"description": "This paper proposes a simple synchronous composable security framework as an instantiation of the Constructive Cryptography framework, aiming to capture minimally, without unnecessary artefacts, exactly what is needed to state synchronous security guarantees. The objects of study are specifications (i.e., sets) of systems, and traditional security properties like consistency and validity can naturally be understood as specifications, thus unifying composable and property-based definitions. The framework\u2019s simplicity is in contrast to current composable frameworks for synchronous computation which are built on top of an asynchronous framework (e.g. the UC framework), thus not only inheriting artefacts and complex features used to handle asynchronous communication, but adding additional overhead to capture synchronous communication.As a second, independent contribution we demonstrate how secure (synchronous) multi-party computation protocols can be understood as constructing a computer that allows a set of parties to perform an arbitrary, on-going computation. An interesting aspect is that the instructions of the computation need not be fixed before the protocol starts but can also be determined during an on-going computation, possibly depending on previous outputs.",
"editor": [
{
"familyName": "Pass",
"givenName": "Rafael",
"type": "Person"
},
{
"familyName": "Pietrzak",
"givenName": "Krzysztof",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-030-64378-2_16",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-030-64377-5",
"978-3-030-64378-2"
],
"name": "Theory of Cryptography",
"type": "Book"
},
"keywords": [
"secure multi-party computation protocol",
"multi-party computation protocol",
"constructive cryptography framework",
"traditional security properties",
"composable security framework",
"set of parties",
"specification of systems",
"constructive cryptography",
"security framework",
"security properties",
"composable framework",
"security guarantees",
"computation protocol",
"property-based definitions",
"asynchronous framework",
"asynchronous communication",
"additional overhead",
"synchronous communication",
"synchronous computations",
"unnecessary artifacts",
"previous output",
"complex features",
"computation",
"framework",
"specification",
"communication",
"cryptography",
"overhead",
"instantiation",
"computer",
"artifacts",
"guarantees",
"protocol",
"simplicity",
"objects",
"interesting aspects",
"set",
"system",
"features",
"object of study",
"top",
"parties",
"instruction",
"output",
"consistency",
"definition",
"aspects",
"contribution",
"validity",
"properties",
"study",
"contrast",
"independent contribution",
"paper"
],
"name": "Synchronous Constructive Cryptography",
"pagination": "439-472",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1133471683"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-030-64378-2_16"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-030-64378-2_16",
"https://app.dimensions.ai/details/publication/pub.1133471683"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:44",
"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_279.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-030-64378-2_16"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
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-030-64378-2_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-030-64378-2_16'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-64378-2_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-030-64378-2_16'
This table displays all metadata directly associated to this object as RDF triples.
130 TRIPLES
23 PREDICATES
80 URIs
72 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/978-3-030-64378-2_16 | schema:about | anzsrc-for:08 |
2 | ″ | ″ | anzsrc-for:0802 |
3 | ″ | ″ | anzsrc-for:0804 |
4 | ″ | schema:author | Na32cb58b4cc04326b8543cfcd2d41299 |
5 | ″ | schema:datePublished | 2020-12-09 |
6 | ″ | schema:datePublishedReg | 2020-12-09 |
7 | ″ | schema:description | This paper proposes a simple synchronous composable security framework as an instantiation of the Constructive Cryptography framework, aiming to capture minimally, without unnecessary artefacts, exactly what is needed to state synchronous security guarantees. The objects of study are specifications (i.e., sets) of systems, and traditional security properties like consistency and validity can naturally be understood as specifications, thus unifying composable and property-based definitions. The framework’s simplicity is in contrast to current composable frameworks for synchronous computation which are built on top of an asynchronous framework (e.g. the UC framework), thus not only inheriting artefacts and complex features used to handle asynchronous communication, but adding additional overhead to capture synchronous communication.As a second, independent contribution we demonstrate how secure (synchronous) multi-party computation protocols can be understood as constructing a computer that allows a set of parties to perform an arbitrary, on-going computation. An interesting aspect is that the instructions of the computation need not be fixed before the protocol starts but can also be determined during an on-going computation, possibly depending on previous outputs. |
8 | ″ | schema:editor | N4c0e4454e36e434b8f0d3369a23759a8 |
9 | ″ | schema:genre | chapter |
10 | ″ | schema:inLanguage | en |
11 | ″ | schema:isAccessibleForFree | false |
12 | ″ | schema:isPartOf | Ne7708548155f4a6e9131df0a7eeb1142 |
13 | ″ | schema:keywords | additional overhead |
14 | ″ | ″ | artifacts |
15 | ″ | ″ | aspects |
16 | ″ | ″ | asynchronous communication |
17 | ″ | ″ | asynchronous framework |
18 | ″ | ″ | communication |
19 | ″ | ″ | complex features |
20 | ″ | ″ | composable framework |
21 | ″ | ″ | composable security framework |
22 | ″ | ″ | computation |
23 | ″ | ″ | computation protocol |
24 | ″ | ″ | computer |
25 | ″ | ″ | consistency |
26 | ″ | ″ | constructive cryptography |
27 | ″ | ″ | constructive cryptography framework |
28 | ″ | ″ | contrast |
29 | ″ | ″ | contribution |
30 | ″ | ″ | cryptography |
31 | ″ | ″ | definition |
32 | ″ | ″ | features |
33 | ″ | ″ | framework |
34 | ″ | ″ | guarantees |
35 | ″ | ″ | independent contribution |
36 | ″ | ″ | instantiation |
37 | ″ | ″ | instruction |
38 | ″ | ″ | interesting aspects |
39 | ″ | ″ | multi-party computation protocol |
40 | ″ | ″ | object of study |
41 | ″ | ″ | objects |
42 | ″ | ″ | output |
43 | ″ | ″ | overhead |
44 | ″ | ″ | paper |
45 | ″ | ″ | parties |
46 | ″ | ″ | previous output |
47 | ″ | ″ | properties |
48 | ″ | ″ | property-based definitions |
49 | ″ | ″ | protocol |
50 | ″ | ″ | secure multi-party computation protocol |
51 | ″ | ″ | security framework |
52 | ″ | ″ | security guarantees |
53 | ″ | ″ | security properties |
54 | ″ | ″ | set |
55 | ″ | ″ | set of parties |
56 | ″ | ″ | simplicity |
57 | ″ | ″ | specification |
58 | ″ | ″ | specification of systems |
59 | ″ | ″ | study |
60 | ″ | ″ | synchronous communication |
61 | ″ | ″ | synchronous computations |
62 | ″ | ″ | system |
63 | ″ | ″ | top |
64 | ″ | ″ | traditional security properties |
65 | ″ | ″ | unnecessary artifacts |
66 | ″ | ″ | validity |
67 | ″ | schema:name | Synchronous Constructive Cryptography |
68 | ″ | schema:pagination | 439-472 |
69 | ″ | schema:productId | N13d7936f30754e0e962304467146a39b |
70 | ″ | ″ | N3507974dc7a44c00bb3db78cbb04635c |
71 | ″ | schema:publisher | N8f4ffbdff99c4fea885a1494c8e2657d |
72 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1133471683 |
73 | ″ | ″ | https://doi.org/10.1007/978-3-030-64378-2_16 |
74 | ″ | schema:sdDatePublished | 2022-05-10T10:44 |
75 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
76 | ″ | schema:sdPublisher | N0d6bc0321ca345698e8396d25eafa0af |
77 | ″ | schema:url | https://doi.org/10.1007/978-3-030-64378-2_16 |
78 | ″ | sgo:license | sg:explorer/license/ |
79 | ″ | sgo:sdDataset | chapters |
80 | ″ | rdf:type | schema:Chapter |
81 | N0d6bc0321ca345698e8396d25eafa0af | schema:name | Springer Nature - SN SciGraph project |
82 | ″ | rdf:type | schema:Organization |
83 | N13d7936f30754e0e962304467146a39b | schema:name | dimensions_id |
84 | ″ | schema:value | pub.1133471683 |
85 | ″ | rdf:type | schema:PropertyValue |
86 | N16e3d966659b4c41b9866dfb6754c09c | schema:familyName | Pietrzak |
87 | ″ | schema:givenName | Krzysztof |
88 | ″ | rdf:type | schema:Person |
89 | N3507974dc7a44c00bb3db78cbb04635c | schema:name | doi |
90 | ″ | schema:value | 10.1007/978-3-030-64378-2_16 |
91 | ″ | rdf:type | schema:PropertyValue |
92 | N4c0e4454e36e434b8f0d3369a23759a8 | rdf:first | N65b2d2559b694db695a3289117682d92 |
93 | ″ | rdf:rest | N7322f64314cf46f4b33ca5e9b84eb796 |
94 | N65b2d2559b694db695a3289117682d92 | schema:familyName | Pass |
95 | ″ | schema:givenName | Rafael |
96 | ″ | rdf:type | schema:Person |
97 | N7322f64314cf46f4b33ca5e9b84eb796 | rdf:first | N16e3d966659b4c41b9866dfb6754c09c |
98 | ″ | rdf:rest | rdf:nil |
99 | N8f4ffbdff99c4fea885a1494c8e2657d | schema:name | Springer Nature |
100 | ″ | rdf:type | schema:Organisation |
101 | Na32cb58b4cc04326b8543cfcd2d41299 | rdf:first | sg:person.011544110647.05 |
102 | ″ | rdf:rest | Neb47552dcfdf4020b03c8922a0cc7bcc |
103 | Ne7708548155f4a6e9131df0a7eeb1142 | schema:isbn | 978-3-030-64377-5 |
104 | ″ | ″ | 978-3-030-64378-2 |
105 | ″ | schema:name | Theory of Cryptography |
106 | ″ | rdf:type | schema:Book |
107 | Neb47552dcfdf4020b03c8922a0cc7bcc | rdf:first | sg:person.01316567627.91 |
108 | ″ | rdf:rest | rdf:nil |
109 | anzsrc-for:08 | schema:inDefinedTermSet | anzsrc-for: |
110 | ″ | schema:name | Information and Computing Sciences |
111 | ″ | rdf:type | schema:DefinedTerm |
112 | anzsrc-for:0802 | schema:inDefinedTermSet | anzsrc-for: |
113 | ″ | schema:name | Computation Theory and Mathematics |
114 | ″ | rdf:type | schema:DefinedTerm |
115 | anzsrc-for:0804 | schema:inDefinedTermSet | anzsrc-for: |
116 | ″ | schema:name | Data Format |
117 | ″ | rdf:type | schema:DefinedTerm |
118 | sg:person.011544110647.05 | schema:affiliation | grid-institutes:grid.5801.c |
119 | ″ | schema:familyName | Liu-Zhang |
120 | ″ | schema:givenName | Chen-Da |
121 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011544110647.05 |
122 | ″ | rdf:type | schema:Person |
123 | sg:person.01316567627.91 | schema:affiliation | grid-institutes:grid.5801.c |
124 | ″ | schema:familyName | Maurer |
125 | ″ | schema:givenName | Ueli |
126 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91 |
127 | ″ | rdf:type | schema:Person |
128 | grid-institutes:grid.5801.c | schema:alternateName | ETH Zurich, Zürich, Switzerland |
129 | ″ | schema:name | ETH Zurich, Zürich, Switzerland |
130 | ″ | rdf:type | schema:Organization |