Locally Decodable and Updatable Non-malleable Codes and Their Applications View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2015

AUTHORS

Dana Dachman-Soled , Feng-Hao Liu , Elaine Shi , Hong-Sheng Zhou

ABSTRACT

Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski, Pietrzak and Wichs (ICS ’10), provide the security guarantee that the message contained in a tampered codeword is either the same as the original message or is set to an unrelated value. Various applications of non-malleable codes have been discovered, and one of the most significant applications among these is the connection with tamper-resilient cryptography. There is a large body of work considering security against various classes of tampering functions, as well as non-malleable codes with enhanced features such as leakage resilience.In this work, we propose combining the concepts of non-malleability, leakage resilience, and locality in a coding scheme. The contribution of this work is three-fold:As a conceptual contribution, we define a new notion of locally decodable and updatable non-malleable code that combines the above properties.We present two simple and efficient constructions achieving our new notion with different levels of security.We present an important application of our new tool – securing RAM computation against memory tampering and leakage attacks. This is analogous to the usage of traditional non-malleable codes to secure implementations in the circuit model against memory tampering and leakage attacks. More... »

PAGES

427-450

Book

TITLE

Theory of Cryptography

ISBN

978-3-662-46493-9
978-3-662-46494-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-46494-6_18

DOI

http://dx.doi.org/10.1007/978-3-662-46494-6_18

DIMENSIONS

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


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": "University of Maryland, USA", 
          "id": "http://www.grid.ac/institutes/grid.410443.6", 
          "name": [
            "University of Maryland, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dachman-Soled", 
        "givenName": "Dana", 
        "id": "sg:person.011244513001.85", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011244513001.85"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Maryland, USA", 
          "id": "http://www.grid.ac/institutes/grid.410443.6", 
          "name": [
            "University of Maryland, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Liu", 
        "givenName": "Feng-Hao", 
        "id": "sg:person.012403661357.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012403661357.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Maryland, USA", 
          "id": "http://www.grid.ac/institutes/grid.410443.6", 
          "name": [
            "University of Maryland, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shi", 
        "givenName": "Elaine", 
        "id": "sg:person.014706274717.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Virginia Commonwealth University, USA", 
          "id": "http://www.grid.ac/institutes/grid.224260.0", 
          "name": [
            "Virginia Commonwealth University, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zhou", 
        "givenName": "Hong-Sheng", 
        "id": "sg:person.012426605052.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012426605052.45"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015", 
    "datePublishedReg": "2015-01-01", 
    "description": "Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski, Pietrzak and Wichs (ICS \u201910), provide the security guarantee that the message contained in a tampered codeword is either the same as the original message or is set to an unrelated value. Various applications of non-malleable codes have been discovered, and one of the most significant applications among these is the connection with tamper-resilient cryptography. There is a large body of work considering security against various classes of tampering functions, as well as non-malleable codes with enhanced features such as leakage resilience.In this work, we propose combining the concepts of non-malleability, leakage resilience, and locality in a coding scheme. The contribution of this work is three-fold:As a conceptual contribution, we define a new notion of locally decodable and updatable non-malleable code that combines the above properties.We present two simple and efficient constructions achieving our new notion with different levels of security.We present an important application of our new tool \u2013 securing RAM computation against memory tampering and leakage attacks. This is analogous to the usage of traditional non-malleable codes to secure implementations in the circuit model against memory tampering and leakage attacks.", 
    "editor": [
      {
        "familyName": "Dodis", 
        "givenName": "Yevgeniy", 
        "type": "Person"
      }, 
      {
        "familyName": "Nielsen", 
        "givenName": "Jesper Buus", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-46494-6_18", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-46493-9", 
        "978-3-662-46494-6"
      ], 
      "name": "Theory of Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "non-malleable codes", 
      "updatable non-malleable code", 
      "memory tampering", 
      "leakage attacks", 
      "leakage resilience", 
      "tamper-resilient cryptography", 
      "error-correcting codes", 
      "RAM computations", 
      "security guarantees", 
      "new notion", 
      "original message", 
      "unrelated value", 
      "enhanced features", 
      "tampering", 
      "efficient construction", 
      "security", 
      "code", 
      "important applications", 
      "significant applications", 
      "messages", 
      "attacks", 
      "cryptography", 
      "applications", 
      "Pietrzak", 
      "guarantees", 
      "Dziembowski", 
      "codewords", 
      "decodable", 
      "computation", 
      "implementation", 
      "conceptual contribution", 
      "scheme", 
      "work", 
      "three-fold", 
      "different levels", 
      "usage", 
      "notion", 
      "resilience", 
      "features", 
      "concept", 
      "large body", 
      "construction", 
      "model", 
      "class", 
      "connection", 
      "above properties", 
      "localities", 
      "wich", 
      "contribution", 
      "circuit model", 
      "function", 
      "values", 
      "properties", 
      "levels", 
      "relaxation", 
      "body", 
      "new tool \u2013 securing RAM computation", 
      "tool \u2013 securing RAM computation", 
      "traditional non-malleable codes"
    ], 
    "name": "Locally Decodable and Updatable Non-malleable Codes and Their Applications", 
    "pagination": "427-450", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1023467574"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-46494-6_18"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-46494-6_18", 
      "https://app.dimensions.ai/details/publication/pub.1023467574"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:13", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_217.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-46494-6_18"
  }
]
 

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-46494-6_18'

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-46494-6_18'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-46494-6_18'

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-46494-6_18'


 

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

148 TRIPLES      23 PREDICATES      85 URIs      78 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-46494-6_18 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N64f7f853319046b5b7a74cf9fcfa1521
4 schema:datePublished 2015
5 schema:datePublishedReg 2015-01-01
6 schema:description Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski, Pietrzak and Wichs (ICS ’10), provide the security guarantee that the message contained in a tampered codeword is either the same as the original message or is set to an unrelated value. Various applications of non-malleable codes have been discovered, and one of the most significant applications among these is the connection with tamper-resilient cryptography. There is a large body of work considering security against various classes of tampering functions, as well as non-malleable codes with enhanced features such as leakage resilience.In this work, we propose combining the concepts of non-malleability, leakage resilience, and locality in a coding scheme. The contribution of this work is three-fold:As a conceptual contribution, we define a new notion of locally decodable and updatable non-malleable code that combines the above properties.We present two simple and efficient constructions achieving our new notion with different levels of security.We present an important application of our new tool – securing RAM computation against memory tampering and leakage attacks. This is analogous to the usage of traditional non-malleable codes to secure implementations in the circuit model against memory tampering and leakage attacks.
7 schema:editor N5756e328b8114b70b6837402ce26365c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Nb73e119ade25490f9a546c773b11d791
12 schema:keywords Dziembowski
13 Pietrzak
14 RAM computations
15 above properties
16 applications
17 attacks
18 body
19 circuit model
20 class
21 code
22 codewords
23 computation
24 concept
25 conceptual contribution
26 connection
27 construction
28 contribution
29 cryptography
30 decodable
31 different levels
32 efficient construction
33 enhanced features
34 error-correcting codes
35 features
36 function
37 guarantees
38 implementation
39 important applications
40 large body
41 leakage attacks
42 leakage resilience
43 levels
44 localities
45 memory tampering
46 messages
47 model
48 new notion
49 new tool – securing RAM computation
50 non-malleable codes
51 notion
52 original message
53 properties
54 relaxation
55 resilience
56 scheme
57 security
58 security guarantees
59 significant applications
60 tamper-resilient cryptography
61 tampering
62 three-fold
63 tool – securing RAM computation
64 traditional non-malleable codes
65 unrelated value
66 updatable non-malleable code
67 usage
68 values
69 wich
70 work
71 schema:name Locally Decodable and Updatable Non-malleable Codes and Their Applications
72 schema:pagination 427-450
73 schema:productId N520dc2df4c414185a7eea5e94e26019f
74 Nda910247d6bb4f0bbf17f8534fb68d8b
75 schema:publisher N0453e781ca05420fb4790e5bdf80f91f
76 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023467574
77 https://doi.org/10.1007/978-3-662-46494-6_18
78 schema:sdDatePublished 2022-01-01T19:13
79 schema:sdLicense https://scigraph.springernature.com/explorer/license/
80 schema:sdPublisher N8e0a1e732349481b9d742efbb9f62b79
81 schema:url https://doi.org/10.1007/978-3-662-46494-6_18
82 sgo:license sg:explorer/license/
83 sgo:sdDataset chapters
84 rdf:type schema:Chapter
85 N0453e781ca05420fb4790e5bdf80f91f schema:name Springer Nature
86 rdf:type schema:Organisation
87 N1165f755610b4c02b3740345a96c9b7e rdf:first Nc7dde78dce2c4bb2bb3c04d9b86779b1
88 rdf:rest rdf:nil
89 N37ebd7aafcea49cf9bd98be06e828360 rdf:first sg:person.012403661357.00
90 rdf:rest Nbf047efdf915410b990a9ba2800f4095
91 N520dc2df4c414185a7eea5e94e26019f schema:name dimensions_id
92 schema:value pub.1023467574
93 rdf:type schema:PropertyValue
94 N5756e328b8114b70b6837402ce26365c rdf:first N87bf159dd9f947b5a232283729209cad
95 rdf:rest N1165f755610b4c02b3740345a96c9b7e
96 N64f7f853319046b5b7a74cf9fcfa1521 rdf:first sg:person.011244513001.85
97 rdf:rest N37ebd7aafcea49cf9bd98be06e828360
98 N87bf159dd9f947b5a232283729209cad schema:familyName Dodis
99 schema:givenName Yevgeniy
100 rdf:type schema:Person
101 N8e0a1e732349481b9d742efbb9f62b79 schema:name Springer Nature - SN SciGraph project
102 rdf:type schema:Organization
103 Nb73e119ade25490f9a546c773b11d791 schema:isbn 978-3-662-46493-9
104 978-3-662-46494-6
105 schema:name Theory of Cryptography
106 rdf:type schema:Book
107 Nbf047efdf915410b990a9ba2800f4095 rdf:first sg:person.014706274717.52
108 rdf:rest Ncde8a1d99417453c85c38bdbf33222d2
109 Nc7dde78dce2c4bb2bb3c04d9b86779b1 schema:familyName Nielsen
110 schema:givenName Jesper Buus
111 rdf:type schema:Person
112 Ncde8a1d99417453c85c38bdbf33222d2 rdf:first sg:person.012426605052.45
113 rdf:rest rdf:nil
114 Nda910247d6bb4f0bbf17f8534fb68d8b schema:name doi
115 schema:value 10.1007/978-3-662-46494-6_18
116 rdf:type schema:PropertyValue
117 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
118 schema:name Information and Computing Sciences
119 rdf:type schema:DefinedTerm
120 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
121 schema:name Data Format
122 rdf:type schema:DefinedTerm
123 sg:person.011244513001.85 schema:affiliation grid-institutes:grid.410443.6
124 schema:familyName Dachman-Soled
125 schema:givenName Dana
126 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011244513001.85
127 rdf:type schema:Person
128 sg:person.012403661357.00 schema:affiliation grid-institutes:grid.410443.6
129 schema:familyName Liu
130 schema:givenName Feng-Hao
131 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012403661357.00
132 rdf:type schema:Person
133 sg:person.012426605052.45 schema:affiliation grid-institutes:grid.224260.0
134 schema:familyName Zhou
135 schema:givenName Hong-Sheng
136 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012426605052.45
137 rdf:type schema:Person
138 sg:person.014706274717.52 schema:affiliation grid-institutes:grid.410443.6
139 schema:familyName Shi
140 schema:givenName Elaine
141 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52
142 rdf:type schema:Person
143 grid-institutes:grid.224260.0 schema:alternateName Virginia Commonwealth University, USA
144 schema:name Virginia Commonwealth University, USA
145 rdf:type schema:Organization
146 grid-institutes:grid.410443.6 schema:alternateName University of Maryland, USA
147 schema:name University of Maryland, USA
148 rdf:type schema:Organization
 




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


...