On solving LPN using BKW and variants View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2015-07-31

AUTHORS

Sonia Bogos, Florian Tramèr, Serge Vaudenay

ABSTRACT

The Learning Parity with Noise problem (LPN) is appealing in cryptography as it is considered to remain hard in the post-quantum world. It is also a good candidate for lightweight devices due to its simplicity. In this paper we provide a comprehensive analysis of the existing LPN solving algorithms, both for the general case and for the sparse secret scenario. In practice, the LPN-based cryptographic constructions use as a reference the security parameters proposed by Levieil and Fouque. But, for these parameters, there remains a gap between the theoretical analysis and the practical complexities of the algorithms we consider. The new theoretical analysis in this paper provides tighter bounds on the complexity of LPN solving algorithms and narrows this gap between theory and practice. We show that for a sparse secret there is another algorithm that outperforms BKW and its variants. Following from our results, we further propose practical parameters for different security levels. More... »

PAGES

331-369

References to SciGraph publications

  • 2009. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems in ADVANCES IN CRYPTOLOGY - CRYPTO 2009
  • 2011. New Algorithms for Learning in Presence of Errors in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2013. Never Trust a Bunny in RADIO FREQUENCY IDENTIFICATION. SECURITY AND PRIVACY ISSUES
  • 2014. Lazy Modulus Switching for the BKW Algorithm on LWE in PUBLIC-KEY CRYPTOGRAPHY – PKC 2014
  • 2011. On Noise-Tolerant Learning of Sparse Parities and Related Problems in ALGORITHMIC LEARNING THEORY
  • 2014. Solving LPN Using Covering Codes in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2014
  • 2008-01-01. : Increasing the Security and Efficiency of in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 1994. Cryptographic Primitives Based on Hard Learning Problems in ADVANCES IN CRYPTOLOGY — CRYPTO’ 93
  • 2013. HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems in PROGRESS IN CRYPTOLOGY – AFRICACRYPT 2013
  • 2010-02-17. Parallel and Concurrent Security of the HB and HB+ Protocols in JOURNAL OF CRYPTOLOGY
  • 2014. Simple Chosen-Ciphertext Security from Low-Noise LPN in PUBLIC-KEY CRYPTOGRAPHY – PKC 2014
  • 2001-11-20. Secure Human Identification Protocols in ADVANCES IN CRYPTOLOGY — ASIACRYPT 2001
  • 1989. A method for finding codewords of small weight in CODING THEORY AND APPLICATIONS
  • 2011. Decoding Random Linear Codes in in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2011
  • 2013. Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs in ADVANCES IN CRYPTOLOGY – CRYPTO 2013
  • 2015-04-14. Better Algorithms for LWE and LWR in ADVANCES IN CRYPTOLOGY -- EUROCRYPT 2015
  • 2005. The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2005. Authenticating Pervasive Devices with Human Protocols in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 2012. IND-CCA Secure Cryptography Based on a Variant of the LPN Problem in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2012
  • 2006. An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication in PROGRESS IN CRYPTOLOGY - INDOCRYPT 2006
  • 2011. Efficient Authentication from Hard Learning Problems in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2011
  • 2013-07-19. On the complexity of the BKW algorithm on LWE in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2006. An Improved LPN Algorithm in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2012. Lapin: An Efficient Authentication Protocol Based on Ring-LPN in FAST SOFTWARE ENCRYPTION
  • 2011. Smaller Decoding Exponents: Ball-Collision Decoding in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s12095-015-0149-2

    DOI

    http://dx.doi.org/10.1007/s12095-015-0149-2

    DIMENSIONS

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


    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/01", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Mathematical Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Pure Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0102", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Applied Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Numerical and Computational Mathematics", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "EPFL, CH-1015, Lausanne, Switzerland", 
              "id": "http://www.grid.ac/institutes/grid.5333.6", 
              "name": [
                "EPFL, CH-1015, Lausanne, Switzerland"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Bogos", 
            "givenName": "Sonia", 
            "id": "sg:person.011576475127.40", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011576475127.40"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "EPFL, CH-1015, Lausanne, Switzerland", 
              "id": "http://www.grid.ac/institutes/grid.5333.6", 
              "name": [
                "EPFL, CH-1015, Lausanne, Switzerland"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Tram\u00e8r", 
            "givenName": "Florian", 
            "id": "sg:person.011125325553.13", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011125325553.13"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "EPFL, CH-1015, Lausanne, Switzerland", 
              "id": "http://www.grid.ac/institutes/grid.5333.6", 
              "name": [
                "EPFL, CH-1015, Lausanne, Switzerland"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Vaudenay", 
            "givenName": "Serge", 
            "id": "sg:person.01353240467.39", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01353240467.39"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-642-24412-4_32", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006037661", 
              "https://doi.org/10.1007/978-3-642-24412-4_32"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-25385-0_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008943366", 
              "https://doi.org/10.1007/978-3-642-25385-0_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-54631-0_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046405046", 
              "https://doi.org/10.1007/978-3-642-54631-0_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45682-1_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027730722", 
              "https://doi.org/10.1007/3-540-45682-1_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00145-010-9061-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012126245", 
              "https://doi.org/10.1007/s00145-010-9061-2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-22792-9_42", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042462397", 
              "https://doi.org/10.1007/978-3-642-22792-9_42"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-36140-1_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032773845", 
              "https://doi.org/10.1007/978-3-642-36140-1_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-46800-5_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016645010", 
              "https://doi.org/10.1007/978-3-662-46800-5_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11941378_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033812388", 
              "https://doi.org/10.1007/11941378_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-20465-4_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043195135", 
              "https://doi.org/10.1007/978-3-642-20465-4_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-38553-7_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042338881", 
              "https://doi.org/10.1007/978-3-642-38553-7_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11832072_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009973045", 
              "https://doi.org/10.1007/11832072_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-22006-7_34", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012978110", 
              "https://doi.org/10.1007/978-3-642-22006-7_34"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03356-8_35", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053603939", 
              "https://doi.org/10.1007/978-3-642-03356-8_35"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-34961-4_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042915066", 
              "https://doi.org/10.1007/978-3-642-34961-4_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11535218_18", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048110650", 
              "https://doi.org/10.1007/11535218_18"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-45611-8_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038534677", 
              "https://doi.org/10.1007/978-3-662-45611-8_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-40084-1_18", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010980912", 
              "https://doi.org/10.1007/978-3-642-40084-1_18"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-54631-0_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037345013", 
              "https://doi.org/10.1007/978-3-642-54631-0_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0019850", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029429475", 
              "https://doi.org/10.1007/bfb0019850"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-34047-5_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024908214", 
              "https://doi.org/10.1007/978-3-642-34047-5_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78967-3_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028765794", 
              "https://doi.org/10.1007/978-3-540-78967-3_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48329-2_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045214757", 
              "https://doi.org/10.1007/3-540-48329-2_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11538462_32", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022279726", 
              "https://doi.org/10.1007/11538462_32"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10623-013-9864-x", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023628569", 
              "https://doi.org/10.1007/s10623-013-9864-x"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2015-07-31", 
        "datePublishedReg": "2015-07-31", 
        "description": "The Learning Parity with Noise problem (LPN) is appealing in cryptography as it is considered to remain hard in the post-quantum world. It is also a good candidate for lightweight devices due to its simplicity. In this paper we provide a comprehensive analysis of the existing LPN solving algorithms, both for the general case and for the sparse secret scenario. In practice, the LPN-based cryptographic constructions use as a reference the security parameters proposed by Levieil and Fouque. But, for these parameters, there remains a gap between the theoretical analysis and the practical complexities of the algorithms we consider. The new theoretical analysis in this paper provides tighter bounds on the complexity of LPN solving algorithms and narrows this gap between theory and practice. We show that for a sparse secret there is another algorithm that outperforms BKW and its variants. Following from our results, we further propose practical parameters for different security levels.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s12095-015-0149-2", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136695", 
            "issn": [
              "1936-2447", 
              "1936-2455"
            ], 
            "name": "Cryptography and Communications", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "8"
          }
        ], 
        "keywords": [
          "different security levels", 
          "post-quantum world", 
          "cryptographic constructions", 
          "security level", 
          "Learning Parity", 
          "security parameters", 
          "theoretical analysis", 
          "lightweight devices", 
          "new theoretical analysis", 
          "algorithm", 
          "practical complexity", 
          "tight bounds", 
          "general case", 
          "complexity", 
          "cryptography", 
          "practical parameters", 
          "BKW", 
          "noise problem", 
          "Fouque", 
          "parameters", 
          "bounds", 
          "secrets", 
          "scenarios", 
          "LPN", 
          "theory", 
          "devices", 
          "problem", 
          "comprehensive analysis", 
          "simplicity", 
          "good candidate", 
          "gap", 
          "world", 
          "variants", 
          "construction", 
          "analysis", 
          "practice", 
          "cases", 
          "results", 
          "reference", 
          "candidates", 
          "parity", 
          "levels", 
          "paper"
        ], 
        "name": "On solving LPN using BKW and variants", 
        "pagination": "331-369", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1008687870"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s12095-015-0149-2"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s12095-015-0149-2", 
          "https://app.dimensions.ai/details/publication/pub.1008687870"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-05-20T07:30", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_654.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s12095-015-0149-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/s12095-015-0149-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/s12095-015-0149-2'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s12095-015-0149-2'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s12095-015-0149-2'


     

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

    223 TRIPLES      22 PREDICATES      95 URIs      60 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s12095-015-0149-2 schema:about anzsrc-for:01
    2 anzsrc-for:0101
    3 anzsrc-for:0102
    4 anzsrc-for:0103
    5 schema:author N33c1c5d1b012451987d54c4780a3dc40
    6 schema:citation sg:pub.10.1007/11535218_18
    7 sg:pub.10.1007/11538462_32
    8 sg:pub.10.1007/11832072_24
    9 sg:pub.10.1007/11941378_5
    10 sg:pub.10.1007/3-540-45682-1_4
    11 sg:pub.10.1007/3-540-48329-2_24
    12 sg:pub.10.1007/978-3-540-78967-3_21
    13 sg:pub.10.1007/978-3-642-03356-8_35
    14 sg:pub.10.1007/978-3-642-20465-4_3
    15 sg:pub.10.1007/978-3-642-22006-7_34
    16 sg:pub.10.1007/978-3-642-22792-9_42
    17 sg:pub.10.1007/978-3-642-24412-4_32
    18 sg:pub.10.1007/978-3-642-25385-0_6
    19 sg:pub.10.1007/978-3-642-34047-5_20
    20 sg:pub.10.1007/978-3-642-34961-4_30
    21 sg:pub.10.1007/978-3-642-36140-1_10
    22 sg:pub.10.1007/978-3-642-38553-7_6
    23 sg:pub.10.1007/978-3-642-40084-1_18
    24 sg:pub.10.1007/978-3-642-54631-0_1
    25 sg:pub.10.1007/978-3-642-54631-0_25
    26 sg:pub.10.1007/978-3-662-45611-8_1
    27 sg:pub.10.1007/978-3-662-46800-5_8
    28 sg:pub.10.1007/bfb0019850
    29 sg:pub.10.1007/s00145-010-9061-2
    30 sg:pub.10.1007/s10623-013-9864-x
    31 schema:datePublished 2015-07-31
    32 schema:datePublishedReg 2015-07-31
    33 schema:description The Learning Parity with Noise problem (LPN) is appealing in cryptography as it is considered to remain hard in the post-quantum world. It is also a good candidate for lightweight devices due to its simplicity. In this paper we provide a comprehensive analysis of the existing LPN solving algorithms, both for the general case and for the sparse secret scenario. In practice, the LPN-based cryptographic constructions use as a reference the security parameters proposed by Levieil and Fouque. But, for these parameters, there remains a gap between the theoretical analysis and the practical complexities of the algorithms we consider. The new theoretical analysis in this paper provides tighter bounds on the complexity of LPN solving algorithms and narrows this gap between theory and practice. We show that for a sparse secret there is another algorithm that outperforms BKW and its variants. Following from our results, we further propose practical parameters for different security levels.
    34 schema:genre article
    35 schema:inLanguage en
    36 schema:isAccessibleForFree true
    37 schema:isPartOf N473d27f86b234623bb21a8ca0109b50f
    38 N82c8c9cce1ea4d7ba6ef0edf99367bd7
    39 sg:journal.1136695
    40 schema:keywords BKW
    41 Fouque
    42 LPN
    43 Learning Parity
    44 algorithm
    45 analysis
    46 bounds
    47 candidates
    48 cases
    49 complexity
    50 comprehensive analysis
    51 construction
    52 cryptographic constructions
    53 cryptography
    54 devices
    55 different security levels
    56 gap
    57 general case
    58 good candidate
    59 levels
    60 lightweight devices
    61 new theoretical analysis
    62 noise problem
    63 paper
    64 parameters
    65 parity
    66 post-quantum world
    67 practical complexity
    68 practical parameters
    69 practice
    70 problem
    71 reference
    72 results
    73 scenarios
    74 secrets
    75 security level
    76 security parameters
    77 simplicity
    78 theoretical analysis
    79 theory
    80 tight bounds
    81 variants
    82 world
    83 schema:name On solving LPN using BKW and variants
    84 schema:pagination 331-369
    85 schema:productId N53e9a62f10594273871b52b1a6975142
    86 N80ffdcfd579049c8b33efeb11a94c837
    87 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008687870
    88 https://doi.org/10.1007/s12095-015-0149-2
    89 schema:sdDatePublished 2022-05-20T07:30
    90 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    91 schema:sdPublisher N419ef495c82b41d1b8a623232d460d76
    92 schema:url https://doi.org/10.1007/s12095-015-0149-2
    93 sgo:license sg:explorer/license/
    94 sgo:sdDataset articles
    95 rdf:type schema:ScholarlyArticle
    96 N33c1c5d1b012451987d54c4780a3dc40 rdf:first sg:person.011576475127.40
    97 rdf:rest Nf213f7b4ed2343e19fbcdb914dc5c144
    98 N419ef495c82b41d1b8a623232d460d76 schema:name Springer Nature - SN SciGraph project
    99 rdf:type schema:Organization
    100 N473d27f86b234623bb21a8ca0109b50f schema:issueNumber 3
    101 rdf:type schema:PublicationIssue
    102 N53e9a62f10594273871b52b1a6975142 schema:name doi
    103 schema:value 10.1007/s12095-015-0149-2
    104 rdf:type schema:PropertyValue
    105 N80ffdcfd579049c8b33efeb11a94c837 schema:name dimensions_id
    106 schema:value pub.1008687870
    107 rdf:type schema:PropertyValue
    108 N82c8c9cce1ea4d7ba6ef0edf99367bd7 schema:volumeNumber 8
    109 rdf:type schema:PublicationVolume
    110 Ne1a2c39b61524dccb82d1e96586a53eb rdf:first sg:person.01353240467.39
    111 rdf:rest rdf:nil
    112 Nf213f7b4ed2343e19fbcdb914dc5c144 rdf:first sg:person.011125325553.13
    113 rdf:rest Ne1a2c39b61524dccb82d1e96586a53eb
    114 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
    115 schema:name Mathematical Sciences
    116 rdf:type schema:DefinedTerm
    117 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
    118 schema:name Pure Mathematics
    119 rdf:type schema:DefinedTerm
    120 anzsrc-for:0102 schema:inDefinedTermSet anzsrc-for:
    121 schema:name Applied Mathematics
    122 rdf:type schema:DefinedTerm
    123 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
    124 schema:name Numerical and Computational Mathematics
    125 rdf:type schema:DefinedTerm
    126 sg:journal.1136695 schema:issn 1936-2447
    127 1936-2455
    128 schema:name Cryptography and Communications
    129 schema:publisher Springer Nature
    130 rdf:type schema:Periodical
    131 sg:person.011125325553.13 schema:affiliation grid-institutes:grid.5333.6
    132 schema:familyName Tramèr
    133 schema:givenName Florian
    134 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011125325553.13
    135 rdf:type schema:Person
    136 sg:person.011576475127.40 schema:affiliation grid-institutes:grid.5333.6
    137 schema:familyName Bogos
    138 schema:givenName Sonia
    139 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011576475127.40
    140 rdf:type schema:Person
    141 sg:person.01353240467.39 schema:affiliation grid-institutes:grid.5333.6
    142 schema:familyName Vaudenay
    143 schema:givenName Serge
    144 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01353240467.39
    145 rdf:type schema:Person
    146 sg:pub.10.1007/11535218_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048110650
    147 https://doi.org/10.1007/11535218_18
    148 rdf:type schema:CreativeWork
    149 sg:pub.10.1007/11538462_32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022279726
    150 https://doi.org/10.1007/11538462_32
    151 rdf:type schema:CreativeWork
    152 sg:pub.10.1007/11832072_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009973045
    153 https://doi.org/10.1007/11832072_24
    154 rdf:type schema:CreativeWork
    155 sg:pub.10.1007/11941378_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033812388
    156 https://doi.org/10.1007/11941378_5
    157 rdf:type schema:CreativeWork
    158 sg:pub.10.1007/3-540-45682-1_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027730722
    159 https://doi.org/10.1007/3-540-45682-1_4
    160 rdf:type schema:CreativeWork
    161 sg:pub.10.1007/3-540-48329-2_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045214757
    162 https://doi.org/10.1007/3-540-48329-2_24
    163 rdf:type schema:CreativeWork
    164 sg:pub.10.1007/978-3-540-78967-3_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028765794
    165 https://doi.org/10.1007/978-3-540-78967-3_21
    166 rdf:type schema:CreativeWork
    167 sg:pub.10.1007/978-3-642-03356-8_35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053603939
    168 https://doi.org/10.1007/978-3-642-03356-8_35
    169 rdf:type schema:CreativeWork
    170 sg:pub.10.1007/978-3-642-20465-4_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043195135
    171 https://doi.org/10.1007/978-3-642-20465-4_3
    172 rdf:type schema:CreativeWork
    173 sg:pub.10.1007/978-3-642-22006-7_34 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012978110
    174 https://doi.org/10.1007/978-3-642-22006-7_34
    175 rdf:type schema:CreativeWork
    176 sg:pub.10.1007/978-3-642-22792-9_42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042462397
    177 https://doi.org/10.1007/978-3-642-22792-9_42
    178 rdf:type schema:CreativeWork
    179 sg:pub.10.1007/978-3-642-24412-4_32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006037661
    180 https://doi.org/10.1007/978-3-642-24412-4_32
    181 rdf:type schema:CreativeWork
    182 sg:pub.10.1007/978-3-642-25385-0_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008943366
    183 https://doi.org/10.1007/978-3-642-25385-0_6
    184 rdf:type schema:CreativeWork
    185 sg:pub.10.1007/978-3-642-34047-5_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024908214
    186 https://doi.org/10.1007/978-3-642-34047-5_20
    187 rdf:type schema:CreativeWork
    188 sg:pub.10.1007/978-3-642-34961-4_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042915066
    189 https://doi.org/10.1007/978-3-642-34961-4_30
    190 rdf:type schema:CreativeWork
    191 sg:pub.10.1007/978-3-642-36140-1_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032773845
    192 https://doi.org/10.1007/978-3-642-36140-1_10
    193 rdf:type schema:CreativeWork
    194 sg:pub.10.1007/978-3-642-38553-7_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042338881
    195 https://doi.org/10.1007/978-3-642-38553-7_6
    196 rdf:type schema:CreativeWork
    197 sg:pub.10.1007/978-3-642-40084-1_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010980912
    198 https://doi.org/10.1007/978-3-642-40084-1_18
    199 rdf:type schema:CreativeWork
    200 sg:pub.10.1007/978-3-642-54631-0_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046405046
    201 https://doi.org/10.1007/978-3-642-54631-0_1
    202 rdf:type schema:CreativeWork
    203 sg:pub.10.1007/978-3-642-54631-0_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037345013
    204 https://doi.org/10.1007/978-3-642-54631-0_25
    205 rdf:type schema:CreativeWork
    206 sg:pub.10.1007/978-3-662-45611-8_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038534677
    207 https://doi.org/10.1007/978-3-662-45611-8_1
    208 rdf:type schema:CreativeWork
    209 sg:pub.10.1007/978-3-662-46800-5_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016645010
    210 https://doi.org/10.1007/978-3-662-46800-5_8
    211 rdf:type schema:CreativeWork
    212 sg:pub.10.1007/bfb0019850 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029429475
    213 https://doi.org/10.1007/bfb0019850
    214 rdf:type schema:CreativeWork
    215 sg:pub.10.1007/s00145-010-9061-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012126245
    216 https://doi.org/10.1007/s00145-010-9061-2
    217 rdf:type schema:CreativeWork
    218 sg:pub.10.1007/s10623-013-9864-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1023628569
    219 https://doi.org/10.1007/s10623-013-9864-x
    220 rdf:type schema:CreativeWork
    221 grid-institutes:grid.5333.6 schema:alternateName EPFL, CH-1015, Lausanne, Switzerland
    222 schema:name EPFL, CH-1015, Lausanne, Switzerland
    223 rdf:type schema:Organization
     




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


    ...