A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Non-Malleable Codes for Space-Bounded Tampering
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
that our flavor of non-malleability yields a natural security guarantee against memory tampering attacks, where one can trade a small amount of leakage on the secret key for protection against space-bounded ...
Non-malleable codes-introduced by Dziembowski, Pietrzak and Wichs at ICS 2010are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries ...
This finishes the proof. • We provide a simple construction of a leaky space-bounded non-malleable code. ...
doi:10.1007/978-3-319-63715-0_4
fatcat:r2bgcran5rauhjthyao7ixfj5e
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this work, we focus on so-called continuously non-malleable codes in the split-state model, as proposed by Faust et al. ...
At ICS 2010, Dziembowski, Pietrzak and Wichs introduced the notion of non-malleable codes, a weaker form of error-correcting codes guaranteeing that the decoding of a tampered codeword either corresponds ...
Conclusion and Open Problems We have shown a construction of a split-state continuously non-malleable code in the plain model. ...
doi:10.1007/978-3-319-96878-0_21
fatcat:jmh5v6huljaunbllred4ptruzm
Limits to Non-Malleability
2020
Innovations in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this work we ask the following question: When can we rule out the existence of a non-malleable code for a tampering class F? ...
Specifically, we show that no non-malleable codes exist for any of the following tampering classes: Functions that change d/2 symbols, where d is the distance of the code; Functions where each input symbol ...
Cheragachi and Guruswami [33] studied the "capacity" of non-malleable codes in order to understand the optimal bounds on the efficiency of non-malleable codes. ...
doi:10.4230/lipics.itcs.2020.80
dblp:conf/innovations/BallDKM20
fatcat:p4vvjwwei5c63gfsi3abu5vdzy
Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper extends the notion of non-malleable Key Derivation Functions (nm-KDFs), introduced by Faust et al. (EUROCRYPT'14), to continuous nm-KDFs. ...
We present a novel construction of continuous nm-KDF for any polynomials of bounded degree over a finite field. ...
The authors would also like to thank anonymous reviewers for very useful comments and suggestions on a preliminary version of this paper. ...
doi:10.1007/978-3-662-46447-2_25
fatcat:xvabozkefvdznlwqge7ssnixty
Inception Makes Non-malleable Codes Stronger
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Our result is obtained by a series of black-box reductions starting from the non-malleable codes from [ADL14]. ...
Perhaps the most useful notion among these is that of continuous non-malleable codes, that allows for continuous tampering by the adversary. ...
Final proof of the main result Theorem 5 proves that non-malleable code from [ADL14] is super non-malleable. ...
doi:10.1007/978-3-319-70503-3_10
fatcat:fpj5iwlwpzd6dmocwfenfh5a7y
Non-Malleable Functions and Their Applications
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, we show that NMFs lead to a simple black-box construction of continuous nonmalleable key derivation functions recently proposed by Qin et al. ...
Roughly, a function f is non-malleable if, given an image y * ← f (x * ) for a randomly chosen x * , it is hard to output a mauled image y with φ from some transformation class s.t. y = f (φ(x * )). ...
We also thank the anonymous reviewers of PKC 2016 for their useful comments. ...
doi:10.1007/978-3-662-49387-8_15
fatcat:fc7qyoytxvaarmahujzjw4noxm
Continuous Non-malleable Codes
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We show that continuous non-malleable codes avoid these restrictions. ...
We construct a split-state code satisfying continuous non-malleability. ...
Acknowledgments Pratyay acknowledges support from a European Research Commission Starting Grant (no. 279447) and the CTIC and CFEM research center. ...
doi:10.1007/978-3-642-54242-8_20
fatcat:uzb4ugftojclfk2fes2xcfooge
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
that the underlying code is continuously non-malleable against a reduced form of bit-wise tampering. ...
non-malleable code, a technical contribution that we believe is of independent interest. ...
We thank Joël Alwen and Daniel Tschudi for helpful discussions, in particular on the impossibility proof in Section 5. ...
doi:10.1007/978-3-662-46494-6_22
fatcat:oig4ocrr7zhg3cb656tc3ivnd4
Capacity of non-malleable codes
2014
Proceedings of the 5th conference on Innovations in theoretical computer science - ITCS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this work, we study the "capacity of non-malleable codes," and establish optimal bounds on the achievable rate as a function of the family size, answering an open problem from Dziembowski et al. ...
• We show the existence of families of size exp(n O(1) 2 αn ) against which there is no non-malleable code of rate 1 − α (in fact this is the case w.h.p for a random family of this size). • We also show ...
ACKNOWLEDGEMENT The authors would like to thank anonymous reviewers for their invaluable comments on an earlier draft of this work, and Jaikumar Radhakrishnan, Yury Polyanskiy and Yihong Wu for the discussion ...
doi:10.1145/2554797.2554814
dblp:conf/innovations/CheraghchiG14
fatcat:zyfmazk4ybfobarf4wb7opo43y
Capacity of Non-Malleable Codes
2016
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this work, we study the "capacity of non-malleable codes," and establish optimal bounds on the achievable rate as a function of the family size, answering an open problem from Dziembowski et al. ...
• We show the existence of families of size exp(n O(1) 2 αn ) against which there is no non-malleable code of rate 1 − α (in fact this is the case w.h.p for a random family of this size). • We also show ...
ACKNOWLEDGEMENT The authors would like to thank anonymous reviewers for their invaluable comments on an earlier draft of this work, and Jaikumar Radhakrishnan, Yury Polyanskiy and Yihong Wu for the discussion ...
doi:10.1109/tit.2015.2511784
fatcat:kiqlitucnffl5bpsm6neuljsay
Non-malleable codes from additive combinatorics
2014
Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The split-state tampering arises in many realistic applications, such as the design of non-malleable secret sharing schemes, motivating the question of designing efficient non-malleable codes in this model ...
The heart of our construction uses the following new property of the inner-product function L, R over the vector space F n p ...
We would also like to thank Stefan Dziembowski, Tomasz Kazana, and Maciej Obremski for sharing their recent work on non-malleable codes for 1-bit messages [DKO13] . ...
doi:10.1145/2591796.2591804
dblp:conf/stoc/AggarwalDL14
fatcat:n5nocrpjqfg77i5ujwxagr45qm
Non-Malleable Codes from Additive Combinatorics
2018
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The split-state tampering arises in many realistic applications, such as the design of non-malleable secret sharing schemes, motivating the question of designing efficient non-malleable codes in this model ...
The heart of our construction uses the following new property of the inner-product function L, R over the vector space F n p ...
We would also like to thank Stefan Dziembowski, Tomasz Kazana, and Maciej Obremski for sharing their recent work on non-malleable codes for 1-bit messages [DKO13] . ...
doi:10.1137/140985251
fatcat:5gtvoadv35a67pnto56r4jmkky
Malleable Coding: Compressed Palimpsests
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
A malleable coding scheme considers not only compression efficiency but also the ease of alteration, thus encouraging some form of recycling of an old compressed version in the formation of a new one. ...
Malleability cost is the difficulty of synchronizing compressed versions, and malleable codes are of particular interest when representing information and modifying the representation are both expensive ...
Definition 18: A mapping f from the metric space (S n , d A n ) to the metric space (V nK , d G n ) is called Lipschitz continuous if d G n (f (x 1 ), f (x 2 )) ≤ Cd A n (x 1 , x 2 ) 7 There are several ...
arXiv:0806.4722v1
fatcat:ku4jahgyyzgn3mib2syeoqx2fi
Capacity of Non-Malleable Codes
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this work, we study the "capacity of non-malleable coding", and establish optimal bounds on the achievable rate as a function of the family size, answering an open problem from Dziembowski et al. ...
We show the existence of families of size (n^O(1) 2^α n) against which there is no non-malleable code of rate 1-α (in fact this is the case w.h.p for a random family of this size). 3. ...
The notion of non-malleable coding schemes from [8] can now be rephrased as follows.
Definition 2.3 (Non-malleability). ...
arXiv:1309.0458v1
fatcat:okfsv4lr3fasvmun3bm2nir3ze
Non-Malleable Encryption: Simpler, Shorter, Stronger
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To achieve our goal, we define and construct a novel type of continuous non-malleable code (NMC), called secret-state NMC, as we show that standard continuous NMCs are not enough for the natural "encode-then-encrypt-bit-by-bit ...
In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). ...
This reduces our question to building a secret-state non-malleable code resilient against continuous parallel tampering attacks from F set . ...
doi:10.1007/978-3-662-49096-9_13
fatcat:pteqfo5nbvdclkubuojhaj5o5q
« Previous
Showing results 1 — 15 out of 3,140 results