SipHash: A Fast Short-Input PRF View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2012

AUTHORS

Jean-Philippe Aumasson , Daniel J. Bernstein

ABSTRACT

SipHash is a family of pseudorandom functions optimized for short inputs. Target applications include network traffic authentication and hash-table lookups protected against hash-flooding denial-of-service attacks. SipHash is simpler than MACs based on universal hashing, and faster on short inputs. Compared to dedicated designs for hash-table lookup, SipHash has well-defined security goals and competitive performance. For example, SipHash processes a 16-byte input with a fresh key in 140 cycles on an AMD FX-8150 processor, which is much faster than state-of-the-art MACs. We propose that hash tables switch to SipHash as a hash function. More... »

PAGES

489-508

Book

TITLE

Progress in Cryptology - INDOCRYPT 2012

ISBN

978-3-642-34930-0
978-3-642-34931-7

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-34931-7_28

DOI

http://dx.doi.org/10.1007/978-3-642-34931-7_28

DIMENSIONS

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


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": "NAGRA, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.425451.3", 
          "name": [
            "NAGRA, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Aumasson", 
        "givenName": "Jean-Philippe", 
        "id": "sg:person.012606440341.66", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Illinois at Chicago, 60607-7045, Chicago, IL, USA", 
          "id": "http://www.grid.ac/institutes/grid.185648.6", 
          "name": [
            "Department of Computer Science, University of Illinois at Chicago, 60607-7045, Chicago, IL, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bernstein", 
        "givenName": "Daniel J.", 
        "id": "sg:person.011105222633.26", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011105222633.26"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "SipHash is a family of pseudorandom functions optimized for short inputs. Target applications include network traffic authentication and hash-table lookups protected against hash-flooding denial-of-service attacks. SipHash is simpler than MACs based on universal hashing, and faster on short inputs. Compared to dedicated designs for hash-table lookup, SipHash has well-defined security goals and competitive performance. For example, SipHash processes a 16-byte input with a fresh key in 140 cycles on an AMD FX-8150 processor, which is much faster than state-of-the-art MACs. We propose that hash tables switch to SipHash as a hash function.", 
    "editor": [
      {
        "familyName": "Galbraith", 
        "givenName": "Steven", 
        "type": "Person"
      }, 
      {
        "familyName": "Nandi", 
        "givenName": "Mridul", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-34931-7_28", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-34930-0", 
        "978-3-642-34931-7"
      ], 
      "name": "Progress in Cryptology - INDOCRYPT 2012", 
      "type": "Book"
    }, 
    "keywords": [
      "hash table lookups", 
      "short input", 
      "service attacks", 
      "fresh keys", 
      "hash table", 
      "security goals", 
      "hash function", 
      "art MAC", 
      "SipHash", 
      "pseudorandom functions", 
      "universal hashing", 
      "target application", 
      "competitive performance", 
      "lookup", 
      "dedicated design", 
      "MAC", 
      "authentication", 
      "hashing", 
      "processors", 
      "input", 
      "denial", 
      "attacks", 
      "key", 
      "applications", 
      "performance", 
      "table", 
      "goal", 
      "design", 
      "example", 
      "function", 
      "state", 
      "PRF", 
      "cycle", 
      "family", 
      "FX"
    ], 
    "name": "SipHash: A Fast Short-Input PRF", 
    "pagination": "489-508", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035080435"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-34931-7_28"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-34931-7_28", 
      "https://app.dimensions.ai/details/publication/pub.1035080435"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:28", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_17.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-34931-7_28"
  }
]
 

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-642-34931-7_28'

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-642-34931-7_28'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-34931-7_28'

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-642-34931-7_28'


 

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

110 TRIPLES      23 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-34931-7_28 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N354759cabed74bf8b052a0fd20f23b00
4 schema:datePublished 2012
5 schema:datePublishedReg 2012-01-01
6 schema:description SipHash is a family of pseudorandom functions optimized for short inputs. Target applications include network traffic authentication and hash-table lookups protected against hash-flooding denial-of-service attacks. SipHash is simpler than MACs based on universal hashing, and faster on short inputs. Compared to dedicated designs for hash-table lookup, SipHash has well-defined security goals and competitive performance. For example, SipHash processes a 16-byte input with a fresh key in 140 cycles on an AMD FX-8150 processor, which is much faster than state-of-the-art MACs. We propose that hash tables switch to SipHash as a hash function.
7 schema:editor Ncf70a54b81d446f5893b035812118542
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N161fc64ab1614087a25d02e7bd4b8d72
12 schema:keywords FX
13 MAC
14 PRF
15 SipHash
16 applications
17 art MAC
18 attacks
19 authentication
20 competitive performance
21 cycle
22 dedicated design
23 denial
24 design
25 example
26 family
27 fresh keys
28 function
29 goal
30 hash function
31 hash table
32 hash table lookups
33 hashing
34 input
35 key
36 lookup
37 performance
38 processors
39 pseudorandom functions
40 security goals
41 service attacks
42 short input
43 state
44 table
45 target application
46 universal hashing
47 schema:name SipHash: A Fast Short-Input PRF
48 schema:pagination 489-508
49 schema:productId Nf044ab3a6e68440d8ea19b1388902680
50 Nfcbc75aa17cc4cac8ac1f240c44482d1
51 schema:publisher Nd6ec1955d5624ed8ac5e4b6f1142624e
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035080435
53 https://doi.org/10.1007/978-3-642-34931-7_28
54 schema:sdDatePublished 2022-06-01T22:28
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher N491f9e973cbe47038190de63c24677fc
57 schema:url https://doi.org/10.1007/978-3-642-34931-7_28
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N063afef9efeb41348d19fcb48b02ac2e rdf:first N839e4e9e429d41a793fefa83938ba167
62 rdf:rest rdf:nil
63 N161fc64ab1614087a25d02e7bd4b8d72 schema:isbn 978-3-642-34930-0
64 978-3-642-34931-7
65 schema:name Progress in Cryptology - INDOCRYPT 2012
66 rdf:type schema:Book
67 N354759cabed74bf8b052a0fd20f23b00 rdf:first sg:person.012606440341.66
68 rdf:rest N8d804a135a7d49c2959f2634c9b71e8b
69 N491f9e973cbe47038190de63c24677fc schema:name Springer Nature - SN SciGraph project
70 rdf:type schema:Organization
71 N839e4e9e429d41a793fefa83938ba167 schema:familyName Nandi
72 schema:givenName Mridul
73 rdf:type schema:Person
74 N8d804a135a7d49c2959f2634c9b71e8b rdf:first sg:person.011105222633.26
75 rdf:rest rdf:nil
76 Na64acbceb9864164abcfe40710353ef5 schema:familyName Galbraith
77 schema:givenName Steven
78 rdf:type schema:Person
79 Ncf70a54b81d446f5893b035812118542 rdf:first Na64acbceb9864164abcfe40710353ef5
80 rdf:rest N063afef9efeb41348d19fcb48b02ac2e
81 Nd6ec1955d5624ed8ac5e4b6f1142624e schema:name Springer Nature
82 rdf:type schema:Organisation
83 Nf044ab3a6e68440d8ea19b1388902680 schema:name doi
84 schema:value 10.1007/978-3-642-34931-7_28
85 rdf:type schema:PropertyValue
86 Nfcbc75aa17cc4cac8ac1f240c44482d1 schema:name dimensions_id
87 schema:value pub.1035080435
88 rdf:type schema:PropertyValue
89 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
90 schema:name Information and Computing Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
93 schema:name Data Format
94 rdf:type schema:DefinedTerm
95 sg:person.011105222633.26 schema:affiliation grid-institutes:grid.185648.6
96 schema:familyName Bernstein
97 schema:givenName Daniel J.
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011105222633.26
99 rdf:type schema:Person
100 sg:person.012606440341.66 schema:affiliation grid-institutes:grid.425451.3
101 schema:familyName Aumasson
102 schema:givenName Jean-Philippe
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66
104 rdf:type schema:Person
105 grid-institutes:grid.185648.6 schema:alternateName Department of Computer Science, University of Illinois at Chicago, 60607-7045, Chicago, IL, USA
106 schema:name Department of Computer Science, University of Illinois at Chicago, 60607-7045, Chicago, IL, USA
107 rdf:type schema:Organization
108 grid-institutes:grid.425451.3 schema:alternateName NAGRA, Switzerland
109 schema:name NAGRA, Switzerland
110 rdf:type schema:Organization
 




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


...