2018-11-08
AUTHORSShai Halevi , Yuval Ishai , Eyal Kushilevitz , Tal Rabin
ABSTRACTWe reconsider the security guarantee that can be achieved by general protocols for secure multiparty computation in the most basic of settings: information-theoretic security against a semi-honest adversary. Since the 1980s, we have elegant solutions to this problem that offer full security, as long as the adversary controls a minority of the parties, but fail completely when that threshold is crossed. In this work, we revisit this problem, questioning the optimality of the standard notion of security. We put forward a new notion of information-theoretic security which is strictly stronger than the standard one, and which we argue to be “best possible.” This notion still requires full security against dishonest minority in the usual sense, and adds a meaningful notion of information-theoretic security even against dishonest majority.We present protocols for useful classes of functions that satisfy this new notion of security. Our protocols have the unique feature of combining the efficiency benefits of protocols for an honest majority and (most of) the security benefits of protocols for dishonest majority. We further extend some of the solutions to the malicious setting. More... »
PAGES255-281
Theory of Cryptography
ISBN
978-3-030-03809-0
978-3-030-03810-6
http://scigraph.springernature.com/pub.10.1007/978-3-030-03810-6_10
DOIhttp://dx.doi.org/10.1007/978-3-030-03810-6_10
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1109772561
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": "IBM Research, Yorktown Heights, USA",
"id": "http://www.grid.ac/institutes/grid.481554.9",
"name": [
"IBM Research, Yorktown Heights, USA"
],
"type": "Organization"
},
"familyName": "Halevi",
"givenName": "Shai",
"id": "sg:person.015100320721.93",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015100320721.93"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Technion, Haifa, Israel",
"id": "http://www.grid.ac/institutes/grid.6451.6",
"name": [
"Technion, Haifa, Israel"
],
"type": "Organization"
},
"familyName": "Ishai",
"givenName": "Yuval",
"id": "sg:person.010434442160.49",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010434442160.49"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Technion, Haifa, Israel",
"id": "http://www.grid.ac/institutes/grid.6451.6",
"name": [
"Technion, Haifa, Israel"
],
"type": "Organization"
},
"familyName": "Kushilevitz",
"givenName": "Eyal",
"id": "sg:person.013624731540.48",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624731540.48"
],
"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": "2018-11-08",
"datePublishedReg": "2018-11-08",
"description": "We reconsider the security guarantee that can be achieved by general protocols for secure multiparty computation in the most basic of settings: information-theoretic security against a semi-honest adversary. Since the 1980s, we have elegant solutions to this problem that offer full security, as long as the adversary controls a minority of the parties, but fail completely when that threshold is crossed. In this work, we revisit this problem, questioning the optimality of the standard notion of security. We put forward a new notion of information-theoretic security which is strictly stronger than the standard one, and which we argue to be \u201cbest possible.\u201d This notion still requires full security against dishonest minority in the usual sense, and adds a meaningful notion of information-theoretic security even against dishonest majority.We present protocols for useful classes of functions that satisfy this new notion of security. Our protocols have the unique feature of combining the efficiency benefits of protocols for an honest majority and (most of) the security benefits of protocols for dishonest majority. We further extend some of the solutions to the malicious setting.",
"editor": [
{
"familyName": "Beimel",
"givenName": "Amos",
"type": "Person"
},
{
"familyName": "Dziembowski",
"givenName": "Stefan",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-030-03810-6_10",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-030-03809-0",
"978-3-030-03810-6"
],
"name": "Theory of Cryptography",
"type": "Book"
},
"keywords": [
"information-theoretic security",
"dishonest majority",
"full security",
"secure multiparty computation",
"semi-honest adversaries",
"multiparty computation",
"dishonest minority",
"security guarantees",
"honest majority",
"malicious setting",
"new notion",
"security",
"adversary",
"elegant solution",
"meaningful notion",
"standard notion",
"security benefits",
"useful class",
"protocol",
"efficiency benefits",
"guarantees",
"computation",
"standard ones",
"unique features",
"optimality",
"notion",
"solution",
"features",
"general protocol",
"benefits",
"parties",
"work",
"MPC",
"class",
"setting",
"one",
"sense",
"usual sense",
"threshold",
"function",
"majority",
"minority",
"problem"
],
"name": "Best Possible Information-Theoretic MPC",
"pagination": "255-281",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1109772561"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-030-03810-6_10"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-030-03810-6_10",
"https://app.dimensions.ai/details/publication/pub.1109772561"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:49",
"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_59.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-030-03810-6_10"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
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-030-03810-6_10'
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-030-03810-6_10'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-03810-6_10'
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-030-03810-6_10'
This table displays all metadata directly associated to this object as RDF triples.
132 TRIPLES
23 PREDICATES
68 URIs
61 LITERALS
7 BLANK NODES