Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2016-04-28

AUTHORS

Robert Granger , Philipp Jovanovic , Bart Mennink , Samuel Neves

ABSTRACT

A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so alongside the introduction of the tweakable Even-Mansour construction MEM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MEM}$$\end{document}. Its masking function combines the advantages of word-oriented LFSR- and powering-up-based methods. We show in particular how recent advancements in computing discrete logarithms over finite fields of characteristic 2 can be exploited in a constructive way to realize highly efficient, constant-time masking functions. If the masking satisfies a set of simple conditions, then MEM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MEM}$$\end{document} is a secure tweakable blockcipher up to the birthday bound. The strengths of MEM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MEM}$$\end{document} are exhibited by the design of fully parallelizable authenticated encryption schemes OPP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {OPP}$$\end{document} (nonce-respecting) and MRO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MRO}$$\end{document} (misuse-resistant). If instantiated with a reduced-round BLAKE2b permutation, OPP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {OPP}$$\end{document} and MRO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MRO}$$\end{document} achieve speeds up to 0.55 and 1.06 cycles per byte on the Intel Haswell microarchitecture, and are able to significantly outperform their closest competitors. More... »

PAGES

263-293

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-49890-3_11

DOI

http://dx.doi.org/10.1007/978-3-662-49890-3_11

DIMENSIONS

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


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": "Laboratory for Cryptologic Algorithms, \u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5333.6", 
          "name": [
            "Laboratory for Cryptologic Algorithms, \u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Granger", 
        "givenName": "Robert", 
        "id": "sg:person.010042407520.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010042407520.45"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Decentralized and Distributed Systems Lab, \u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5333.6", 
          "name": [
            "Decentralized and Distributed Systems Lab, \u00c9cole polytechnique f\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jovanovic", 
        "givenName": "Philipp", 
        "id": "sg:person.016300712435.04", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016300712435.04"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, ESAT/COSIC, KU Leuven, and iMinds, Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Department of Electrical Engineering, ESAT/COSIC, KU Leuven, and iMinds, 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": "CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal", 
          "id": "http://www.grid.ac/institutes/grid.8051.c", 
          "name": [
            "CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Neves", 
        "givenName": "Samuel", 
        "id": "sg:person.011136377232.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011136377232.42"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2016-04-28", 
    "datePublishedReg": "2016-04-28", 
    "description": "A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so alongside the introduction of the tweakable Even-Mansour construction MEM\\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 {MEM}$$\\end{document}. Its masking function combines the advantages of word-oriented LFSR- and powering-up-based methods. We show in particular how recent advancements in computing discrete logarithms over finite fields of characteristic 2 can be exploited in a constructive way to realize highly efficient, constant-time masking functions. If the masking satisfies a set of simple conditions, then MEM\\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 {MEM}$$\\end{document} is a secure tweakable blockcipher up\u00a0to the birthday bound. The strengths of MEM\\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 {MEM}$$\\end{document} are exhibited by the design of fully parallelizable authenticated encryption schemes OPP\\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 {OPP}$$\\end{document} (nonce-respecting) and MRO\\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 {MRO}$$\\end{document} (misuse-resistant). If instantiated with a reduced-round BLAKE2b permutation, OPP\\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 {OPP}$$\\end{document} and MRO\\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 {MRO}$$\\end{document} achieve speeds up\u00a0to 0.55 and 1.06 cycles per byte on the Intel Haswell microarchitecture, and are able to significantly outperform their closest competitors.", 
    "editor": [
      {
        "familyName": "Fischlin", 
        "givenName": "Marc", 
        "type": "Person"
      }, 
      {
        "familyName": "Coron", 
        "givenName": "Jean-S\u00e9bastien", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-49890-3_11", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-49889-7", 
        "978-3-662-49890-3"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2016", 
      "type": "Book"
    }, 
    "keywords": [
      "popular approach", 
      "certain primitives", 
      "Even-Mansour construction", 
      "discrete logarithm", 
      "tweakable blockcipher", 
      "encryption scheme", 
      "Intel Haswell microarchitecture", 
      "Authenticated Encryption", 
      "design", 
      "primitives", 
      "LFSR", 
      "recent advancements", 
      "finite field", 
      "constructive way", 
      "set", 
      "blockcipher", 
      "scheme", 
      "bytes", 
      "closest competitor", 
      "encryption", 
      "mask", 
      "work", 
      "principles", 
      "introduction", 
      "construction", 
      "function", 
      "advantages", 
      "method", 
      "advancement", 
      "field", 
      "way", 
      "satisfies", 
      "simple conditions", 
      "permutations", 
      "speed", 
      "microarchitecture", 
      "competitors", 
      "masking", 
      "applications", 
      "logarithm", 
      "conditions", 
      "birthday", 
      "strength", 
      "cycle", 
      "approach"
    ], 
    "name": "Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption", 
    "pagination": "263-293", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1041819638"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-49890-3_11"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-49890-3_11", 
      "https://app.dimensions.ai/details/publication/pub.1041819638"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-10-01T06:53", 
    "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/chapter/chapter_196.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-49890-3_11"
  }
]
 

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-662-49890-3_11'

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-662-49890-3_11'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-49890-3_11'

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-662-49890-3_11'


 

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

138 TRIPLES      22 PREDICATES      69 URIs      62 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-49890-3_11 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N1bb6465003f247ee9760aa0aae2317eb
4 schema:datePublished 2016-04-28
5 schema:datePublishedReg 2016-04-28
6 schema:description A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so alongside the introduction of the tweakable Even-Mansour construction MEM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MEM}$$\end{document}. Its masking function combines the advantages of word-oriented LFSR- and powering-up-based methods. We show in particular how recent advancements in computing discrete logarithms over finite fields of characteristic 2 can be exploited in a constructive way to realize highly efficient, constant-time masking functions. If the masking satisfies a set of simple conditions, then MEM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MEM}$$\end{document} is a secure tweakable blockcipher up to the birthday bound. The strengths of MEM\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MEM}$$\end{document} are exhibited by the design of fully parallelizable authenticated encryption schemes OPP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {OPP}$$\end{document} (nonce-respecting) and MRO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MRO}$$\end{document} (misuse-resistant). If instantiated with a reduced-round BLAKE2b permutation, OPP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {OPP}$$\end{document} and MRO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MRO}$$\end{document} achieve speeds up to 0.55 and 1.06 cycles per byte on the Intel Haswell microarchitecture, and are able to significantly outperform their closest competitors.
7 schema:editor N070ba9d730ab4421a57ea47107e2c26a
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nfebabc74842844b4baadb3b8b15af218
11 schema:keywords Authenticated Encryption
12 Even-Mansour construction
13 Intel Haswell microarchitecture
14 LFSR
15 advancement
16 advantages
17 applications
18 approach
19 birthday
20 blockcipher
21 bytes
22 certain primitives
23 closest competitor
24 competitors
25 conditions
26 construction
27 constructive way
28 cycle
29 design
30 discrete logarithm
31 encryption
32 encryption scheme
33 field
34 finite field
35 function
36 introduction
37 logarithm
38 mask
39 masking
40 method
41 microarchitecture
42 permutations
43 popular approach
44 primitives
45 principles
46 recent advancements
47 satisfies
48 scheme
49 set
50 simple conditions
51 speed
52 strength
53 tweakable blockcipher
54 way
55 work
56 schema:name Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
57 schema:pagination 263-293
58 schema:productId N10236059e62b43e4972e4fb1856dd911
59 N88726fe9606345e5b66f3d9626bf64d8
60 schema:publisher Ndf6f0dff6a434668b40b3695df330fe8
61 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041819638
62 https://doi.org/10.1007/978-3-662-49890-3_11
63 schema:sdDatePublished 2022-10-01T06:53
64 schema:sdLicense https://scigraph.springernature.com/explorer/license/
65 schema:sdPublisher Na8d6fc1a0b624da4bf604b0a2cfab975
66 schema:url https://doi.org/10.1007/978-3-662-49890-3_11
67 sgo:license sg:explorer/license/
68 sgo:sdDataset chapters
69 rdf:type schema:Chapter
70 N070ba9d730ab4421a57ea47107e2c26a rdf:first N8805909c6254437dbba2202382b546e9
71 rdf:rest N6822d91f6f2f4d488531a54a509224fa
72 N10236059e62b43e4972e4fb1856dd911 schema:name doi
73 schema:value 10.1007/978-3-662-49890-3_11
74 rdf:type schema:PropertyValue
75 N1bb6465003f247ee9760aa0aae2317eb rdf:first sg:person.010042407520.45
76 rdf:rest N2b560dc692fe43758e6a8fa96e4ded68
77 N2b560dc692fe43758e6a8fa96e4ded68 rdf:first sg:person.016300712435.04
78 rdf:rest Nc0bb7f1546e94931882a063eafd3146c
79 N6822d91f6f2f4d488531a54a509224fa rdf:first N86931c8911a2481480b6c0c0342f5efb
80 rdf:rest rdf:nil
81 N86931c8911a2481480b6c0c0342f5efb schema:familyName Coron
82 schema:givenName Jean-Sébastien
83 rdf:type schema:Person
84 N8805909c6254437dbba2202382b546e9 schema:familyName Fischlin
85 schema:givenName Marc
86 rdf:type schema:Person
87 N88726fe9606345e5b66f3d9626bf64d8 schema:name dimensions_id
88 schema:value pub.1041819638
89 rdf:type schema:PropertyValue
90 Na8d6fc1a0b624da4bf604b0a2cfab975 schema:name Springer Nature - SN SciGraph project
91 rdf:type schema:Organization
92 Nc0bb7f1546e94931882a063eafd3146c rdf:first sg:person.012130641461.76
93 rdf:rest Nd62b6dd40c0d4622befc5803b857904b
94 Nd62b6dd40c0d4622befc5803b857904b rdf:first sg:person.011136377232.42
95 rdf:rest rdf:nil
96 Ndf6f0dff6a434668b40b3695df330fe8 schema:name Springer Nature
97 rdf:type schema:Organisation
98 Nfebabc74842844b4baadb3b8b15af218 schema:isbn 978-3-662-49889-7
99 978-3-662-49890-3
100 schema:name Advances in Cryptology – EUROCRYPT 2016
101 rdf:type schema:Book
102 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
103 schema:name Information and Computing Sciences
104 rdf:type schema:DefinedTerm
105 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
106 schema:name Data Format
107 rdf:type schema:DefinedTerm
108 sg:person.010042407520.45 schema:affiliation grid-institutes:grid.5333.6
109 schema:familyName Granger
110 schema:givenName Robert
111 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010042407520.45
112 rdf:type schema:Person
113 sg:person.011136377232.42 schema:affiliation grid-institutes:grid.8051.c
114 schema:familyName Neves
115 schema:givenName Samuel
116 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011136377232.42
117 rdf:type schema:Person
118 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.5596.f
119 schema:familyName Mennink
120 schema:givenName Bart
121 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
122 rdf:type schema:Person
123 sg:person.016300712435.04 schema:affiliation grid-institutes:grid.5333.6
124 schema:familyName Jovanovic
125 schema:givenName Philipp
126 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016300712435.04
127 rdf:type schema:Person
128 grid-institutes:grid.5333.6 schema:alternateName Decentralized and Distributed Systems Lab, École polytechnique fédérale de Lausanne, Lausanne, Switzerland
129 Laboratory for Cryptologic Algorithms, École polytechnique fédérale de Lausanne, Lausanne, Switzerland
130 schema:name Decentralized and Distributed Systems Lab, École polytechnique fédérale de Lausanne, Lausanne, Switzerland
131 Laboratory for Cryptologic Algorithms, École polytechnique fédérale de Lausanne, Lausanne, Switzerland
132 rdf:type schema:Organization
133 grid-institutes:grid.5596.f schema:alternateName Department of Electrical Engineering, ESAT/COSIC, KU Leuven, and iMinds, Leuven, Belgium
134 schema:name Department of Electrical Engineering, ESAT/COSIC, KU Leuven, and iMinds, Leuven, Belgium
135 rdf:type schema:Organization
136 grid-institutes:grid.8051.c schema:alternateName CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal
137 schema:name CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal
138 rdf:type schema:Organization
 




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


...