Ontology type: schema:ScholarlyArticle
2004-05
AUTHORSM. I. González Vasco, D. Hofheinz, C. Martínez, R. Steinwandt
ABSTRACTThe security of two public key encryption schemes relying on the hardness of different computational problems in non-abelian groups is investigated. First, an attack on a conceptual public key scheme based on Grigorchuk groups is presented. We show that from the public data one can easily derive an “equivalent” secret key that allows the decryption of arbitrary messages encrypted under the public key. Hereafter, a security problem in another conceptual public key scheme based on non-abelian groups is pointed out. We show that in the present form the BMW scheme is vulnerable to an attack, which can recover large parts of the private subgroup chain from the public key. More... »
PAGES207-216
http://scigraph.springernature.com/pub.10.1023/b:desi.0000029223.76665.7e
DOIhttp://dx.doi.org/10.1023/b:desi.0000029223.76665.7e
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1041169408
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": {
"name": [
"33007 Oviedo, Spain"
],
"type": "Organization"
},
"familyName": "Vasco",
"givenName": "M. I. Gonz\u00e1lez",
"id": "sg:person.011645563732.16",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011645563732.16"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Karlsruhe Institute of Technology",
"id": "https://www.grid.ac/institutes/grid.7892.4",
"name": [
"Institut f\u00fcr Algorithmen und Kognitive Systeme, Arbeitsgruppe Systemsicherheit, Th. Beth, Universit\u00e4t Karlsruhe, 76128, Karlsruhe, Germany"
],
"type": "Organization"
},
"familyName": "Hofheinz",
"givenName": "D.",
"id": "sg:person.012613314054.34",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012613314054.34"
],
"type": "Person"
},
{
"affiliation": {
"name": [
"33007 Oviedo, Spain"
],
"type": "Organization"
},
"familyName": "Mart\u00ednez",
"givenName": "C.",
"id": "sg:person.015261576461.61",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015261576461.61"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Karlsruhe Institute of Technology",
"id": "https://www.grid.ac/institutes/grid.7892.4",
"name": [
"Institut f\u00fcr Algorithmen und Kognitive Systeme, Arbeitsgruppe Systemsicherheit, Th. Beth, Universit\u00e4t Karlsruhe, 76128, Karlsruhe, Germany"
],
"type": "Organization"
},
"familyName": "Steinwandt",
"givenName": "R.",
"id": "sg:person.014214774201.74",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014214774201.74"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1016/0021-8693(89)90256-1",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1002674248"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0304-3975(91)90074-c",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1006194452"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/0-387-34805-0_41",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1024880019",
"https://doi.org/10.1007/0-387-34805-0_41"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/0-387-34805-0_41",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1024880019",
"https://doi.org/10.1007/0-387-34805-0_41"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf02784504",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1033802590",
"https://doi.org/10.1007/bf02784504"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf02784504",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1033802590",
"https://doi.org/10.1007/bf02784504"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s00145-001-0018-3",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1034803657",
"https://doi.org/10.1007/s00145-001-0018-3"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1093/qmath/38.4.473",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1059988316"
],
"type": "CreativeWork"
}
],
"datePublished": "2004-05",
"datePublishedReg": "2004-05-01",
"description": "The security of two public key encryption schemes relying on the hardness of different computational problems in non-abelian groups is investigated. First, an attack on a conceptual public key scheme based on Grigorchuk groups is presented. We show that from the public data one can easily derive an \u201cequivalent\u201d secret key that allows the decryption of arbitrary messages encrypted under the public key. Hereafter, a security problem in another conceptual public key scheme based on non-abelian groups is pointed out. We show that in the present form the BMW scheme is vulnerable to an attack, which can recover large parts of the private subgroup chain from the public key.",
"genre": "research_article",
"id": "sg:pub.10.1023/b:desi.0000029223.76665.7e",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": [
{
"id": "sg:journal.1136552",
"issn": [
"0925-1022",
"1573-7586"
],
"name": "Designs, Codes and Cryptography",
"type": "Periodical"
},
{
"issueNumber": "1-3",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "32"
}
],
"name": "On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups",
"pagination": "207-216",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"c41e51c80eb8102087855573c74a67dcfe1858ae126387562d9d7dee660cc3ec"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1023/b:desi.0000029223.76665.7e"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1041169408"
]
}
],
"sameAs": [
"https://doi.org/10.1023/b:desi.0000029223.76665.7e",
"https://app.dimensions.ai/details/publication/pub.1041169408"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-11T01:06",
"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_8697_00000507.jsonl",
"type": "ScholarlyArticle",
"url": "http://link.springer.com/10.1023%2FB%3ADESI.0000029223.76665.7e"
}
]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.1023/b:desi.0000029223.76665.7e'
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.1023/b:desi.0000029223.76665.7e'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1023/b:desi.0000029223.76665.7e'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1023/b:desi.0000029223.76665.7e'
This table displays all metadata directly associated to this object as RDF triples.
107 TRIPLES
21 PREDICATES
33 URIs
19 LITERALS
7 BLANK NODES