New Results on Gimli: Full-Permutation Distinguishers and Improved Collisions View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2020-12-06

AUTHORS

Antonio Flórez Gutiérrez , Gaëtan Leurent , María Naya-Plasencia , Léo Perrin , André Schrottenloher , Ferdinand Sibleyras

ABSTRACT

Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} is a family of cryptographic primitives (both a hash function and an AEAD scheme) that has been selected for the second round of the NIST competition for standardizing new lightweight designs. The candidate Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} is based on the permutation Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}, which was presented at CHES 2017. In this paper, we study the security of both the permutation and the constructions that are based on it. We exploit the slow diffusion in Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} and its internal symmetries to build, for the first time, a distinguisher on the full permutation of complexity 264\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{64}$$\end{document}. We also provide a practical distinguisher on 23 out of the full 24 rounds of Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} that has been implemented.Next, we give (full state) collision and semi-free-start collision attacks on Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}-Hash, reaching respectively up to 12 and 18 rounds. On the practical side, we compute a collision on 8-round Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}-Hash. In the quantum setting, these attacks reach 2 more rounds. Finally, we perform the first study of linear trails in the permutation, and we propose differential-linear cryptanalysis that reach up to 17 rounds of Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}. More... »

PAGES

33-63

Book

TITLE

Advances in Cryptology – ASIACRYPT 2020

ISBN

978-3-030-64836-7
978-3-030-64837-4

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-030-64837-4_2

DOI

http://dx.doi.org/10.1007/978-3-030-64837-4_2

DIMENSIONS

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


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": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fl\u00f3rez Guti\u00e9rrez", 
        "givenName": "Antonio", 
        "id": "sg:person.012566014731.55", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012566014731.55"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Leurent", 
        "givenName": "Ga\u00ebtan", 
        "id": "sg:person.016371722741.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016371722741.32"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Naya-Plasencia", 
        "givenName": "Mar\u00eda", 
        "id": "sg:person.013206304341.94", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Perrin", 
        "givenName": "L\u00e9o", 
        "id": "sg:person.011075613613.62", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011075613613.62"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Schrottenloher", 
        "givenName": "Andr\u00e9", 
        "id": "sg:person.07436415541.40", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07436415541.40"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Inria, Paris, France", 
          "id": "http://www.grid.ac/institutes/grid.5328.c", 
          "name": [
            "Inria, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sibleyras", 
        "givenName": "Ferdinand", 
        "id": "sg:person.012176511632.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012176511632.21"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2020-12-06", 
    "datePublishedReg": "2020-12-06", 
    "description": "Gimli\\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}$$\\mathsf {Gimli}$$\\end{document} is a family of cryptographic primitives (both a hash function and an AEAD scheme) that has been selected for the second round of the NIST competition for standardizing new lightweight designs. The candidate Gimli\\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}$$\\mathsf {Gimli}$$\\end{document} is based on the permutation Gimli\\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}$$\\mathsf {Gimli}$$\\end{document}, which was presented at CHES\u00a02017. In this paper, we study the security of both the permutation and the constructions that are based on it. We exploit the slow diffusion in Gimli\\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}$$\\mathsf {Gimli}$$\\end{document} and its internal symmetries to build, for the first time, a distinguisher on the full permutation of complexity 264\\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^{64}$$\\end{document}. We also provide a practical distinguisher on 23 out of the full 24 rounds of Gimli\\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}$$\\mathsf {Gimli}$$\\end{document} that has been implemented.Next, we give (full state) collision and semi-free-start collision attacks on Gimli\\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}$$\\mathsf {Gimli}$$\\end{document}-Hash, reaching respectively up\u00a0to 12 and 18 rounds. On the practical side, we compute a collision on 8-round Gimli\\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}$$\\mathsf {Gimli}$$\\end{document}-Hash. In the quantum setting, these attacks reach 2 more rounds. Finally, we perform the first study of linear trails in the permutation, and we propose differential-linear cryptanalysis that reach up\u00a0to 17 rounds of Gimli\\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}$$\\mathsf {Gimli}$$\\end{document}.", 
    "editor": [
      {
        "familyName": "Moriai", 
        "givenName": "Shiho", 
        "type": "Person"
      }, 
      {
        "familyName": "Wang", 
        "givenName": "Huaxiong", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-030-64837-4_2", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-030-64836-7", 
        "978-3-030-64837-4"
      ], 
      "name": "Advances in Cryptology \u2013 ASIACRYPT 2020", 
      "type": "Book"
    }, 
    "keywords": [
      "first study", 
      "second round", 
      "rounds", 
      "setting", 
      "first time", 
      "more rounds", 
      "study", 
      "family", 
      "candidates", 
      "time", 
      "attacks", 
      "side", 
      "trails", 
      "results", 
      "CHES", 
      "design", 
      "start collision attack", 
      "NIST competition", 
      "permutations", 
      "slow diffusion", 
      "internal symmetry", 
      "complexity", 
      "quantum setting", 
      "linear trails", 
      "differential-linear cryptanalysis", 
      "new results", 
      "cryptographic primitives", 
      "competition", 
      "lightweight design", 
      "diffusion", 
      "symmetry", 
      "distinguisher", 
      "full permutation", 
      "collisions", 
      "collision attack", 
      "practical side", 
      "primitives", 
      "new lightweight designs", 
      "paper", 
      "security", 
      "construction", 
      "hash", 
      "cryptanalysis", 
      "improved collision", 
      "Gimli", 
      "practical distinguisher"
    ], 
    "name": "New Results on Gimli: Full-Permutation Distinguishers and Improved Collisions", 
    "pagination": "33-63", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1133276733"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-64837-4_2"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-64837-4_2", 
      "https://app.dimensions.ai/details/publication/pub.1133276733"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:09", 
    "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/chapter/chapter_1.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-030-64837-4_2"
  }
]
 

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-030-64837-4_2'

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-030-64837-4_2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-64837-4_2'

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-030-64837-4_2'


 

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

145 TRIPLES      22 PREDICATES      70 URIs      63 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-030-64837-4_2 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N3248caa487634071b69ce2a279270dd3
4 schema:datePublished 2020-12-06
5 schema:datePublishedReg 2020-12-06
6 schema:description Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} is a family of cryptographic primitives (both a hash function and an AEAD scheme) that has been selected for the second round of the NIST competition for standardizing new lightweight designs. The candidate Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} is based on the permutation Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}, which was presented at CHES 2017. In this paper, we study the security of both the permutation and the constructions that are based on it. We exploit the slow diffusion in Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} and its internal symmetries to build, for the first time, a distinguisher on the full permutation of complexity 264\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{64}$$\end{document}. We also provide a practical distinguisher on 23 out of the full 24 rounds of Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document} that has been implemented.Next, we give (full state) collision and semi-free-start collision attacks on Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}-Hash, reaching respectively up to 12 and 18 rounds. On the practical side, we compute a collision on 8-round Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}-Hash. In the quantum setting, these attacks reach 2 more rounds. Finally, we perform the first study of linear trails in the permutation, and we propose differential-linear cryptanalysis that reach up to 17 rounds of Gimli\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {Gimli}$$\end{document}.
7 schema:editor N88e6894a8db64fadadfc768445df3108
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nfce7c7a2d6384ef9957932fb5581e8f9
11 schema:keywords CHES
12 Gimli
13 NIST competition
14 attacks
15 candidates
16 collision attack
17 collisions
18 competition
19 complexity
20 construction
21 cryptanalysis
22 cryptographic primitives
23 design
24 differential-linear cryptanalysis
25 diffusion
26 distinguisher
27 family
28 first study
29 first time
30 full permutation
31 hash
32 improved collision
33 internal symmetry
34 lightweight design
35 linear trails
36 more rounds
37 new lightweight designs
38 new results
39 paper
40 permutations
41 practical distinguisher
42 practical side
43 primitives
44 quantum setting
45 results
46 rounds
47 second round
48 security
49 setting
50 side
51 slow diffusion
52 start collision attack
53 study
54 symmetry
55 time
56 trails
57 schema:name New Results on Gimli: Full-Permutation Distinguishers and Improved Collisions
58 schema:pagination 33-63
59 schema:productId Nc15254bde99b4bc9ac7cdee98ddcc13d
60 Nf5b55dccbc9c49fdbcdc8efefc3da4f5
61 schema:publisher N3c1ace707af749abab5ffe091d4fc39e
62 schema:sameAs https://app.dimensions.ai/details/publication/pub.1133276733
63 https://doi.org/10.1007/978-3-030-64837-4_2
64 schema:sdDatePublished 2022-09-02T16:09
65 schema:sdLicense https://scigraph.springernature.com/explorer/license/
66 schema:sdPublisher N007c65a1431a46d58c7e8e775fa018fa
67 schema:url https://doi.org/10.1007/978-3-030-64837-4_2
68 sgo:license sg:explorer/license/
69 sgo:sdDataset chapters
70 rdf:type schema:Chapter
71 N007c65a1431a46d58c7e8e775fa018fa schema:name Springer Nature - SN SciGraph project
72 rdf:type schema:Organization
73 N3248caa487634071b69ce2a279270dd3 rdf:first sg:person.012566014731.55
74 rdf:rest N6c85a59b6b1a4be6a2530c281c8cc136
75 N3c1ace707af749abab5ffe091d4fc39e schema:name Springer Nature
76 rdf:type schema:Organisation
77 N6c85a59b6b1a4be6a2530c281c8cc136 rdf:first sg:person.016371722741.32
78 rdf:rest Ndda5d7483b0b47d8b34d6f0b74d5561b
79 N7a4ad1c85a6e43a283eea4aab68971ff schema:familyName Moriai
80 schema:givenName Shiho
81 rdf:type schema:Person
82 N7a6eadebb53c407593cd54f391a92255 schema:familyName Wang
83 schema:givenName Huaxiong
84 rdf:type schema:Person
85 N88e6894a8db64fadadfc768445df3108 rdf:first N7a4ad1c85a6e43a283eea4aab68971ff
86 rdf:rest Nf66514a42e2a4c2c916fc9f4e73290d8
87 Nae4ed24a18ca4af29e855fc64d159ee4 rdf:first sg:person.07436415541.40
88 rdf:rest Nba220fff7cbc4a959b98d78526029356
89 Nba220fff7cbc4a959b98d78526029356 rdf:first sg:person.012176511632.21
90 rdf:rest rdf:nil
91 Nc15254bde99b4bc9ac7cdee98ddcc13d schema:name dimensions_id
92 schema:value pub.1133276733
93 rdf:type schema:PropertyValue
94 Nc6d16fc68a604819a30b9c80133adc2e rdf:first sg:person.011075613613.62
95 rdf:rest Nae4ed24a18ca4af29e855fc64d159ee4
96 Ndda5d7483b0b47d8b34d6f0b74d5561b rdf:first sg:person.013206304341.94
97 rdf:rest Nc6d16fc68a604819a30b9c80133adc2e
98 Nf5b55dccbc9c49fdbcdc8efefc3da4f5 schema:name doi
99 schema:value 10.1007/978-3-030-64837-4_2
100 rdf:type schema:PropertyValue
101 Nf66514a42e2a4c2c916fc9f4e73290d8 rdf:first N7a6eadebb53c407593cd54f391a92255
102 rdf:rest rdf:nil
103 Nfce7c7a2d6384ef9957932fb5581e8f9 schema:isbn 978-3-030-64836-7
104 978-3-030-64837-4
105 schema:name Advances in Cryptology – ASIACRYPT 2020
106 rdf:type schema:Book
107 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
108 schema:name Information and Computing Sciences
109 rdf:type schema:DefinedTerm
110 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
111 schema:name Data Format
112 rdf:type schema:DefinedTerm
113 sg:person.011075613613.62 schema:affiliation grid-institutes:grid.5328.c
114 schema:familyName Perrin
115 schema:givenName Léo
116 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011075613613.62
117 rdf:type schema:Person
118 sg:person.012176511632.21 schema:affiliation grid-institutes:grid.5328.c
119 schema:familyName Sibleyras
120 schema:givenName Ferdinand
121 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012176511632.21
122 rdf:type schema:Person
123 sg:person.012566014731.55 schema:affiliation grid-institutes:grid.5328.c
124 schema:familyName Flórez Gutiérrez
125 schema:givenName Antonio
126 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012566014731.55
127 rdf:type schema:Person
128 sg:person.013206304341.94 schema:affiliation grid-institutes:grid.5328.c
129 schema:familyName Naya-Plasencia
130 schema:givenName María
131 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013206304341.94
132 rdf:type schema:Person
133 sg:person.016371722741.32 schema:affiliation grid-institutes:grid.5328.c
134 schema:familyName Leurent
135 schema:givenName Gaëtan
136 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016371722741.32
137 rdf:type schema:Person
138 sg:person.07436415541.40 schema:affiliation grid-institutes:grid.5328.c
139 schema:familyName Schrottenloher
140 schema:givenName André
141 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07436415541.40
142 rdf:type schema:Person
143 grid-institutes:grid.5328.c schema:alternateName Inria, Paris, France
144 schema:name Inria, Paris, France
145 rdf:type schema:Organization
 




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


...