The parazoa family: generalizing the sponge hash functions View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2012-02-05

AUTHORS

Elena Andreeva, Bart Mennink, Bart Preneel

ABSTRACT

Sponge functions were introduced by Bertoni et al. as an alternative to the classical Merkle-Damgård design. Many hash function submissions to the SHA-3 competition launched by NIST in 2007, such as CubeHash, Fugue, Hamsi, JH, Keccak and Luffa, derive from the original sponge design, and security guarantees from some of these constructions are typically based on indifferentiability results. Although indifferentiability proofs for these designs often bear significant similarities, these have so far been obtained independently for each construction. In this work, we introduce the parazoa family of hash functions as a generalization of “sponge-like” functions. Similarly to the sponge design, the parazoa family consists of compression and extraction phases. The parazoa hash functions, however, extend the sponge construction by enabling the use of a wider class of compression and extraction functions that need to satisfy certain properties. More importantly, we prove that the parazoa functions satisfy the indifferentiability notion of Maurer et al. under the assumption that the underlying permutation is ideal. Not surprisingly, our indifferentiability result confirms the bound on the original sponge function, but it also carries over to a wider spectrum of hash functions and eliminates the need for a separate indifferentiability analysis. More... »

PAGES

149-165

References to SciGraph publications

  • 2009. Blockcipher-Based Hashing Revisited in FAST SOFTWARE ENCRYPTION
  • 2011. Security Reductions of the Second Round SHA-3 Candidates in INFORMATION SECURITY
  • 2004. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology in THEORY OF CRYPTOGRAPHY
  • 1996. Keying Hash Functions for Message Authentication in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • 2005. Merkle-Damgård Revisited: How to Construct a Hash Function in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 2011. On the Indifferentiability of Fugue and Luffa in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2010. Security Analysis of the Mode of JH Hash Function in FAST SOFTWARE ENCRYPTION
  • 2004. Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes in ADVANCES IN CRYPTOLOGY – CRYPTO 2004
  • 2006. Multi-Property-Preserving Hash Domain Extension and the EMD Transform in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2006
  • 1993. Hash Functions Based on Block Ciphers in ADVANCES IN CRYPTOLOGY — EUROCRYPT’ 92
  • 1990. A Design Principle for Hash Functions in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 2008. On the Indifferentiability of the Sponge Construction in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2007-01-01. The Grindahl Hash Functions in FAST SOFTWARE ENCRYPTION
  • 2007-01-01. Seven-Property-Preserving Iterated Hashing: ROX in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2007
  • 1990. One Way Hash Functions and DES in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10207-012-0157-6

    DOI

    http://dx.doi.org/10.1007/s10207-012-0157-6

    DIMENSIONS

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


    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": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Andreeva", 
            "givenName": "Elena", 
            "id": "sg:person.010624232445.91", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, 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": "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium", 
              "id": "http://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, 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-24638-1_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050815296", 
              "https://doi.org/10.1007/978-3-540-24638-1_2"
            ], 
            "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/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/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-13858-4_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042043203", 
              "https://doi.org/10.1007/978-3-642-13858-4_10"
            ], 
            "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/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-21554-4_28", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014973475", 
              "https://doi.org/10.1007/978-3-642-21554-4_28"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11535218_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015438097", 
              "https://doi.org/10.1007/11535218_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-68697-5_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024453790", 
              "https://doi.org/10.1007/3-540-68697-5_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-76900-2_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049072174", 
              "https://doi.org/10.1007/978-3-540-76900-2_8"
            ], 
            "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/11935230_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039202735", 
              "https://doi.org/10.1007/11935230_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-28628-8_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036339578", 
              "https://doi.org/10.1007/978-3-540-28628-8_30"
            ], 
            "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"
          }
        ], 
        "datePublished": "2012-02-05", 
        "datePublishedReg": "2012-02-05", 
        "description": "Sponge functions were introduced by Bertoni et\u00a0al. as an alternative to the classical Merkle-Damg\u00e5rd design. Many hash function submissions to the SHA-3 competition launched by NIST in 2007, such as CubeHash, Fugue, Hamsi, JH, Keccak and Luffa, derive from the original sponge design, and security guarantees from some of these constructions are typically based on indifferentiability results. Although indifferentiability proofs for these designs often bear significant similarities, these have so far been obtained independently for each construction. In this work, we introduce the parazoa family of hash functions as a generalization of \u201csponge-like\u201d functions. Similarly to the sponge design, the parazoa family consists of compression and extraction phases. The parazoa hash functions, however, extend the sponge construction by enabling the use of a wider class of compression and extraction functions that need to satisfy certain properties. More importantly, we prove that the parazoa functions satisfy the indifferentiability notion of Maurer et\u00a0al. under the assumption that the underlying permutation is ideal. Not surprisingly, our indifferentiability result confirms the bound on the original sponge function, but it also carries over to a wider spectrum of hash functions and eliminates the need for a separate indifferentiability analysis.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s10207-012-0157-6", 
        "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": "11"
          }
        ], 
        "keywords": [
          "extraction phase", 
          "design", 
          "compression", 
          "construction", 
          "extraction function", 
          "al", 
          "properties", 
          "NIST", 
          "Luffa", 
          "results", 
          "phase", 
          "work", 
          "wide class", 
          "certain properties", 
          "function", 
          "alternative", 
          "use", 
          "assumption", 
          "spectra", 
          "analysis", 
          "et", 
          "guarantees", 
          "wide spectrum", 
          "proof", 
          "need", 
          "hash function", 
          "class", 
          "generalization", 
          "sponge construction", 
          "SHA-3 competition", 
          "competition", 
          "security guarantees", 
          "similarity", 
          "permutations", 
          "fugue", 
          "notion", 
          "submission", 
          "Merkle-Damg\u00e5rd design", 
          "JH", 
          "Keccak", 
          "significant similarity", 
          "family", 
          "sponge function", 
          "indifferentiability proofs", 
          "underlying permutation", 
          "CubeHash", 
          "Hamsi"
        ], 
        "name": "The parazoa family: generalizing the sponge hash functions", 
        "pagination": "149-165", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1047161147"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10207-012-0157-6"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10207-012-0157-6", 
          "https://app.dimensions.ai/details/publication/pub.1047161147"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-10-01T06:37", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221001/entities/gbq_results/article/article_569.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s10207-012-0157-6"
      }
    ]
     

    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-012-0157-6'

    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-012-0157-6'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10207-012-0157-6'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10207-012-0157-6'


     

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

    178 TRIPLES      21 PREDICATES      86 URIs      63 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10207-012-0157-6 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author Na379c42082504dbd805ddc315fddd1d8
    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/11535218_26
    7 sg:pub.10.1007/11935230_20
    8 sg:pub.10.1007/3-540-47555-9_5
    9 sg:pub.10.1007/3-540-68697-5_1
    10 sg:pub.10.1007/978-3-540-24638-1_2
    11 sg:pub.10.1007/978-3-540-28628-8_30
    12 sg:pub.10.1007/978-3-540-74619-5_3
    13 sg:pub.10.1007/978-3-540-76900-2_8
    14 sg:pub.10.1007/978-3-540-78967-3_11
    15 sg:pub.10.1007/978-3-642-03317-9_5
    16 sg:pub.10.1007/978-3-642-13858-4_10
    17 sg:pub.10.1007/978-3-642-18178-8_5
    18 sg:pub.10.1007/978-3-642-21554-4_28
    19 schema:datePublished 2012-02-05
    20 schema:datePublishedReg 2012-02-05
    21 schema:description Sponge functions were introduced by Bertoni et al. as an alternative to the classical Merkle-Damgård design. Many hash function submissions to the SHA-3 competition launched by NIST in 2007, such as CubeHash, Fugue, Hamsi, JH, Keccak and Luffa, derive from the original sponge design, and security guarantees from some of these constructions are typically based on indifferentiability results. Although indifferentiability proofs for these designs often bear significant similarities, these have so far been obtained independently for each construction. In this work, we introduce the parazoa family of hash functions as a generalization of “sponge-like” functions. Similarly to the sponge design, the parazoa family consists of compression and extraction phases. The parazoa hash functions, however, extend the sponge construction by enabling the use of a wider class of compression and extraction functions that need to satisfy certain properties. More importantly, we prove that the parazoa functions satisfy the indifferentiability notion of Maurer et al. under the assumption that the underlying permutation is ideal. Not surprisingly, our indifferentiability result confirms the bound on the original sponge function, but it also carries over to a wider spectrum of hash functions and eliminates the need for a separate indifferentiability analysis.
    22 schema:genre article
    23 schema:isAccessibleForFree true
    24 schema:isPartOf N6857fa4d7d484d32a8b9f791bd6d7d4c
    25 Ned39f191f26b41219829ba16be8cad08
    26 sg:journal.1136826
    27 schema:keywords CubeHash
    28 Hamsi
    29 JH
    30 Keccak
    31 Luffa
    32 Merkle-Damgård design
    33 NIST
    34 SHA-3 competition
    35 al
    36 alternative
    37 analysis
    38 assumption
    39 certain properties
    40 class
    41 competition
    42 compression
    43 construction
    44 design
    45 et
    46 extraction function
    47 extraction phase
    48 family
    49 fugue
    50 function
    51 generalization
    52 guarantees
    53 hash function
    54 indifferentiability proofs
    55 need
    56 notion
    57 permutations
    58 phase
    59 proof
    60 properties
    61 results
    62 security guarantees
    63 significant similarity
    64 similarity
    65 spectra
    66 sponge construction
    67 sponge function
    68 submission
    69 underlying permutation
    70 use
    71 wide class
    72 wide spectrum
    73 work
    74 schema:name The parazoa family: generalizing the sponge hash functions
    75 schema:pagination 149-165
    76 schema:productId N64b0d96da76c466c8d5a55e258cb3c0b
    77 Nd978a902f07047e6a2f5d67c6fe48cd4
    78 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047161147
    79 https://doi.org/10.1007/s10207-012-0157-6
    80 schema:sdDatePublished 2022-10-01T06:37
    81 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    82 schema:sdPublisher Nf658842675104d8cb73173865bd24c5d
    83 schema:url https://doi.org/10.1007/s10207-012-0157-6
    84 sgo:license sg:explorer/license/
    85 sgo:sdDataset articles
    86 rdf:type schema:ScholarlyArticle
    87 N64b0d96da76c466c8d5a55e258cb3c0b schema:name dimensions_id
    88 schema:value pub.1047161147
    89 rdf:type schema:PropertyValue
    90 N6857fa4d7d484d32a8b9f791bd6d7d4c schema:issueNumber 3
    91 rdf:type schema:PublicationIssue
    92 N7e4b45ab078f4ae98029e036b7c6194f rdf:first sg:person.012130641461.76
    93 rdf:rest Naa31c83802c94eec99757d59dfc9acb1
    94 Na379c42082504dbd805ddc315fddd1d8 rdf:first sg:person.010624232445.91
    95 rdf:rest N7e4b45ab078f4ae98029e036b7c6194f
    96 Naa31c83802c94eec99757d59dfc9acb1 rdf:first sg:person.011115044357.39
    97 rdf:rest rdf:nil
    98 Nd978a902f07047e6a2f5d67c6fe48cd4 schema:name doi
    99 schema:value 10.1007/s10207-012-0157-6
    100 rdf:type schema:PropertyValue
    101 Ned39f191f26b41219829ba16be8cad08 schema:volumeNumber 11
    102 rdf:type schema:PublicationVolume
    103 Nf658842675104d8cb73173865bd24c5d schema:name Springer Nature - SN SciGraph project
    104 rdf:type schema:Organization
    105 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    106 schema:name Information and Computing Sciences
    107 rdf:type schema:DefinedTerm
    108 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    109 schema:name Data Format
    110 rdf:type schema:DefinedTerm
    111 sg:journal.1136826 schema:issn 1615-5262
    112 1615-5270
    113 schema:name International Journal of Information Security
    114 schema:publisher Springer Nature
    115 rdf:type schema:Periodical
    116 sg:person.010624232445.91 schema:affiliation grid-institutes:grid.5596.f
    117 schema:familyName Andreeva
    118 schema:givenName Elena
    119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91
    120 rdf:type schema:Person
    121 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.5596.f
    122 schema:familyName Preneel
    123 schema:givenName Bart
    124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
    125 rdf:type schema:Person
    126 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.5596.f
    127 schema:familyName Mennink
    128 schema:givenName Bart
    129 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
    130 rdf:type schema:Person
    131 sg:pub.10.1007/0-387-34805-0_39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026402674
    132 https://doi.org/10.1007/0-387-34805-0_39
    133 rdf:type schema:CreativeWork
    134 sg:pub.10.1007/0-387-34805-0_40 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008729969
    135 https://doi.org/10.1007/0-387-34805-0_40
    136 rdf:type schema:CreativeWork
    137 sg:pub.10.1007/11535218_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015438097
    138 https://doi.org/10.1007/11535218_26
    139 rdf:type schema:CreativeWork
    140 sg:pub.10.1007/11935230_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039202735
    141 https://doi.org/10.1007/11935230_20
    142 rdf:type schema:CreativeWork
    143 sg:pub.10.1007/3-540-47555-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001052854
    144 https://doi.org/10.1007/3-540-47555-9_5
    145 rdf:type schema:CreativeWork
    146 sg:pub.10.1007/3-540-68697-5_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024453790
    147 https://doi.org/10.1007/3-540-68697-5_1
    148 rdf:type schema:CreativeWork
    149 sg:pub.10.1007/978-3-540-24638-1_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050815296
    150 https://doi.org/10.1007/978-3-540-24638-1_2
    151 rdf:type schema:CreativeWork
    152 sg:pub.10.1007/978-3-540-28628-8_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036339578
    153 https://doi.org/10.1007/978-3-540-28628-8_30
    154 rdf:type schema:CreativeWork
    155 sg:pub.10.1007/978-3-540-74619-5_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009350046
    156 https://doi.org/10.1007/978-3-540-74619-5_3
    157 rdf:type schema:CreativeWork
    158 sg:pub.10.1007/978-3-540-76900-2_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049072174
    159 https://doi.org/10.1007/978-3-540-76900-2_8
    160 rdf:type schema:CreativeWork
    161 sg:pub.10.1007/978-3-540-78967-3_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048096154
    162 https://doi.org/10.1007/978-3-540-78967-3_11
    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-13858-4_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042043203
    168 https://doi.org/10.1007/978-3-642-13858-4_10
    169 rdf:type schema:CreativeWork
    170 sg:pub.10.1007/978-3-642-18178-8_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047663745
    171 https://doi.org/10.1007/978-3-642-18178-8_5
    172 rdf:type schema:CreativeWork
    173 sg:pub.10.1007/978-3-642-21554-4_28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014973475
    174 https://doi.org/10.1007/978-3-642-21554-4_28
    175 rdf:type schema:CreativeWork
    176 grid-institutes:grid.5596.f schema:alternateName Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium
    177 schema:name Department of Electrical Engineering, ESAT/COSIC and IBBT, Katholieke Universiteit Leuven, Leuven, Belgium
    178 rdf:type schema:Organization
     




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


    ...