Minimal Complete Primitives for Secure Multi-Party Computation View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2005-01

AUTHORS

Matthias Fitzi, Juan A. Garay, Ueli Maurer, Rafail Ostrovsky

ABSTRACT

The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of complete primitives for the case of two players has been thoroughly studied. However, in the multi-party setting, when there are n > 2 players and t of them are corrupted, the question of what are the simplest complete primitives remained open for t ≥ n/3. (A primitive is called complete if any computation can be carried out by the players having access only to the primitive and local computation.) In this paper we consider this question, and introduce complete primitives of minimal cardinality for secure multi-party computation. The cardinality issue (number of players accessing the primitive) is essential in settings where primitives are implemented by some other means, and the simpler the primitive the easier it is to realize. We show that our primitives are complete and of minimal cardinality possible for most cases. More... »

PAGES

37-61

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00145-004-0150-y

DOI

http://dx.doi.org/10.1007/s00145-004-0150-y

DIMENSIONS

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


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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of California, Davis", 
          "id": "https://www.grid.ac/institutes/grid.27860.3b", 
          "name": [
            "Department of Computer Science,\nUniversity of California,\nDavis, CA 95616, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fitzi", 
        "givenName": "Matthias", 
        "id": "sg:person.014643562643.17", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014643562643.17"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "Bell Labs \u2013 Lucent Technologies,\n600 Mountain Ave.,\nMurray Hill, NJ 07974, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Garay", 
        "givenName": "Juan A.", 
        "id": "sg:person.015655737162.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015655737162.07"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Swiss Federal Institute of Technology in Zurich", 
          "id": "https://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH,\nCH-8096 Zurich, 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": "Ericsson (United States)", 
          "id": "https://www.grid.ac/institutes/grid.432790.b", 
          "name": [
            "Telcordia Technologies Inc.,\n 445 South Street, Morristown, NJ 07960-6438, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ostrovsky", 
        "givenName": "Rafail", 
        "id": "sg:person.015474716573.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2005-01", 
    "datePublishedReg": "2005-01-01", 
    "description": "The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of complete primitives for the case of two players has been thoroughly studied. However, in the multi-party setting, when there are n > 2 players and t of them are corrupted, the question of what are the simplest complete primitives remained open for t \u2265 n/3. (A primitive is called complete if any computation can be carried out by the players having access only to the primitive and local computation.) In this paper we consider this question, and introduce complete primitives of minimal cardinality for secure multi-party computation. The cardinality issue (number of players accessing the primitive) is essential in settings where primitives are implemented by some other means, and the simpler the primitive the easier it is to realize. We show that our primitives are complete and of minimal cardinality possible for most cases.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00145-004-0150-y", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1136278", 
        "issn": [
          "0933-2790", 
          "1432-1378"
        ], 
        "name": "Journal of Cryptology", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "18"
      }
    ], 
    "name": "Minimal Complete Primitives for Secure Multi-Party Computation", 
    "pagination": "37-61", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "389c1e9040d8b9c05bece310f58489bad303c04ec7277a155ae8819b04e7648f"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00145-004-0150-y"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1011881484"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00145-004-0150-y", 
      "https://app.dimensions.ai/details/publication/pub.1011881484"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T23:24", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8693_00000511.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs00145-004-0150-y"
  }
]
 

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/s00145-004-0150-y'

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/s00145-004-0150-y'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00145-004-0150-y'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00145-004-0150-y'


 

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

90 TRIPLES      20 PREDICATES      27 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00145-004-0150-y schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N7709a45a0ef243c99f1d3d4c41d960e8
4 schema:datePublished 2005-01
5 schema:datePublishedReg 2005-01-01
6 schema:description The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of complete primitives for the case of two players has been thoroughly studied. However, in the multi-party setting, when there are n > 2 players and t of them are corrupted, the question of what are the simplest complete primitives remained open for t ≥ n/3. (A primitive is called complete if any computation can be carried out by the players having access only to the primitive and local computation.) In this paper we consider this question, and introduce complete primitives of minimal cardinality for secure multi-party computation. The cardinality issue (number of players accessing the primitive) is essential in settings where primitives are implemented by some other means, and the simpler the primitive the easier it is to realize. We show that our primitives are complete and of minimal cardinality possible for most cases.
7 schema:genre research_article
8 schema:inLanguage en
9 schema:isAccessibleForFree true
10 schema:isPartOf N41dca5742b9e40bd8121c3d3fb83c0ee
11 Ne263dba324df40b78995e1464bf291b3
12 sg:journal.1136278
13 schema:name Minimal Complete Primitives for Secure Multi-Party Computation
14 schema:pagination 37-61
15 schema:productId N3302ba6185f3406fb535a54ef3eacbe6
16 N51fb2e01ca2545a9bb5f8520296d2568
17 N6b780ae99fa84221b1525d647e718c25
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011881484
19 https://doi.org/10.1007/s00145-004-0150-y
20 schema:sdDatePublished 2019-04-10T23:24
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N0e704c04c3ee45cdb44d2f4bb8a9f798
23 schema:url http://link.springer.com/10.1007%2Fs00145-004-0150-y
24 sgo:license sg:explorer/license/
25 sgo:sdDataset articles
26 rdf:type schema:ScholarlyArticle
27 N0e704c04c3ee45cdb44d2f4bb8a9f798 schema:name Springer Nature - SN SciGraph project
28 rdf:type schema:Organization
29 N3302ba6185f3406fb535a54ef3eacbe6 schema:name doi
30 schema:value 10.1007/s00145-004-0150-y
31 rdf:type schema:PropertyValue
32 N41dca5742b9e40bd8121c3d3fb83c0ee schema:volumeNumber 18
33 rdf:type schema:PublicationVolume
34 N48570e742ca04817b979ca249fe92fae rdf:first sg:person.01316567627.91
35 rdf:rest Nc6a5348f66c7466d91bd2cede48ad378
36 N51fb2e01ca2545a9bb5f8520296d2568 schema:name readcube_id
37 schema:value 389c1e9040d8b9c05bece310f58489bad303c04ec7277a155ae8819b04e7648f
38 rdf:type schema:PropertyValue
39 N64a7e6e4e71145c58602de8999f1c17e schema:name Bell Labs – Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974, USA
40 rdf:type schema:Organization
41 N6b780ae99fa84221b1525d647e718c25 schema:name dimensions_id
42 schema:value pub.1011881484
43 rdf:type schema:PropertyValue
44 N70adc5c772874a839d16df4292f67371 rdf:first sg:person.015655737162.07
45 rdf:rest N48570e742ca04817b979ca249fe92fae
46 N7709a45a0ef243c99f1d3d4c41d960e8 rdf:first sg:person.014643562643.17
47 rdf:rest N70adc5c772874a839d16df4292f67371
48 Nc6a5348f66c7466d91bd2cede48ad378 rdf:first sg:person.015474716573.95
49 rdf:rest rdf:nil
50 Ne263dba324df40b78995e1464bf291b3 schema:issueNumber 1
51 rdf:type schema:PublicationIssue
52 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
53 schema:name Information and Computing Sciences
54 rdf:type schema:DefinedTerm
55 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
56 schema:name Data Format
57 rdf:type schema:DefinedTerm
58 sg:journal.1136278 schema:issn 0933-2790
59 1432-1378
60 schema:name Journal of Cryptology
61 rdf:type schema:Periodical
62 sg:person.01316567627.91 schema:affiliation https://www.grid.ac/institutes/grid.5801.c
63 schema:familyName Maurer
64 schema:givenName Ueli
65 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91
66 rdf:type schema:Person
67 sg:person.014643562643.17 schema:affiliation https://www.grid.ac/institutes/grid.27860.3b
68 schema:familyName Fitzi
69 schema:givenName Matthias
70 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014643562643.17
71 rdf:type schema:Person
72 sg:person.015474716573.95 schema:affiliation https://www.grid.ac/institutes/grid.432790.b
73 schema:familyName Ostrovsky
74 schema:givenName Rafail
75 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95
76 rdf:type schema:Person
77 sg:person.015655737162.07 schema:affiliation N64a7e6e4e71145c58602de8999f1c17e
78 schema:familyName Garay
79 schema:givenName Juan A.
80 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015655737162.07
81 rdf:type schema:Person
82 https://www.grid.ac/institutes/grid.27860.3b schema:alternateName University of California, Davis
83 schema:name Department of Computer Science, University of California, Davis, CA 95616, USA
84 rdf:type schema:Organization
85 https://www.grid.ac/institutes/grid.432790.b schema:alternateName Ericsson (United States)
86 schema:name Telcordia Technologies Inc., 445 South Street, Morristown, NJ 07960-6438, USA
87 rdf:type schema:Organization
88 https://www.grid.ac/institutes/grid.5801.c schema:alternateName Swiss Federal Institute of Technology in Zurich
89 schema:name Department of Computer Science, ETH, CH-8096 Zurich, Switzerland
90 rdf:type schema:Organization
 




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


...