Revisiting the Efficiency of Malicious Two-Party Computation View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2007

AUTHORS

David P. Woodruff

ABSTRACT

In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification asymptotically improves at least one measure of efficiency of all known schemes. We also point out an error, and improve the analysis of one of their schemes. More... »

PAGES

79-96

Book

TITLE

Advances in Cryptology - EUROCRYPT 2007

ISBN

978-3-540-72539-8
978-3-540-72540-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-72540-4_5

DOI

http://dx.doi.org/10.1007/978-3-540-72540-4_5

DIMENSIONS

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


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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Computer Science and Artificial Intelligence Laboratory, MIT, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Computer Science and Artificial Intelligence Laboratory, MIT, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Woodruff", 
        "givenName": "David P.", 
        "id": "sg:person.012727410605.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012727410605.86"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2007", 
    "datePublishedReg": "2007-01-01", 
    "description": "In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification asymptotically improves at least one measure of efficiency of all known schemes. We also point out an error, and improve the analysis of one of their schemes.", 
    "editor": [
      {
        "familyName": "Naor", 
        "givenName": "Moni", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-72540-4_5", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-72539-8", 
        "978-3-540-72540-4"
      ], 
      "name": "Advances in Cryptology - EUROCRYPT 2007", 
      "type": "Book"
    }, 
    "keywords": [
      "two-party computation", 
      "malicious behavior", 
      "main schemes", 
      "scheme", 
      "computation", 
      "Mohassel", 
      "measure of efficiency", 
      "efficiency", 
      "compilation", 
      "error", 
      "solution", 
      "authors", 
      "measures", 
      "modification", 
      "behavior", 
      "analysis", 
      "classical solutions", 
      "Franklin", 
      "date", 
      "aim", 
      "presence", 
      "expander", 
      "problem"
    ], 
    "name": "Revisiting the Efficiency of Malicious Two-Party Computation", 
    "pagination": "79-96", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047728925"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-72540-4_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-72540-4_5", 
      "https://app.dimensions.ai/details/publication/pub.1047728925"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-11-24T21:19", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221124/entities/gbq_results/chapter/chapter_465.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-72540-4_5"
  }
]
 

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-72540-4_5'

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-72540-4_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-72540-4_5'

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-72540-4_5'


 

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

82 TRIPLES      22 PREDICATES      48 URIs      41 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-72540-4_5 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N52aed996aaea4f83840a75048a6fef7a
4 schema:datePublished 2007
5 schema:datePublishedReg 2007-01-01
6 schema:description In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification asymptotically improves at least one measure of efficiency of all known schemes. We also point out an error, and improve the analysis of one of their schemes.
7 schema:editor Nb343c73782dd4366800a58f623a31fbd
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nc136520c34ad46e8add1e39f6d8b07c1
11 schema:keywords Franklin
12 Mohassel
13 aim
14 analysis
15 authors
16 behavior
17 classical solutions
18 compilation
19 computation
20 date
21 efficiency
22 error
23 expander
24 main schemes
25 malicious behavior
26 measure of efficiency
27 measures
28 modification
29 presence
30 problem
31 scheme
32 solution
33 two-party computation
34 schema:name Revisiting the Efficiency of Malicious Two-Party Computation
35 schema:pagination 79-96
36 schema:productId N45de2fe8d45d46459ba7f1d538f6e72b
37 Nb38a999ba0e341f3a413f0ceb6ff495b
38 schema:publisher N05b3ff4a6aeb4a3fa857f4a80abbe448
39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047728925
40 https://doi.org/10.1007/978-3-540-72540-4_5
41 schema:sdDatePublished 2022-11-24T21:19
42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
43 schema:sdPublisher Nc739c8e60c6347ca9bbb33aa705b6b32
44 schema:url https://doi.org/10.1007/978-3-540-72540-4_5
45 sgo:license sg:explorer/license/
46 sgo:sdDataset chapters
47 rdf:type schema:Chapter
48 N05b3ff4a6aeb4a3fa857f4a80abbe448 schema:name Springer Nature
49 rdf:type schema:Organisation
50 N2b8796a9a76e40fbaffd8ab76510525f schema:familyName Naor
51 schema:givenName Moni
52 rdf:type schema:Person
53 N45de2fe8d45d46459ba7f1d538f6e72b schema:name doi
54 schema:value 10.1007/978-3-540-72540-4_5
55 rdf:type schema:PropertyValue
56 N52aed996aaea4f83840a75048a6fef7a rdf:first sg:person.012727410605.86
57 rdf:rest rdf:nil
58 Nb343c73782dd4366800a58f623a31fbd rdf:first N2b8796a9a76e40fbaffd8ab76510525f
59 rdf:rest rdf:nil
60 Nb38a999ba0e341f3a413f0ceb6ff495b schema:name dimensions_id
61 schema:value pub.1047728925
62 rdf:type schema:PropertyValue
63 Nc136520c34ad46e8add1e39f6d8b07c1 schema:isbn 978-3-540-72539-8
64 978-3-540-72540-4
65 schema:name Advances in Cryptology - EUROCRYPT 2007
66 rdf:type schema:Book
67 Nc739c8e60c6347ca9bbb33aa705b6b32 schema:name Springer Nature - SN SciGraph project
68 rdf:type schema:Organization
69 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
70 schema:name Information and Computing Sciences
71 rdf:type schema:DefinedTerm
72 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
73 schema:name Data Format
74 rdf:type schema:DefinedTerm
75 sg:person.012727410605.86 schema:affiliation grid-institutes:grid.116068.8
76 schema:familyName Woodruff
77 schema:givenName David P.
78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012727410605.86
79 rdf:type schema:Person
80 grid-institutes:grid.116068.8 schema:alternateName Computer Science and Artificial Intelligence Laboratory, MIT, USA
81 schema:name Computer Science and Artificial Intelligence Laboratory, MIT, USA
82 rdf:type schema:Organization
 




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


...