Efficient Two Party and Multi Party Computation Against Covert Adversaries View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2008-01-01

AUTHORS

Vipul Goyal , Payman Mohassel , Adam Smith

ABSTRACT

Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and choose techniques rather than relying on expensive zero knowledge proofs.In this paper, we design an efficient multi-party computation protocol in the covert adversary model which remains secure even if a majority of the parties are dishonest. We also substantially improve the two-party protocol of Aumann and Lindell. Our protocols avoid general NP-reductions and only make a black box use of efficiently implementable cryptographic primitives. Our two-party protocol is constant-round while the multi-party one requires a logarithmic (in number of parties) number of rounds of interaction between the parties. Our protocols are secure as per the standard simulation-based definitions of security.Although our main focus is on designing efficient protocols in the covert adversary model, the techniques used in our two party case directly generalize to improve the efficiency of two party computation protocols secure against standard malicious adversaries. More... »

PAGES

289-306

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-78967-3_17

DOI

http://dx.doi.org/10.1007/978-3-540-78967-3_17

DIMENSIONS

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


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"
      }, 
      {
        "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": "Department of Computer Science, UCLA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science, UCLA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Goyal", 
        "givenName": "Vipul", 
        "id": "sg:person.013166145213.40", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013166145213.40"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, UC Davis", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science, UC Davis"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mohassel", 
        "givenName": "Payman", 
        "id": "sg:person.014255325057.60", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014255325057.60"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, PSU", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science, PSU"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Smith", 
        "givenName": "Adam", 
        "id": "sg:person.013307226666.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2008-01-01", 
    "datePublishedReg": "2008-01-01", 
    "description": "Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and choose techniques rather than relying on expensive zero knowledge proofs.In this paper, we design an efficient multi-party computation protocol in the covert adversary model which remains secure even if a majority of the parties are dishonest. We also substantially improve the two-party protocol of Aumann and Lindell. Our protocols avoid general NP-reductions and only make a black box use of efficiently implementable cryptographic primitives. Our two-party protocol is constant-round while the multi-party one requires a logarithmic (in number of parties) number of rounds of interaction between the parties. Our protocols are secure as per the standard simulation-based definitions of security.Although our main focus is on designing efficient protocols in the covert adversary model, the techniques used in our two party case directly generalize to improve the efficiency of two party computation protocols secure against standard malicious adversaries.", 
    "editor": [
      {
        "familyName": "Smart", 
        "givenName": "Nigel", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-78967-3_17", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-78966-6", 
        "978-3-540-78967-3"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2008", 
      "type": "Book"
    }, 
    "keywords": [
      "party computation protocol", 
      "computation protocol", 
      "two-party protocol", 
      "covert adversaries", 
      "adversary model", 
      "multi-party computation protocol", 
      "realistic security model", 
      "multi-party computation", 
      "secure computation protocols", 
      "simulation-based definition", 
      "black-box use", 
      "knowledge proofs", 
      "security model", 
      "secure computation", 
      "malicious adversaries", 
      "party computation", 
      "cryptographic primitives", 
      "adversary", 
      "two-party", 
      "logarithmic number", 
      "Lindell", 
      "security", 
      "main motivation", 
      "box use", 
      "computation", 
      "efficient protocol", 
      "party one", 
      "party case", 
      "NP reduction", 
      "protocol", 
      "primitives", 
      "main focus", 
      "parties", 
      "technique", 
      "model", 
      "proof", 
      "efficiency", 
      "definition", 
      "rounds", 
      "motivation", 
      "one", 
      "number", 
      "use", 
      "focus", 
      "Aumann", 
      "practice", 
      "interaction", 
      "cases", 
      "cut", 
      "majority", 
      "paper"
    ], 
    "name": "Efficient Two Party and Multi Party Computation Against Covert Adversaries", 
    "pagination": "289-306", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1019543573"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-78967-3_17"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-78967-3_17", 
      "https://app.dimensions.ai/details/publication/pub.1019543573"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:32", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_341.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-78967-3_17"
  }
]
 

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-540-78967-3_17'

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-540-78967-3_17'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-78967-3_17'

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-540-78967-3_17'


 

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

133 TRIPLES      23 PREDICATES      77 URIs      69 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-78967-3_17 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 anzsrc-for:0804
4 schema:author Nece5483560344dfd91c0f87b19b9c0a7
5 schema:datePublished 2008-01-01
6 schema:datePublishedReg 2008-01-01
7 schema:description Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and choose techniques rather than relying on expensive zero knowledge proofs.In this paper, we design an efficient multi-party computation protocol in the covert adversary model which remains secure even if a majority of the parties are dishonest. We also substantially improve the two-party protocol of Aumann and Lindell. Our protocols avoid general NP-reductions and only make a black box use of efficiently implementable cryptographic primitives. Our two-party protocol is constant-round while the multi-party one requires a logarithmic (in number of parties) number of rounds of interaction between the parties. Our protocols are secure as per the standard simulation-based definitions of security.Although our main focus is on designing efficient protocols in the covert adversary model, the techniques used in our two party case directly generalize to improve the efficiency of two party computation protocols secure against standard malicious adversaries.
8 schema:editor N391171e1cf034c04bf485c7374a070e6
9 schema:genre chapter
10 schema:inLanguage en
11 schema:isAccessibleForFree true
12 schema:isPartOf Na995d75575f94c489db1183e46eff659
13 schema:keywords Aumann
14 Lindell
15 NP reduction
16 adversary
17 adversary model
18 black-box use
19 box use
20 cases
21 computation
22 computation protocol
23 covert adversaries
24 cryptographic primitives
25 cut
26 definition
27 efficiency
28 efficient protocol
29 focus
30 interaction
31 knowledge proofs
32 logarithmic number
33 main focus
34 main motivation
35 majority
36 malicious adversaries
37 model
38 motivation
39 multi-party computation
40 multi-party computation protocol
41 number
42 one
43 paper
44 parties
45 party case
46 party computation
47 party computation protocol
48 party one
49 practice
50 primitives
51 proof
52 protocol
53 realistic security model
54 rounds
55 secure computation
56 secure computation protocols
57 security
58 security model
59 simulation-based definition
60 technique
61 two-party
62 two-party protocol
63 use
64 schema:name Efficient Two Party and Multi Party Computation Against Covert Adversaries
65 schema:pagination 289-306
66 schema:productId N891f8eedc86c45499ad711a8a9665274
67 Nf770a18607c9443998588a7ac89ffc38
68 schema:publisher N63c35729ae6e4ff9971f8f95a7666c0c
69 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019543573
70 https://doi.org/10.1007/978-3-540-78967-3_17
71 schema:sdDatePublished 2022-06-01T22:32
72 schema:sdLicense https://scigraph.springernature.com/explorer/license/
73 schema:sdPublisher Nfe3992dadb2946eba6352762035f255a
74 schema:url https://doi.org/10.1007/978-3-540-78967-3_17
75 sgo:license sg:explorer/license/
76 sgo:sdDataset chapters
77 rdf:type schema:Chapter
78 N391171e1cf034c04bf485c7374a070e6 rdf:first N7956ff22a12740d897233e5c5275a465
79 rdf:rest rdf:nil
80 N63c35729ae6e4ff9971f8f95a7666c0c schema:name Springer Nature
81 rdf:type schema:Organisation
82 N7956ff22a12740d897233e5c5275a465 schema:familyName Smart
83 schema:givenName Nigel
84 rdf:type schema:Person
85 N891f8eedc86c45499ad711a8a9665274 schema:name doi
86 schema:value 10.1007/978-3-540-78967-3_17
87 rdf:type schema:PropertyValue
88 N96a1c18ae6374cbba1fa41cac8156949 rdf:first sg:person.014255325057.60
89 rdf:rest Na897e274415d4f2d8d73efd073d18dcd
90 Na897e274415d4f2d8d73efd073d18dcd rdf:first sg:person.013307226666.21
91 rdf:rest rdf:nil
92 Na995d75575f94c489db1183e46eff659 schema:isbn 978-3-540-78966-6
93 978-3-540-78967-3
94 schema:name Advances in Cryptology – EUROCRYPT 2008
95 rdf:type schema:Book
96 Nece5483560344dfd91c0f87b19b9c0a7 rdf:first sg:person.013166145213.40
97 rdf:rest N96a1c18ae6374cbba1fa41cac8156949
98 Nf770a18607c9443998588a7ac89ffc38 schema:name dimensions_id
99 schema:value pub.1019543573
100 rdf:type schema:PropertyValue
101 Nfe3992dadb2946eba6352762035f255a schema:name Springer Nature - SN SciGraph project
102 rdf:type schema:Organization
103 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
104 schema:name Information and Computing Sciences
105 rdf:type schema:DefinedTerm
106 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
107 schema:name Computation Theory and Mathematics
108 rdf:type schema:DefinedTerm
109 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
110 schema:name Data Format
111 rdf:type schema:DefinedTerm
112 sg:person.013166145213.40 schema:affiliation grid-institutes:None
113 schema:familyName Goyal
114 schema:givenName Vipul
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013166145213.40
116 rdf:type schema:Person
117 sg:person.013307226666.21 schema:affiliation grid-institutes:None
118 schema:familyName Smith
119 schema:givenName Adam
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21
121 rdf:type schema:Person
122 sg:person.014255325057.60 schema:affiliation grid-institutes:None
123 schema:familyName Mohassel
124 schema:givenName Payman
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014255325057.60
126 rdf:type schema:Person
127 grid-institutes:None schema:alternateName Department of Computer Science, PSU
128 Department of Computer Science, UC Davis
129 Department of Computer Science, UCLA
130 schema:name Department of Computer Science, PSU
131 Department of Computer Science, UC Davis
132 Department of Computer Science, UCLA
133 rdf:type schema:Organization
 




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


...