Efficient parallelizable hashing using small non-compressing primitives View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2015-04-29

AUTHORS

Bart Mennink, Bart Preneel

ABSTRACT

A well-established method of constructing hash functions is to base them on non-compressing primitives, such as one-way functions or permutations. In this work, we present Sr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^r$$\end{document}, an rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$rn$$\end{document}-to-n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-bit compression function (for r≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r\ge 1$$\end{document}) making 2r-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2r-1$$\end{document} calls to n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-to-n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-bit primitives (random functions or permutations). Sr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^r$$\end{document} compresses its inputs at a rate (the amount of message blocks per primitive call) up to almost 1/2, and it outperforms all existing schemes with respect to rate and/or the size of underlying primitives. For instance, instantiated with the 1600\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1600$$\end{document}-bit permutation of NIST’s SHA-3 hash function standard, it offers about 800\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$800$$\end{document}-bit security at a rate of almost 1/2, while SHA-3-512 itself achieves only 512\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$512$$\end{document}-bit security at a rate of about 1/3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1/3$$\end{document}. We prove that Sr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^r$$\end{document} achieves asymptotically optimal collision security against semi-adaptive adversaries up to almost 2n/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{n/2}$$\end{document} queries and that it can be made preimage secure up to 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^n$$\end{document} queries using a simple tweak. More... »

PAGES

285-300

References to SciGraph publications

  • 2012. Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry in THEORY OF CRYPTOGRAPHY
  • 1994. Hash functions based on block ciphers: a synthetic approach in ADVANCES IN CRYPTOLOGY — CRYPTO’ 93
  • 2005. On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2004. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance in FAST SOFTWARE ENCRYPTION
  • 2011. Security Reductions of the Second Round SHA-3 Candidates in INFORMATION SECURITY
  • 1998-01-01. Attacks on Fast Double Block Length Hash Functions in JOURNAL OF CRYPTOLOGY
  • 2008-01-01. Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions in ADVANCES IN CRYPTOLOGY – CRYPTO 2008
  • 2008-01-01. Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers in ADVANCES IN CRYPTOLOGY – CRYPTO 2008
  • 1993. Hash Functions Based on Block Ciphers in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 2011. Domain Extension for MACs Beyond the Birthday Barrier in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2011
  • 2009. Blockcipher-Based Hashing Revisited in FAST SOFTWARE ENCRYPTION
  • 2013-11-23. Sufficient conditions for sound tree and sequential hashing modes in INTERNATIONAL JOURNAL OF INFORMATION SECURITY
  • 2009. Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 in FAST SOFTWARE ENCRYPTION
  • 2012. Hash Functions Based on Three Permutations: A Generic Security Analysis in ADVANCES IN CRYPTOLOGY – CRYPTO 2012
  • 2012. Stam’s Conjecture and Threshold Phenomena in Collision Resistance in ADVANCES IN CRYPTOLOGY – CRYPTO 2012
  • 1990. One Way Hash Functions and DES in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 2006. Some Plausible Constructions of Double-Block-Length Hash Functions in FAST SOFTWARE ENCRYPTION
  • 2007-01-01. Domain Extension of Public Random Functions: Beyond the Birthday Barrier in ADVANCES IN CRYPTOLOGY - CRYPTO 2007
  • 2002-09-13. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV in ADVANCES IN CRYPTOLOGY — CRYPTO 2002
  • 2012-02-05. The parazoa family: generalizing the sponge hash functions in INTERNATIONAL JOURNAL OF INFORMATION SECURITY
  • 2008. On the Indifferentiability of the Sponge Construction in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2008-01-01. Security/Efficiency Tradeoffs for Permutation-Based Hashing in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2008-01-01. Building a Collision-Resistant Compression Function from Non-compressing Primitives in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2010-07-16. An Analysis of the Blockcipher-Based Hash Functions from PGV in JOURNAL OF CRYPTOLOGY
  • 2006. Combining Compression Functions and Block Cipher-Based Hash Functions in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2006
  • 2010. Stam’s Collision Resistance Conjecture in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2010
  • 1990. A Design Principle for Hash Functions in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 2007-01-01. The Grindahl Hash Functions in FAST SOFTWARE ENCRYPTION
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10207-015-0288-7

    DOI

    http://dx.doi.org/10.1007/s10207-015-0288-7

    DIMENSIONS

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


    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": "iMinds, Gent, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.56912.39", 
              "name": [
                "ESAT/COSIC, Department of Electrical Engineering, KU Leuven, Leuven, Belgium", 
                "iMinds, Gent, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Mennink", 
            "givenName": "Bart", 
            "id": "sg:person.012130641461.76", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "iMinds, Gent, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.56912.39", 
              "name": [
                "ESAT/COSIC, Department of Electrical Engineering, KU Leuven, Leuven, Belgium", 
                "iMinds, Gent, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Preneel", 
            "givenName": "Bart", 
            "id": "sg:person.011115044357.39", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-78967-3_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048096154", 
              "https://doi.org/10.1007/978-3-540-78967-3_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-13190-5_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002239591", 
              "https://doi.org/10.1007/978-3-642-13190-5_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-32009-5_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015220302", 
              "https://doi.org/10.1007/978-3-642-32009-5_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-28914-9_17", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012481504", 
              "https://doi.org/10.1007/978-3-642-28914-9_17"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45708-9_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019344851", 
              "https://doi.org/10.1007/3-540-45708-9_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78967-3_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042749994", 
              "https://doi.org/10.1007/978-3-540-78967-3_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s001459900035", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045904646", 
              "https://doi.org/10.1007/s001459900035"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03317-9_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021850873", 
              "https://doi.org/10.1007/978-3-642-03317-9_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74143-5_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040316010", 
              "https://doi.org/10.1007/978-3-540-74143-5_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-47555-9_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001052854", 
              "https://doi.org/10.1007/3-540-47555-9_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-20465-4_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029767535", 
              "https://doi.org/10.1007/978-3-642-20465-4_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48329-2_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050504124", 
              "https://doi.org/10.1007/3-540-48329-2_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-18178-8_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047663745", 
              "https://doi.org/10.1007/978-3-642-18178-8_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34805-0_39", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026402674", 
              "https://doi.org/10.1007/0-387-34805-0_39"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-70583-3_52", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011748223", 
              "https://doi.org/10.1007/978-3-540-70583-3_52"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-25937-4_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044984781", 
              "https://doi.org/10.1007/978-3-540-25937-4_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11935230_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018054502", 
              "https://doi.org/10.1007/11935230_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11426639_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047991750", 
              "https://doi.org/10.1007/11426639_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85174-5_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012686200", 
              "https://doi.org/10.1007/978-3-540-85174-5_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85174-5_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018237593", 
              "https://doi.org/10.1007/978-3-540-85174-5_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74619-5_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009350046", 
              "https://doi.org/10.1007/978-3-540-74619-5_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34805-0_40", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008729969", 
              "https://doi.org/10.1007/0-387-34805-0_40"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-32009-5_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011789286", 
              "https://doi.org/10.1007/978-3-642-32009-5_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10207-013-0220-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023684010", 
              "https://doi.org/10.1007/s10207-013-0220-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03317-9_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008198067", 
              "https://doi.org/10.1007/978-3-642-03317-9_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11799313_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032514291", 
              "https://doi.org/10.1007/11799313_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-010-9071-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048373831", 
              "https://doi.org/10.1007/s00145-010-9071-0"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10207-012-0157-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047161147", 
              "https://doi.org/10.1007/s10207-012-0157-6"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2015-04-29", 
        "datePublishedReg": "2015-04-29", 
        "description": "A well-established method of constructing hash functions is to base them on non-compressing primitives, such as one-way functions or permutations. In this work, we present Sr\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$S^r$$\\end{document}, an rn\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$rn$$\\end{document}-to-n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$n$$\\end{document}-bit compression function (for r\u22651\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$r\\ge 1$$\\end{document}) making 2r-1\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2r-1$$\\end{document} calls to n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$n$$\\end{document}-to-n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$n$$\\end{document}-bit primitives (random functions or permutations). Sr\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$S^r$$\\end{document} compresses its inputs at a rate (the amount of message blocks per primitive call) up to almost 1/2, and it outperforms all existing schemes with respect to rate and/or the size of underlying primitives. For instance, instantiated with the 1600\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$1600$$\\end{document}-bit permutation of NIST\u2019s SHA-3 hash function standard, it offers about 800\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$800$$\\end{document}-bit security at a rate of almost 1/2, while SHA-3-512 itself achieves only 512\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$512$$\\end{document}-bit security at a rate of about 1/3\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$1/3$$\\end{document}. We prove that Sr\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$S^r$$\\end{document} achieves asymptotically optimal collision security against semi-adaptive adversaries up to almost 2n/2\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2^{n/2}$$\\end{document} queries and that it can be made preimage secure up to 2n\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$2^n$$\\end{document} queries using a simple tweak.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s10207-015-0288-7", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136826", 
            "issn": [
              "1615-5262", 
              "1615-5270"
            ], 
            "name": "International Journal of Information Security", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "15"
          }
        ], 
        "keywords": [
          "SHA-3", 
          "simple tweak", 
          "hash function", 
          "security", 
          "bit security", 
          "bit permutation", 
          "primitives", 
          "scheme", 
          "size", 
          "adversary", 
          "compression function", 
          "method", 
          "work", 
          "rate", 
          "standards", 
          "function", 
          "one-way functions", 
          "permutations", 
          "respect", 
          "input", 
          "instances", 
          "queries", 
          "TWEAK", 
          "preimage", 
          "optimal collision security", 
          "collision security"
        ], 
        "name": "Efficient parallelizable hashing using small non-compressing primitives", 
        "pagination": "285-300", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1020348120"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10207-015-0288-7"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10207-015-0288-7", 
          "https://app.dimensions.ai/details/publication/pub.1020348120"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-09-02T15:58", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/article/article_650.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s10207-015-0288-7"
      }
    ]
     

    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/s10207-015-0288-7'

    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/s10207-015-0288-7'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10207-015-0288-7'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10207-015-0288-7'


     

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

    203 TRIPLES      21 PREDICATES      78 URIs      42 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10207-015-0288-7 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N7f6cbe3a3f544e5894af2881733be901
    4 schema:citation sg:pub.10.1007/0-387-34805-0_39
    5 sg:pub.10.1007/0-387-34805-0_40
    6 sg:pub.10.1007/11426639_31
    7 sg:pub.10.1007/11799313_14
    8 sg:pub.10.1007/11935230_21
    9 sg:pub.10.1007/3-540-45708-9_21
    10 sg:pub.10.1007/3-540-47555-9_5
    11 sg:pub.10.1007/3-540-48329-2_31
    12 sg:pub.10.1007/978-3-540-25937-4_24
    13 sg:pub.10.1007/978-3-540-70583-3_52
    14 sg:pub.10.1007/978-3-540-74143-5_11
    15 sg:pub.10.1007/978-3-540-74619-5_3
    16 sg:pub.10.1007/978-3-540-78967-3_11
    17 sg:pub.10.1007/978-3-540-78967-3_13
    18 sg:pub.10.1007/978-3-540-85174-5_22
    19 sg:pub.10.1007/978-3-540-85174-5_24
    20 sg:pub.10.1007/978-3-642-03317-9_5
    21 sg:pub.10.1007/978-3-642-03317-9_7
    22 sg:pub.10.1007/978-3-642-13190-5_30
    23 sg:pub.10.1007/978-3-642-18178-8_5
    24 sg:pub.10.1007/978-3-642-20465-4_19
    25 sg:pub.10.1007/978-3-642-28914-9_17
    26 sg:pub.10.1007/978-3-642-32009-5_20
    27 sg:pub.10.1007/978-3-642-32009-5_23
    28 sg:pub.10.1007/s00145-010-9071-0
    29 sg:pub.10.1007/s001459900035
    30 sg:pub.10.1007/s10207-012-0157-6
    31 sg:pub.10.1007/s10207-013-0220-y
    32 schema:datePublished 2015-04-29
    33 schema:datePublishedReg 2015-04-29
    34 schema:description A well-established method of constructing hash functions is to base them on non-compressing primitives, such as one-way functions or permutations. In this work, we present Sr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^r$$\end{document}, an rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$rn$$\end{document}-to-n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-bit compression function (for r≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r\ge 1$$\end{document}) making 2r-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2r-1$$\end{document} calls to n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-to-n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-bit primitives (random functions or permutations). Sr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^r$$\end{document} compresses its inputs at a rate (the amount of message blocks per primitive call) up to almost 1/2, and it outperforms all existing schemes with respect to rate and/or the size of underlying primitives. For instance, instantiated with the 1600\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1600$$\end{document}-bit permutation of NIST’s SHA-3 hash function standard, it offers about 800\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$800$$\end{document}-bit security at a rate of almost 1/2, while SHA-3-512 itself achieves only 512\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$512$$\end{document}-bit security at a rate of about 1/3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1/3$$\end{document}. We prove that Sr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S^r$$\end{document} achieves asymptotically optimal collision security against semi-adaptive adversaries up to almost 2n/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{n/2}$$\end{document} queries and that it can be made preimage secure up to 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^n$$\end{document} queries using a simple tweak.
    35 schema:genre article
    36 schema:isAccessibleForFree true
    37 schema:isPartOf N4dc844b08a154ce4ae8e84a96b275a77
    38 N6ec04509297e40388742ed2d9985b499
    39 sg:journal.1136826
    40 schema:keywords SHA-3
    41 TWEAK
    42 adversary
    43 bit permutation
    44 bit security
    45 collision security
    46 compression function
    47 function
    48 hash function
    49 input
    50 instances
    51 method
    52 one-way functions
    53 optimal collision security
    54 permutations
    55 preimage
    56 primitives
    57 queries
    58 rate
    59 respect
    60 scheme
    61 security
    62 simple tweak
    63 size
    64 standards
    65 work
    66 schema:name Efficient parallelizable hashing using small non-compressing primitives
    67 schema:pagination 285-300
    68 schema:productId N79dbbb26e6e349f8abc7277c321cd40f
    69 Nb8ec85261cc64a958aa0f6109b451a0b
    70 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020348120
    71 https://doi.org/10.1007/s10207-015-0288-7
    72 schema:sdDatePublished 2022-09-02T15:58
    73 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    74 schema:sdPublisher Ne16cb78de3584d36ad001774d6648273
    75 schema:url https://doi.org/10.1007/s10207-015-0288-7
    76 sgo:license sg:explorer/license/
    77 sgo:sdDataset articles
    78 rdf:type schema:ScholarlyArticle
    79 N4dc844b08a154ce4ae8e84a96b275a77 schema:volumeNumber 15
    80 rdf:type schema:PublicationVolume
    81 N6ec04509297e40388742ed2d9985b499 schema:issueNumber 3
    82 rdf:type schema:PublicationIssue
    83 N79dbbb26e6e349f8abc7277c321cd40f schema:name dimensions_id
    84 schema:value pub.1020348120
    85 rdf:type schema:PropertyValue
    86 N7f6cbe3a3f544e5894af2881733be901 rdf:first sg:person.012130641461.76
    87 rdf:rest Ndc1483554b1648c483f4d675c2b888a8
    88 Nb8ec85261cc64a958aa0f6109b451a0b schema:name doi
    89 schema:value 10.1007/s10207-015-0288-7
    90 rdf:type schema:PropertyValue
    91 Ndc1483554b1648c483f4d675c2b888a8 rdf:first sg:person.011115044357.39
    92 rdf:rest rdf:nil
    93 Ne16cb78de3584d36ad001774d6648273 schema:name Springer Nature - SN SciGraph project
    94 rdf:type schema:Organization
    95 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    96 schema:name Information and Computing Sciences
    97 rdf:type schema:DefinedTerm
    98 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    99 schema:name Data Format
    100 rdf:type schema:DefinedTerm
    101 sg:journal.1136826 schema:issn 1615-5262
    102 1615-5270
    103 schema:name International Journal of Information Security
    104 schema:publisher Springer Nature
    105 rdf:type schema:Periodical
    106 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.56912.39
    107 schema:familyName Preneel
    108 schema:givenName Bart
    109 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
    110 rdf:type schema:Person
    111 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.56912.39
    112 schema:familyName Mennink
    113 schema:givenName Bart
    114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
    115 rdf:type schema:Person
    116 sg:pub.10.1007/0-387-34805-0_39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026402674
    117 https://doi.org/10.1007/0-387-34805-0_39
    118 rdf:type schema:CreativeWork
    119 sg:pub.10.1007/0-387-34805-0_40 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008729969
    120 https://doi.org/10.1007/0-387-34805-0_40
    121 rdf:type schema:CreativeWork
    122 sg:pub.10.1007/11426639_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047991750
    123 https://doi.org/10.1007/11426639_31
    124 rdf:type schema:CreativeWork
    125 sg:pub.10.1007/11799313_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032514291
    126 https://doi.org/10.1007/11799313_14
    127 rdf:type schema:CreativeWork
    128 sg:pub.10.1007/11935230_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018054502
    129 https://doi.org/10.1007/11935230_21
    130 rdf:type schema:CreativeWork
    131 sg:pub.10.1007/3-540-45708-9_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019344851
    132 https://doi.org/10.1007/3-540-45708-9_21
    133 rdf:type schema:CreativeWork
    134 sg:pub.10.1007/3-540-47555-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001052854
    135 https://doi.org/10.1007/3-540-47555-9_5
    136 rdf:type schema:CreativeWork
    137 sg:pub.10.1007/3-540-48329-2_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050504124
    138 https://doi.org/10.1007/3-540-48329-2_31
    139 rdf:type schema:CreativeWork
    140 sg:pub.10.1007/978-3-540-25937-4_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044984781
    141 https://doi.org/10.1007/978-3-540-25937-4_24
    142 rdf:type schema:CreativeWork
    143 sg:pub.10.1007/978-3-540-70583-3_52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011748223
    144 https://doi.org/10.1007/978-3-540-70583-3_52
    145 rdf:type schema:CreativeWork
    146 sg:pub.10.1007/978-3-540-74143-5_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040316010
    147 https://doi.org/10.1007/978-3-540-74143-5_11
    148 rdf:type schema:CreativeWork
    149 sg:pub.10.1007/978-3-540-74619-5_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009350046
    150 https://doi.org/10.1007/978-3-540-74619-5_3
    151 rdf:type schema:CreativeWork
    152 sg:pub.10.1007/978-3-540-78967-3_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048096154
    153 https://doi.org/10.1007/978-3-540-78967-3_11
    154 rdf:type schema:CreativeWork
    155 sg:pub.10.1007/978-3-540-78967-3_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042749994
    156 https://doi.org/10.1007/978-3-540-78967-3_13
    157 rdf:type schema:CreativeWork
    158 sg:pub.10.1007/978-3-540-85174-5_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018237593
    159 https://doi.org/10.1007/978-3-540-85174-5_22
    160 rdf:type schema:CreativeWork
    161 sg:pub.10.1007/978-3-540-85174-5_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012686200
    162 https://doi.org/10.1007/978-3-540-85174-5_24
    163 rdf:type schema:CreativeWork
    164 sg:pub.10.1007/978-3-642-03317-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021850873
    165 https://doi.org/10.1007/978-3-642-03317-9_5
    166 rdf:type schema:CreativeWork
    167 sg:pub.10.1007/978-3-642-03317-9_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008198067
    168 https://doi.org/10.1007/978-3-642-03317-9_7
    169 rdf:type schema:CreativeWork
    170 sg:pub.10.1007/978-3-642-13190-5_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002239591
    171 https://doi.org/10.1007/978-3-642-13190-5_30
    172 rdf:type schema:CreativeWork
    173 sg:pub.10.1007/978-3-642-18178-8_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047663745
    174 https://doi.org/10.1007/978-3-642-18178-8_5
    175 rdf:type schema:CreativeWork
    176 sg:pub.10.1007/978-3-642-20465-4_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029767535
    177 https://doi.org/10.1007/978-3-642-20465-4_19
    178 rdf:type schema:CreativeWork
    179 sg:pub.10.1007/978-3-642-28914-9_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012481504
    180 https://doi.org/10.1007/978-3-642-28914-9_17
    181 rdf:type schema:CreativeWork
    182 sg:pub.10.1007/978-3-642-32009-5_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011789286
    183 https://doi.org/10.1007/978-3-642-32009-5_20
    184 rdf:type schema:CreativeWork
    185 sg:pub.10.1007/978-3-642-32009-5_23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015220302
    186 https://doi.org/10.1007/978-3-642-32009-5_23
    187 rdf:type schema:CreativeWork
    188 sg:pub.10.1007/s00145-010-9071-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048373831
    189 https://doi.org/10.1007/s00145-010-9071-0
    190 rdf:type schema:CreativeWork
    191 sg:pub.10.1007/s001459900035 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045904646
    192 https://doi.org/10.1007/s001459900035
    193 rdf:type schema:CreativeWork
    194 sg:pub.10.1007/s10207-012-0157-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047161147
    195 https://doi.org/10.1007/s10207-012-0157-6
    196 rdf:type schema:CreativeWork
    197 sg:pub.10.1007/s10207-013-0220-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1023684010
    198 https://doi.org/10.1007/s10207-013-0220-y
    199 rdf:type schema:CreativeWork
    200 grid-institutes:grid.56912.39 schema:alternateName iMinds, Gent, Belgium
    201 schema:name ESAT/COSIC, Department of Electrical Engineering, KU Leuven, Leuven, Belgium
    202 iMinds, Gent, Belgium
    203 rdf:type schema:Organization
     




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


    ...