Secure Hash-and-Sign Signatures Without the Random Oracle View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1999-04-15

AUTHORS

Rosario Gennaro , Shai Halevi , Tal Rabin

ABSTRACT

We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not based on “signature trees”, and nstead it uses the so called “hash-and-sign” paradigm. It is unique in that the assumptions made on the cryptographic hash function in use are well defined and reasonable (although non-standard). In particular, we do not model this function as a random oracle. We construct our proof of security in steps. First we describe and prove a construction which operates in the random oracle model. Then we show that the random oracle in this construction can be replaced by a hash function which satisfies some strong (but well defined!) computational assumptions. Finally, we demonstrate that these assumptions are reasonable, by proving that a function satisfying them exists under standard intractability assumptions. More... »

PAGES

123-139

Book

TITLE

Advances in Cryptology — EUROCRYPT ’99

ISBN

978-3-540-65889-4
978-3-540-48910-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-48910-x_9

DOI

http://dx.doi.org/10.1007/3-540-48910-x_9

DIMENSIONS

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


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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gennaro", 
        "givenName": "Rosario", 
        "id": "sg:person.013573255563.35", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, 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": "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, 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": "1999-04-15", 
    "datePublishedReg": "1999-04-15", 
    "description": "We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not based on \u201csignature trees\u201d, and nstead it uses the so called \u201chash-and-sign\u201d paradigm. It is unique in that the assumptions made on the cryptographic hash function in use are well defined and reasonable (although non-standard). In particular, we do not model this function as a random oracle. We construct our proof of security in steps. First we describe and prove a construction which operates in the random oracle model. Then we show that the random oracle in this construction can be replaced by a hash function which satisfies some strong (but well defined!) computational assumptions. Finally, we demonstrate that these assumptions are reasonable, by proving that a function satisfying them exists under standard intractability assumptions.", 
    "editor": [
      {
        "familyName": "Stern", 
        "givenName": "Jacques", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-48910-x_9", 
    "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": [
      "random oracles", 
      "hash function", 
      "cryptographic hash functions", 
      "proof of security", 
      "random oracle model", 
      "new signature scheme", 
      "standard intractability assumptions", 
      "secure hash", 
      "computational assumptions", 
      "signature tree", 
      "oracle model", 
      "message attack", 
      "intractability assumptions", 
      "signature scheme", 
      "oracle", 
      "hash", 
      "scheme", 
      "security", 
      "attacks", 
      "paradigm", 
      "proof", 
      "construction", 
      "trees", 
      "assumption", 
      "step", 
      "model", 
      "signatures", 
      "function", 
      "use", 
      "variants", 
      "conjecture", 
      "signs"
    ], 
    "name": "Secure Hash-and-Sign Signatures Without the Random Oracle", 
    "pagination": "123-139", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1027470852"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-48910-x_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-48910-x_9", 
      "https://app.dimensions.ai/details/publication/pub.1027470852"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:41", 
    "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_212.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-48910-x_9"
  }
]
 

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/3-540-48910-x_9'

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_9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-48910-x_9'

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_9'


 

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

106 TRIPLES      23 PREDICATES      57 URIs      50 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-48910-x_9 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N1f43e46916724ff3a9870f2084797a40
4 schema:datePublished 1999-04-15
5 schema:datePublishedReg 1999-04-15
6 schema:description We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not based on “signature trees”, and nstead it uses the so called “hash-and-sign” paradigm. It is unique in that the assumptions made on the cryptographic hash function in use are well defined and reasonable (although non-standard). In particular, we do not model this function as a random oracle. We construct our proof of security in steps. First we describe and prove a construction which operates in the random oracle model. Then we show that the random oracle in this construction can be replaced by a hash function which satisfies some strong (but well defined!) computational assumptions. Finally, we demonstrate that these assumptions are reasonable, by proving that a function satisfying them exists under standard intractability assumptions.
7 schema:editor Ndd8024368cc74996bb50e6676113074a
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N69537ed630574821bd111b06b565fd72
12 schema:keywords assumption
13 attacks
14 computational assumptions
15 conjecture
16 construction
17 cryptographic hash functions
18 function
19 hash
20 hash function
21 intractability assumptions
22 message attack
23 model
24 new signature scheme
25 oracle
26 oracle model
27 paradigm
28 proof
29 proof of security
30 random oracle model
31 random oracles
32 scheme
33 secure hash
34 security
35 signature scheme
36 signature tree
37 signatures
38 signs
39 standard intractability assumptions
40 step
41 trees
42 use
43 variants
44 schema:name Secure Hash-and-Sign Signatures Without the Random Oracle
45 schema:pagination 123-139
46 schema:productId N7dde218644d04161a6e0cc2f907a9e45
47 Na35f5b8f223944a5828fc6f00866f9b0
48 schema:publisher N122acad9782749bf9a7754d7cc3b64f4
49 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027470852
50 https://doi.org/10.1007/3-540-48910-x_9
51 schema:sdDatePublished 2022-05-10T10:41
52 schema:sdLicense https://scigraph.springernature.com/explorer/license/
53 schema:sdPublisher N9c1e4c30f07c40c998711a36544310ff
54 schema:url https://doi.org/10.1007/3-540-48910-x_9
55 sgo:license sg:explorer/license/
56 sgo:sdDataset chapters
57 rdf:type schema:Chapter
58 N122acad9782749bf9a7754d7cc3b64f4 schema:name Springer Nature
59 rdf:type schema:Organisation
60 N1f43e46916724ff3a9870f2084797a40 rdf:first sg:person.013573255563.35
61 rdf:rest N76281141b69f4a298e87e4266d416d05
62 N60119142f93e4e35ba42670e5ffd36a4 rdf:first sg:person.015473523512.58
63 rdf:rest rdf:nil
64 N69537ed630574821bd111b06b565fd72 schema:isbn 978-3-540-48910-8
65 978-3-540-65889-4
66 schema:name Advances in Cryptology — EUROCRYPT ’99
67 rdf:type schema:Book
68 N76281141b69f4a298e87e4266d416d05 rdf:first sg:person.015100320721.93
69 rdf:rest N60119142f93e4e35ba42670e5ffd36a4
70 N7dde218644d04161a6e0cc2f907a9e45 schema:name doi
71 schema:value 10.1007/3-540-48910-x_9
72 rdf:type schema:PropertyValue
73 N9c1e4c30f07c40c998711a36544310ff schema:name Springer Nature - SN SciGraph project
74 rdf:type schema:Organization
75 Na35f5b8f223944a5828fc6f00866f9b0 schema:name dimensions_id
76 schema:value pub.1027470852
77 rdf:type schema:PropertyValue
78 Ndcdaabb6643f41798c85ab7d9f751898 schema:familyName Stern
79 schema:givenName Jacques
80 rdf:type schema:Person
81 Ndd8024368cc74996bb50e6676113074a rdf:first Ndcdaabb6643f41798c85ab7d9f751898
82 rdf:rest rdf:nil
83 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
84 schema:name Information and Computing Sciences
85 rdf:type schema:DefinedTerm
86 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
87 schema:name Computation Theory and Mathematics
88 rdf:type schema:DefinedTerm
89 sg:person.013573255563.35 schema:affiliation grid-institutes:grid.481554.9
90 schema:familyName Gennaro
91 schema:givenName Rosario
92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35
93 rdf:type schema:Person
94 sg:person.015100320721.93 schema:affiliation grid-institutes:grid.481554.9
95 schema:familyName Halevi
96 schema:givenName Shai
97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015100320721.93
98 rdf:type schema:Person
99 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
100 schema:familyName Rabin
101 schema:givenName Tal
102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
103 rdf:type schema:Person
104 grid-institutes:grid.481554.9 schema:alternateName IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, USA
105 schema:name IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, NY, USA
106 rdf:type schema:Organization
 




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


...