Ontology type: schema:Chapter Open Access: True
1999-04-15
AUTHORSRonald Cramer , Ivan Damgård , Stefan Dziembowski , Martin Hirt , Tal Rabin
ABSTRACTWe consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols secure against an adversary that can corrupt any minority of the players. In this paper, we first observe that a subprotocol of theirs, known as weak secret sharing (WSS), is not secure against an adaptive adversary, contrary to what was believed earlier. We then propose new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Our protocols generalize easily to provide security against general Q2-adversaries. More... »
PAGES311-326
Advances in Cryptology — EUROCRYPT ’99
ISBN
978-3-540-65889-4
978-3-540-48910-8
http://scigraph.springernature.com/pub.10.1007/3-540-48910-x_22
DOIhttp://dx.doi.org/10.1007/3-540-48910-x_22
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1041055798
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": "ETH, Zurich, Switzerland",
"id": "http://www.grid.ac/institutes/grid.5801.c",
"name": [
"ETH, Zurich, Switzerland"
],
"type": "Organization"
},
"familyName": "Cramer",
"givenName": "Ronald",
"id": "sg:person.013660213711.14",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013660213711.14"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Aarhus University, BRICS, Switzerland",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Aarhus University, BRICS, Switzerland"
],
"type": "Organization"
},
"familyName": "Damg\u00e5rd",
"givenName": "Ivan",
"id": "sg:person.016521211021.12",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016521211021.12"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Aarhus University, BRICS, Switzerland",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Aarhus University, BRICS, Switzerland"
],
"type": "Organization"
},
"familyName": "Dziembowski",
"givenName": "Stefan",
"id": "sg:person.07521014243.18",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07521014243.18"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "ETH, Zurich, Switzerland",
"id": "http://www.grid.ac/institutes/grid.5801.c",
"name": [
"ETH, Zurich, Switzerland"
],
"type": "Organization"
},
"familyName": "Hirt",
"givenName": "Martin",
"id": "sg:person.010611500757.30",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010611500757.30"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "IBM T.J.Watson Research Center, Switzerland",
"id": "http://www.grid.ac/institutes/None",
"name": [
"IBM T.J.Watson Research Center, Switzerland"
],
"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": "1999-04-15",
"datePublishedReg": "1999-04-15",
"description": "We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols secure against an adversary that can corrupt any minority of the players. In this paper, we first observe that a subprotocol of theirs, known as weak secret sharing (WSS), is not secure against an adaptive adversary, contrary to what was believed earlier. We then propose new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Our protocols generalize easily to provide security against general Q2-adversaries.",
"editor": [
{
"familyName": "Stern",
"givenName": "Jacques",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-48910-x_22",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-540-65889-4",
"978-3-540-48910-8"
],
"name": "Advances in Cryptology \u2014 EUROCRYPT \u201999",
"type": "Book"
},
"keywords": [
"verifiable secret sharing",
"multiparty computation",
"secret sharing",
"adaptive adversary",
"Efficient Multiparty Computation",
"secure channels model",
"non-zero error probability",
"secure protocol",
"MPC protocols",
"adversary",
"broadcast channel",
"sharing",
"original one",
"computation",
"error probability",
"protocol",
"security",
"subprotocol",
"Rabin",
"players",
"model",
"channels",
"probability",
"one",
"Ben",
"minority",
"paper"
],
"name": "Efficient Multiparty Computations Secure Against an Adaptive Adversary",
"pagination": "311-326",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1041055798"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-48910-x_22"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-48910-x_22",
"https://app.dimensions.ai/details/publication/pub.1041055798"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:38",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_138.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/3-540-48910-x_22"
}
]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/3-540-48910-x_22'
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/3-540-48910-x_22'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-48910-x_22'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-48910-x_22'
This table displays all metadata directly associated to this object as RDF triples.
120 TRIPLES
23 PREDICATES
52 URIs
45 LITERALS
7 BLANK NODES