Results 1  10
of
2,419
Explicit Nonmalleable Codes Against BitWise Tampering and Permutations
"... Abstract. A nonmalleable code protects messages against various classes of tampering. Informally, a code is nonmalleable if the message contained in a tampered codeword is either the original message, or a completely unrelated one. Although existence of such codes for various rich classes of tampe ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
functions and the splitstate model. In this paper, for the first time we construct explicit nonmalleable codes against a natural class of noncompartmentalized tampering functions. We allow the tampering functions to permute the bits of the codeword and (optionally) perturb them by flipping or setting
NonMalleable Coding Against Bitwise and SplitState Tampering
"... Nonmalleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where errordetection is impossible. Intuitively, information encoded by a nonmalleable code either decodes to the original messag ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
message or, in presence of any tampering, to an unrelated message. Nonmalleable coding is possible against any class of adversaries of bounded size. In particular, Dziembowski et al. show that such codes exist and may achieve positive rates for any class of tampering functions of size at most 22αn
NonMalleable Coding Against Bitwise and SplitState Tampering
"... Nonmalleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where errordetection is impossible. Intuitively, information encoded by a nonmalleable code either decodes to the original mess ..."
Abstract
 Add to MetaCart
message or, in presence of any tampering, to an unrelated message. Nonmalleable coding is possible against any class of adversaries of bounded size. In particular, Dziembowski et al. show that such codes exist and may achieve positive rates for any class of tampering functions of size at most 22 αn
A RateOptimizing Compiler for Nonmalleable Codes Against Bitwise Tampering and Permutations
"... A nonmalleable code protects messages against a class of tampering functions. Informally, a code is nonmalleable if the effect of applying any tampering function on an encoded message is to either retain the message or to replace it with an unrelated message. Two main challenges in this area – apa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
into an optimalrate – i.e., rate 1 – nonmalleable codes against the same class. If the original code is explicit, so is the new one. When applied to the family of bitwise tampering functions, this subsumes (and greatly simplifies) a recent result of Cheraghchi and Guruswami (TCC 2014). Further, our compiler
D.: Nonmalleable codes
 In: ICS (2010
"... We introduce the notion of “nonmalleable codes ” which relaxes the notion of errorcorrection and errordetection. Informally, a code is nonmalleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to errorcorrection and ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
yield efficient constructions, it gives us efficient nonmalleable codes in the randomoracle model for very general classes of tampering functions — e.g. functions where every bit in the tampered codeword can depend arbitrarily on any 99 % of the bits in the original codeword. As an application of nonmalleable
Capacity of nonmalleable codes
, 2013
"... Nonmalleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages s in a manner so that tampering the codeword causes the decoder to either output s or a message that is independent of s. While this is an impossible goal to achieve against unrestricted tampering function ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
functions, rather surprisingly nonmalleable coding becomes possible against every fixed family F of tampering functions that is not too large (for instance, when F  � 22αn for some α < 1 where n is the number of bits in a codeword). In this work, we study the “capacity of nonmalleable coding
Explicit NonMalleable Codes Resistant to Permutations
, 2014
"... The notion of nonmalleable codes was introduced as a relaxation of standard errorcorrection and errordetection. Informally, a code is nonmalleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In the information theoretic setting ..."
Abstract
 Add to MetaCart
compartmentalized tampering functions. In our model, the tampering function can permute the bits of the encoding and (optionally) perturb them. In the information theoretic setting, we provide an explicit and efficient, rate1 nonmalleable code for multibit messages. Lack of explicit constructions of nonmalleable codes
Tamper Detection and Continuous NonMalleable Codes
, 2014
"... We consider a public and keyless code (Enc,Dec) which is used to encode a message m and derive a codeword c = Enc(m). The codeword can be adversarially tampered via a function f ∈ F from some “tampering function family ” F, resulting in a tampered value c ′ = f(c). We study the different types of s ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
also be made efficient when F  = 2poly(n). For example, F can be the family of all lowdegree polynomials excluding constant and identity polynomials. Such tamperdetection codes generalize the algebraic manipulation detection (AMD) codes of Cramer et al. (EUROCRYPT ’08). Next, we revisit nonmalleable
Blockwise Nonmalleable Codes
, 2015
"... Nonmalleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c ′ either decodes to m or to “something unrelated ” to m. It is known that nonmalleable codes cannot exist for ..."
Abstract
 Add to MetaCart
Nonmalleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c ′ either decodes to m or to “something unrelated ” to m. It is known that nonmalleable codes cannot exist
Efficient NonMalleable Codes and KeyDerivation for PolySize Tampering Circuits
, 2013
"... Nonmalleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c ′ = f(c) such that c ′ = c, then the tampered message x ′ contained in c ′ reveals no information about x. Nonmalleable codes ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
priori, there is an efficient nonmalleable code that protects against all tampering functions f computable by a circuit of size s. More generally, for any family of tampering functions F of size F  ≤ 2s, there is an efficient nonmalleable code that protects against all f ∈ F. The rate of our codes, defined as the ratio
Results 1  10
of
2,419