Robust Non-interactive Multiparty Computation Against Constant-Size Collusion View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2017-07-29

AUTHORS

Fabrice Benhamouda , Hugo Krawczyk , Tal Rabin

ABSTRACT

Non-Interactive Multiparty Computations (Beimel et al., Crypto 2014) is a very powerful notion equivalent (under some corruption model) to garbled circuits, Private Simultaneous Messages protocols, and obfuscation. We present robust solutions to the problem of Non-Interactive Multiparty Computation in the computational and information-theoretic models. Our results include the first efficient and robust protocols to compute any function in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$NC^1$$\end{document} for constant-size collusions, in the information-theoretic setting and in the computational setting, to compute any function in P for constant-size collusions, assuming the existence of one-way functions. Our constructions start from a Private Simultaneous Messages construction (Feige, Killian Naor, STOC 1994 and Ishai, Kushilevitz, ISTCS 1997) and transform it into a Non-Interactive Multiparty Computation for constant-size collusions.We also present a new Non-Interactive Multiparty Computation protocol for symmetric functions with significantly better communication complexity compared to the only known one of Beimel et al. More... »

PAGES

391-419

Book

TITLE

Advances in Cryptology – CRYPTO 2017

ISBN

978-3-319-63687-0
978-3-319-63688-7

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-63688-7_13

DOI

http://dx.doi.org/10.1007/978-3-319-63688-7_13

DIMENSIONS

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


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": "IBM Research, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM Research, Yorktown Heights, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Benhamouda", 
        "givenName": "Fabrice", 
        "id": "sg:person.014225261625.94", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014225261625.94"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM Research, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM Research, Yorktown Heights, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Krawczyk", 
        "givenName": "Hugo", 
        "id": "sg:person.013004021661.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM Research, Yorktown Heights, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM Research, Yorktown Heights, 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": "2017-07-29", 
    "datePublishedReg": "2017-07-29", 
    "description": "Non-Interactive Multiparty Computations (Beimel et al., Crypto 2014) is a very powerful notion equivalent (under some corruption model) to garbled circuits, Private Simultaneous Messages protocols, and obfuscation. We present robust solutions to the problem of Non-Interactive Multiparty Computation in the computational and information-theoretic models. Our results include the first efficient and robust protocols to compute any function in \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$NC^1$$\\end{document} for constant-size collusions, in the information-theoretic setting and in the computational setting, to compute any function in P for constant-size collusions, assuming the existence of one-way functions. Our constructions start from a Private Simultaneous Messages construction (Feige, Killian Naor, STOC 1994 and Ishai, Kushilevitz, ISTCS 1997) and transform it into a Non-Interactive Multiparty Computation for constant-size collusions.We also present a new Non-Interactive Multiparty Computation protocol for symmetric functions with significantly better communication complexity compared to the only known one of Beimel et al.", 
    "editor": [
      {
        "familyName": "Katz", 
        "givenName": "Jonathan", 
        "type": "Person"
      }, 
      {
        "familyName": "Shacham", 
        "givenName": "Hovav", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-63688-7_13", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-63687-0", 
        "978-3-319-63688-7"
      ], 
      "name": "Advances in Cryptology \u2013 CRYPTO 2017", 
      "type": "Book"
    }, 
    "keywords": [
      "multiparty computation", 
      "multiparty computation protocol", 
      "better communication complexity", 
      "information-theoretic setting", 
      "information-theoretic model", 
      "one-way functions", 
      "computation protocol", 
      "message protocol", 
      "communication complexity", 
      "computational setting", 
      "robust solution", 
      "computation", 
      "message construction", 
      "collusion", 
      "protocol", 
      "obfuscation", 
      "Beimel", 
      "robust protocol", 
      "complexity", 
      "construction", 
      "solution", 
      "model", 
      "setting", 
      "function", 
      "results", 
      "symmetric functions", 
      "circuit", 
      "existence", 
      "al", 
      "equivalent", 
      "problem"
    ], 
    "name": "Robust Non-interactive Multiparty Computation Against Constant-Size Collusion", 
    "pagination": "391-419", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1090971717"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-63688-7_13"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-63688-7_13", 
      "https://app.dimensions.ai/details/publication/pub.1090971717"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:47", 
    "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_394.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-63688-7_13"
  }
]
 

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-319-63688-7_13'

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-319-63688-7_13'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-63688-7_13'

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-319-63688-7_13'


 

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

110 TRIPLES      23 PREDICATES      56 URIs      49 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-63688-7_13 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Ne76885dcddbe420b87589e836e1a5439
4 schema:datePublished 2017-07-29
5 schema:datePublishedReg 2017-07-29
6 schema:description Non-Interactive Multiparty Computations (Beimel et al., Crypto 2014) is a very powerful notion equivalent (under some corruption model) to garbled circuits, Private Simultaneous Messages protocols, and obfuscation. We present robust solutions to the problem of Non-Interactive Multiparty Computation in the computational and information-theoretic models. Our results include the first efficient and robust protocols to compute any function in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$NC^1$$\end{document} for constant-size collusions, in the information-theoretic setting and in the computational setting, to compute any function in P for constant-size collusions, assuming the existence of one-way functions. Our constructions start from a Private Simultaneous Messages construction (Feige, Killian Naor, STOC 1994 and Ishai, Kushilevitz, ISTCS 1997) and transform it into a Non-Interactive Multiparty Computation for constant-size collusions.We also present a new Non-Interactive Multiparty Computation protocol for symmetric functions with significantly better communication complexity compared to the only known one of Beimel et al.
7 schema:editor N1cfff1f452cd41b288466f6b681dd097
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N7228b0bff97c4a6b91f252f09c0abd87
12 schema:keywords Beimel
13 al
14 better communication complexity
15 circuit
16 collusion
17 communication complexity
18 complexity
19 computation
20 computation protocol
21 computational setting
22 construction
23 equivalent
24 existence
25 function
26 information-theoretic model
27 information-theoretic setting
28 message construction
29 message protocol
30 model
31 multiparty computation
32 multiparty computation protocol
33 obfuscation
34 one-way functions
35 problem
36 protocol
37 results
38 robust protocol
39 robust solution
40 setting
41 solution
42 symmetric functions
43 schema:name Robust Non-interactive Multiparty Computation Against Constant-Size Collusion
44 schema:pagination 391-419
45 schema:productId Nb3361babda2247179119701bf101ac45
46 Nc075b5f84f3e43e58e14d0712abf3811
47 schema:publisher N5db83f666622420e862adb61cf896353
48 schema:sameAs https://app.dimensions.ai/details/publication/pub.1090971717
49 https://doi.org/10.1007/978-3-319-63688-7_13
50 schema:sdDatePublished 2022-05-20T07:47
51 schema:sdLicense https://scigraph.springernature.com/explorer/license/
52 schema:sdPublisher Nc5edd3bd6e1e44dfaa07df2c193c8c0f
53 schema:url https://doi.org/10.1007/978-3-319-63688-7_13
54 sgo:license sg:explorer/license/
55 sgo:sdDataset chapters
56 rdf:type schema:Chapter
57 N1cfff1f452cd41b288466f6b681dd097 rdf:first Nd1610ec3fdd744478c0ab37d7aeefb42
58 rdf:rest N683786c5f1124b6d9d5abbd6502750ee
59 N56845bcba70b4c5eb3ff0fe64a63bbb6 rdf:first sg:person.015473523512.58
60 rdf:rest rdf:nil
61 N5db83f666622420e862adb61cf896353 schema:name Springer Nature
62 rdf:type schema:Organisation
63 N683786c5f1124b6d9d5abbd6502750ee rdf:first Nf069485539a949e5b931b294cebebcdf
64 rdf:rest rdf:nil
65 N7228b0bff97c4a6b91f252f09c0abd87 schema:isbn 978-3-319-63687-0
66 978-3-319-63688-7
67 schema:name Advances in Cryptology – CRYPTO 2017
68 rdf:type schema:Book
69 N9599a56b178d4023be78c06b2bd2fa5a rdf:first sg:person.013004021661.30
70 rdf:rest N56845bcba70b4c5eb3ff0fe64a63bbb6
71 Nb3361babda2247179119701bf101ac45 schema:name dimensions_id
72 schema:value pub.1090971717
73 rdf:type schema:PropertyValue
74 Nc075b5f84f3e43e58e14d0712abf3811 schema:name doi
75 schema:value 10.1007/978-3-319-63688-7_13
76 rdf:type schema:PropertyValue
77 Nc5edd3bd6e1e44dfaa07df2c193c8c0f schema:name Springer Nature - SN SciGraph project
78 rdf:type schema:Organization
79 Nd1610ec3fdd744478c0ab37d7aeefb42 schema:familyName Katz
80 schema:givenName Jonathan
81 rdf:type schema:Person
82 Ne76885dcddbe420b87589e836e1a5439 rdf:first sg:person.014225261625.94
83 rdf:rest N9599a56b178d4023be78c06b2bd2fa5a
84 Nf069485539a949e5b931b294cebebcdf schema:familyName Shacham
85 schema:givenName Hovav
86 rdf:type schema:Person
87 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
88 schema:name Information and Computing Sciences
89 rdf:type schema:DefinedTerm
90 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
91 schema:name Computation Theory and Mathematics
92 rdf:type schema:DefinedTerm
93 sg:person.013004021661.30 schema:affiliation grid-institutes:grid.481554.9
94 schema:familyName Krawczyk
95 schema:givenName Hugo
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30
97 rdf:type schema:Person
98 sg:person.014225261625.94 schema:affiliation grid-institutes:grid.481554.9
99 schema:familyName Benhamouda
100 schema:givenName Fabrice
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014225261625.94
102 rdf:type schema:Person
103 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
104 schema:familyName Rabin
105 schema:givenName Tal
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
107 rdf:type schema:Person
108 grid-institutes:grid.481554.9 schema:alternateName IBM Research, Yorktown Heights, USA
109 schema:name IBM Research, Yorktown Heights, USA
110 rdf:type schema:Organization
 




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


...