Constant-Round MPC with Fairness and Guarantee of Output Delivery View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2015-08-01

AUTHORS

S. Dov Gordon , Feng-Hao Liu , Elaine Shi

ABSTRACT

We study the round complexity of multiparty computation with fairness and guaranteed output delivery, assuming existence of an honest majority. We demonstrate a new lower bound and a matching upper bound. Our lower bound rules out any two-round fair protocols in the standalone model, even when the parties are given access to a common reference string (CRS). The lower bound follows by a reduction to the impossibility result of virtual black box obfuscation of arbitrary circuits.Then we demonstrate a three-round protocol with guarantee of output delivery, which in general is harder than achieving fairness (since the latter allows the adversary to force a fair abort). We develop a new construction of a threshold fully homomorphic encryption scheme, with a new property that we call “flexible” ciphertexts. Roughly, our threshold encryption scheme allows parties to adapt flexible ciphertexts to the public keys of the non-aborting parties, which provides a way of handling aborts without adding any communication. More... »

PAGES

63-82

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-48000-7_4

DOI

http://dx.doi.org/10.1007/978-3-662-48000-7_4

DIMENSIONS

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


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/18", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Law and Legal Studies", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Law", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, George Mason University, Fairfax, USA", 
          "id": "http://www.grid.ac/institutes/grid.22448.38", 
          "name": [
            "Department of Computer Science, George Mason University, Fairfax, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dov Gordon", 
        "givenName": "S.", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, USA", 
          "id": "http://www.grid.ac/institutes/grid.255951.f", 
          "name": [
            "Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Liu", 
        "givenName": "Feng-Hao", 
        "id": "sg:person.012403661357.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012403661357.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Cornell University, Ithaca, USA", 
          "id": "http://www.grid.ac/institutes/grid.5386.8", 
          "name": [
            "Department of Computer Science, Cornell University, Ithaca, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shi", 
        "givenName": "Elaine", 
        "id": "sg:person.014706274717.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-08-01", 
    "datePublishedReg": "2015-08-01", 
    "description": "We study the round complexity of multiparty computation with fairness and guaranteed output delivery, assuming existence of an honest majority. We demonstrate a new lower bound and a matching upper bound. Our lower bound rules out any two-round fair protocols in the standalone model, even when the parties are given access to a common reference string (CRS). The lower bound follows by a reduction to the impossibility result of virtual black box obfuscation of arbitrary circuits.Then we demonstrate a three-round protocol with guarantee of output delivery, which in general is harder than achieving fairness (since the latter allows the adversary to force a fair abort). We develop a new construction of a threshold fully homomorphic encryption scheme, with a new property that we call \u201cflexible\u201d ciphertexts. Roughly, our threshold encryption scheme allows parties to adapt flexible ciphertexts to the public keys of the non-aborting parties, which provides a way of handling aborts without adding any communication.", 
    "editor": [
      {
        "familyName": "Gennaro", 
        "givenName": "Rosario", 
        "type": "Person"
      }, 
      {
        "familyName": "Robshaw", 
        "givenName": "Matthew", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-48000-7_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-47999-5", 
        "978-3-662-48000-7"
      ], 
      "name": "Advances in Cryptology -- CRYPTO 2015", 
      "type": "Book"
    }, 
    "keywords": [
      "round complexity", 
      "standalone model", 
      "impossibility results", 
      "guarantees", 
      "new construction", 
      "scheme", 
      "new properties", 
      "MPC", 
      "complexity", 
      "multiparty computation", 
      "computation", 
      "fairness", 
      "existence", 
      "rules", 
      "model", 
      "common reference string", 
      "reference string", 
      "strings", 
      "three-round protocol", 
      "construction", 
      "homomorphic encryption scheme", 
      "encryption scheme", 
      "threshold encryption scheme", 
      "output delivery", 
      "honest majority", 
      "fair protocol", 
      "protocol", 
      "parties", 
      "access", 
      "reduction", 
      "results", 
      "obfuscation", 
      "arbitrary circuits", 
      "circuit", 
      "threshold", 
      "properties", 
      "ciphertext", 
      "public key", 
      "key", 
      "way", 
      "abort", 
      "communication", 
      "delivery", 
      "majority", 
      "two-round fair protocols", 
      "virtual black box obfuscation", 
      "black box obfuscation", 
      "box obfuscation", 
      "flexible ciphertexts", 
      "non-aborting parties", 
      "Constant-Round MPC"
    ], 
    "name": "Constant-Round MPC with Fairness and Guarantee of Output Delivery", 
    "pagination": "63-82", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035061470"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-48000-7_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-48000-7_4", 
      "https://app.dimensions.ai/details/publication/pub.1035061470"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T18:55", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_307.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-48000-7_4"
  }
]
 

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-662-48000-7_4'

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-662-48000-7_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-48000-7_4'

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-662-48000-7_4'


 

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

135 TRIPLES      23 PREDICATES      76 URIs      69 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-48000-7_4 schema:about anzsrc-for:18
2 anzsrc-for:1801
3 schema:author Na0c08e0febad451cb6b930380cf9c1a1
4 schema:datePublished 2015-08-01
5 schema:datePublishedReg 2015-08-01
6 schema:description We study the round complexity of multiparty computation with fairness and guaranteed output delivery, assuming existence of an honest majority. We demonstrate a new lower bound and a matching upper bound. Our lower bound rules out any two-round fair protocols in the standalone model, even when the parties are given access to a common reference string (CRS). The lower bound follows by a reduction to the impossibility result of virtual black box obfuscation of arbitrary circuits.Then we demonstrate a three-round protocol with guarantee of output delivery, which in general is harder than achieving fairness (since the latter allows the adversary to force a fair abort). We develop a new construction of a threshold fully homomorphic encryption scheme, with a new property that we call “flexible” ciphertexts. Roughly, our threshold encryption scheme allows parties to adapt flexible ciphertexts to the public keys of the non-aborting parties, which provides a way of handling aborts without adding any communication.
7 schema:editor N9c6dec33d14c4dac89c3158b90ece7a4
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N12c9def31e54462fa427052e530b04c2
12 schema:keywords Constant-Round MPC
13 MPC
14 abort
15 access
16 arbitrary circuits
17 black box obfuscation
18 box obfuscation
19 ciphertext
20 circuit
21 common reference string
22 communication
23 complexity
24 computation
25 construction
26 delivery
27 encryption scheme
28 existence
29 fair protocol
30 fairness
31 flexible ciphertexts
32 guarantees
33 homomorphic encryption scheme
34 honest majority
35 impossibility results
36 key
37 majority
38 model
39 multiparty computation
40 new construction
41 new properties
42 non-aborting parties
43 obfuscation
44 output delivery
45 parties
46 properties
47 protocol
48 public key
49 reduction
50 reference string
51 results
52 round complexity
53 rules
54 scheme
55 standalone model
56 strings
57 three-round protocol
58 threshold
59 threshold encryption scheme
60 two-round fair protocols
61 virtual black box obfuscation
62 way
63 schema:name Constant-Round MPC with Fairness and Guarantee of Output Delivery
64 schema:pagination 63-82
65 schema:productId N20b0ce90d43c4a0e96f5b0c40594df1a
66 Nacb1c9194b0a4efea5547e867d5980aa
67 schema:publisher N161c7c8eb6e3496c89508fcf1c75b573
68 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035061470
69 https://doi.org/10.1007/978-3-662-48000-7_4
70 schema:sdDatePublished 2021-11-01T18:55
71 schema:sdLicense https://scigraph.springernature.com/explorer/license/
72 schema:sdPublisher N9e8f3e5b279e423fbbbfd1d500af244d
73 schema:url https://doi.org/10.1007/978-3-662-48000-7_4
74 sgo:license sg:explorer/license/
75 sgo:sdDataset chapters
76 rdf:type schema:Chapter
77 N12c9def31e54462fa427052e530b04c2 schema:isbn 978-3-662-47999-5
78 978-3-662-48000-7
79 schema:name Advances in Cryptology -- CRYPTO 2015
80 rdf:type schema:Book
81 N161c7c8eb6e3496c89508fcf1c75b573 schema:name Springer Nature
82 rdf:type schema:Organisation
83 N1e3c61d57d3b44f3b4a654e2752b0e05 rdf:first sg:person.012403661357.00
84 rdf:rest Nc3107bea2ca243fa86546d56cffa988a
85 N20b0ce90d43c4a0e96f5b0c40594df1a schema:name dimensions_id
86 schema:value pub.1035061470
87 rdf:type schema:PropertyValue
88 N262519414e8f4dadaa3593551ad1c352 schema:familyName Robshaw
89 schema:givenName Matthew
90 rdf:type schema:Person
91 N33d14b0044044708a4f8023c75527266 schema:affiliation grid-institutes:grid.22448.38
92 schema:familyName Dov Gordon
93 schema:givenName S.
94 rdf:type schema:Person
95 N5244dd4dd4854b04ab19eb193bf0270d rdf:first N262519414e8f4dadaa3593551ad1c352
96 rdf:rest rdf:nil
97 N9c6dec33d14c4dac89c3158b90ece7a4 rdf:first Nd70d1b3725cf425a83c4e88d66d426ba
98 rdf:rest N5244dd4dd4854b04ab19eb193bf0270d
99 N9e8f3e5b279e423fbbbfd1d500af244d schema:name Springer Nature - SN SciGraph project
100 rdf:type schema:Organization
101 Na0c08e0febad451cb6b930380cf9c1a1 rdf:first N33d14b0044044708a4f8023c75527266
102 rdf:rest N1e3c61d57d3b44f3b4a654e2752b0e05
103 Nacb1c9194b0a4efea5547e867d5980aa schema:name doi
104 schema:value 10.1007/978-3-662-48000-7_4
105 rdf:type schema:PropertyValue
106 Nc3107bea2ca243fa86546d56cffa988a rdf:first sg:person.014706274717.52
107 rdf:rest rdf:nil
108 Nd70d1b3725cf425a83c4e88d66d426ba schema:familyName Gennaro
109 schema:givenName Rosario
110 rdf:type schema:Person
111 anzsrc-for:18 schema:inDefinedTermSet anzsrc-for:
112 schema:name Law and Legal Studies
113 rdf:type schema:DefinedTerm
114 anzsrc-for:1801 schema:inDefinedTermSet anzsrc-for:
115 schema:name Law
116 rdf:type schema:DefinedTerm
117 sg:person.012403661357.00 schema:affiliation grid-institutes:grid.255951.f
118 schema:familyName Liu
119 schema:givenName Feng-Hao
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012403661357.00
121 rdf:type schema:Person
122 sg:person.014706274717.52 schema:affiliation grid-institutes:grid.5386.8
123 schema:familyName Shi
124 schema:givenName Elaine
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52
126 rdf:type schema:Person
127 grid-institutes:grid.22448.38 schema:alternateName Department of Computer Science, George Mason University, Fairfax, USA
128 schema:name Department of Computer Science, George Mason University, Fairfax, USA
129 rdf:type schema:Organization
130 grid-institutes:grid.255951.f schema:alternateName Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, USA
131 schema:name Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, USA
132 rdf:type schema:Organization
133 grid-institutes:grid.5386.8 schema:alternateName Department of Computer Science, Cornell University, Ithaca, USA
134 schema:name Department of Computer Science, Cornell University, Ithaca, USA
135 rdf:type schema:Organization
 




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


...