Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2010

AUTHORS

N. P. Smart , F. Vercauteren

ABSTRACT

We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext consists of one large integer. As such, our scheme has smaller message expansion and key size than Gentry’s original scheme. In addition, our proposal allows efficient fully homomorphic encryption over any field of characteristic two. More... »

PAGES

420-443

References to SciGraph publications

  • 2001. The Two Faces of Lattices in Cryptology in CRYPTOGRAPHY AND LATTICES
  • 1998. NTRU: A ring-based public key cryptosystem in ALGORITHMIC NUMBER THEORY
  • 2006-05-17. Public-key cryptosystems from lattice reduction problems in ADVANCES IN CRYPTOLOGY — CRYPTO '97
  • Book

    TITLE

    Public Key Cryptography – PKC 2010

    ISBN

    978-3-642-13012-0
    978-3-642-13013-7

    Author Affiliations

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-642-13013-7_25

    DOI

    http://dx.doi.org/10.1007/978-3-642-13013-7_25

    DIMENSIONS

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


    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/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }, 
          {
            "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"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Bristol", 
              "id": "https://www.grid.ac/institutes/grid.5337.2", 
              "name": [
                "Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Smart", 
            "givenName": "N. P.", 
            "id": "sg:person.011707066001.47", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011707066001.47"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "KU Leuven", 
              "id": "https://www.grid.ac/institutes/grid.5596.f", 
              "name": [
                "COSIC - Electrical Engineering, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001\u00a0Heverlee, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Vercauteren", 
            "givenName": "F.", 
            "id": "sg:person.015377423247.18", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015377423247.18"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/1536414.1536440", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007792572"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0054868", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014225209", 
              "https://doi.org/10.1007/bfb0054868"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0052231", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027517922", 
              "https://doi.org/10.1007/bfb0052231"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0052231", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027517922", 
              "https://doi.org/10.1007/bfb0052231"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-44670-2_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028664185", 
              "https://doi.org/10.1007/3-540-44670-2_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1060590.1060660", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029372968"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.5802/jtnb.281", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1073141355"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2010", 
        "datePublishedReg": "2010-01-01", 
        "description": "We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a \u201csomewhat\u201d homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext consists of one large integer. As such, our scheme has smaller message expansion and key size than Gentry\u2019s original scheme. In addition, our proposal allows efficient fully homomorphic encryption over any field of characteristic two.", 
        "editor": [
          {
            "familyName": "Nguyen", 
            "givenName": "Phong Q.", 
            "type": "Person"
          }, 
          {
            "familyName": "Pointcheval", 
            "givenName": "David", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-642-13013-7_25", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-642-13012-0", 
            "978-3-642-13013-7"
          ], 
          "name": "Public Key Cryptography \u2013 PKC 2010", 
          "type": "Book"
        }, 
        "name": "Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes", 
        "pagination": "420-443", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-642-13013-7_25"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "bba1ec8311b6425b347d6ba6f21439db9138ac93d7e04bad39d03eb97cf94bf1"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1039389499"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-642-13013-7_25", 
          "https://app.dimensions.ai/details/publication/pub.1039389499"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T11:08", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8659_00000558.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/978-3-642-13013-7_25"
      }
    ]
     

    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-642-13013-7_25'

    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-642-13013-7_25'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-13013-7_25'

    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-642-13013-7_25'


     

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

    101 TRIPLES      23 PREDICATES      33 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-642-13013-7_25 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author Nd65fd58111fe40fab44a6cb0d4667922
    4 schema:citation sg:pub.10.1007/3-540-44670-2_12
    5 sg:pub.10.1007/bfb0052231
    6 sg:pub.10.1007/bfb0054868
    7 https://doi.org/10.1145/1060590.1060660
    8 https://doi.org/10.1145/1536414.1536440
    9 https://doi.org/10.5802/jtnb.281
    10 schema:datePublished 2010
    11 schema:datePublishedReg 2010-01-01
    12 schema:description We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext consists of one large integer. As such, our scheme has smaller message expansion and key size than Gentry’s original scheme. In addition, our proposal allows efficient fully homomorphic encryption over any field of characteristic two.
    13 schema:editor Nc3322286c0c140999936beacccff9434
    14 schema:genre chapter
    15 schema:inLanguage en
    16 schema:isAccessibleForFree true
    17 schema:isPartOf N2016b83dceca4ffeb95982a2dfc526d6
    18 schema:name Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
    19 schema:pagination 420-443
    20 schema:productId N6e0839d5f5b34321ba94f28af7039df6
    21 Nccf1a896d3d24dcaa772f84d12e308ca
    22 Nf6decf85b9f540508ed537d7dc174258
    23 schema:publisher Nb393dda3cc624a439c68c04fa00dc913
    24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039389499
    25 https://doi.org/10.1007/978-3-642-13013-7_25
    26 schema:sdDatePublished 2019-04-15T11:08
    27 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    28 schema:sdPublisher N6478557ba1a949feb981015696dae1a4
    29 schema:url http://link.springer.com/10.1007/978-3-642-13013-7_25
    30 sgo:license sg:explorer/license/
    31 sgo:sdDataset chapters
    32 rdf:type schema:Chapter
    33 N1416fc7ad0694ed58e754267e7d9dd6b rdf:first N5924ff0a328245b1b07c6e64150e5573
    34 rdf:rest rdf:nil
    35 N2016b83dceca4ffeb95982a2dfc526d6 schema:isbn 978-3-642-13012-0
    36 978-3-642-13013-7
    37 schema:name Public Key Cryptography – PKC 2010
    38 rdf:type schema:Book
    39 N49a5d0879f5c4f0aa9f557f65ac613c3 schema:familyName Nguyen
    40 schema:givenName Phong Q.
    41 rdf:type schema:Person
    42 N5924ff0a328245b1b07c6e64150e5573 schema:familyName Pointcheval
    43 schema:givenName David
    44 rdf:type schema:Person
    45 N6478557ba1a949feb981015696dae1a4 schema:name Springer Nature - SN SciGraph project
    46 rdf:type schema:Organization
    47 N6e0839d5f5b34321ba94f28af7039df6 schema:name dimensions_id
    48 schema:value pub.1039389499
    49 rdf:type schema:PropertyValue
    50 N976b0849404d49fabb181d79a6ad7458 rdf:first sg:person.015377423247.18
    51 rdf:rest rdf:nil
    52 Nb393dda3cc624a439c68c04fa00dc913 schema:location Berlin, Heidelberg
    53 schema:name Springer Berlin Heidelberg
    54 rdf:type schema:Organisation
    55 Nc3322286c0c140999936beacccff9434 rdf:first N49a5d0879f5c4f0aa9f557f65ac613c3
    56 rdf:rest N1416fc7ad0694ed58e754267e7d9dd6b
    57 Nccf1a896d3d24dcaa772f84d12e308ca schema:name readcube_id
    58 schema:value bba1ec8311b6425b347d6ba6f21439db9138ac93d7e04bad39d03eb97cf94bf1
    59 rdf:type schema:PropertyValue
    60 Nd65fd58111fe40fab44a6cb0d4667922 rdf:first sg:person.011707066001.47
    61 rdf:rest N976b0849404d49fabb181d79a6ad7458
    62 Nf6decf85b9f540508ed537d7dc174258 schema:name doi
    63 schema:value 10.1007/978-3-642-13013-7_25
    64 rdf:type schema:PropertyValue
    65 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    66 schema:name Information and Computing Sciences
    67 rdf:type schema:DefinedTerm
    68 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    69 schema:name Data Format
    70 rdf:type schema:DefinedTerm
    71 sg:person.011707066001.47 schema:affiliation https://www.grid.ac/institutes/grid.5337.2
    72 schema:familyName Smart
    73 schema:givenName N. P.
    74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011707066001.47
    75 rdf:type schema:Person
    76 sg:person.015377423247.18 schema:affiliation https://www.grid.ac/institutes/grid.5596.f
    77 schema:familyName Vercauteren
    78 schema:givenName F.
    79 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015377423247.18
    80 rdf:type schema:Person
    81 sg:pub.10.1007/3-540-44670-2_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028664185
    82 https://doi.org/10.1007/3-540-44670-2_12
    83 rdf:type schema:CreativeWork
    84 sg:pub.10.1007/bfb0052231 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027517922
    85 https://doi.org/10.1007/bfb0052231
    86 rdf:type schema:CreativeWork
    87 sg:pub.10.1007/bfb0054868 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014225209
    88 https://doi.org/10.1007/bfb0054868
    89 rdf:type schema:CreativeWork
    90 https://doi.org/10.1145/1060590.1060660 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029372968
    91 rdf:type schema:CreativeWork
    92 https://doi.org/10.1145/1536414.1536440 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007792572
    93 rdf:type schema:CreativeWork
    94 https://doi.org/10.5802/jtnb.281 schema:sameAs https://app.dimensions.ai/details/publication/pub.1073141355
    95 rdf:type schema:CreativeWork
    96 https://www.grid.ac/institutes/grid.5337.2 schema:alternateName University of Bristol
    97 schema:name Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom
    98 rdf:type schema:Organization
    99 https://www.grid.ac/institutes/grid.5596.f schema:alternateName KU Leuven
    100 schema:name COSIC - Electrical Engineering, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001 Heverlee, Belgium
    101 rdf:type schema:Organization
     




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


    ...