Results 1  10
of
1,472,198
Nonmalleable codes from twosource extractors. Unpublished manuscript
, 2013
"... Abstract. We construct an efficient informationtheoretically nonmalleable code in the splitstate model for onebit messages. Nonmalleable codes were introduced recently by Dziembowski, Pietrzak and Wichs (ICS 2010), as a general tool for storing messages securely on hardware that can be subject t ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
/4 of the length of the codeword. Our code is based on the innerproduct twosource extractor, but in general it can be instantiated by any twosource extractor that has large output and has the property of being flexible, which is a new notion that we define. We also show that the nonmalleable codes for one
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related
NonMalleable Extractors, TwoSource Extractors and Privacy Amplification
, 2012
"... Dodis and Wichs [DW09] introduced the notion of a nonmalleable extractor to study the problem of privacy amplification with an active adversary. A nonmalleable extractor is a much stronger version of a strong extractor. Given a weaklyrandom string x and a uniformly random seed y as the inputs, th ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
two known constructions of nonmalleable extractors [DLWZ11, CRS12]. Both constructions only work for (n,k)sources with k> n/2. Interestingly, both constructions are also twosource extractors. In this paper, we present a strong connection between nonmalleable extractors and twosource extractors
NonMalleable Extractors with Shorter Seeds and Privacy Amplication
"... Abstract. Motivated by the problem of how to communicate over a public channel with an active adversary, Dodis and Wichs [DW09] introduced the notion of a nonmalleable extractor. A nonmalleable extractor nmExt: {0, 1}n × {0, 1}d → {0, 1}m takes two inputs, a weaklyrandom W and a uniformly random ..."
Abstract
 Add to MetaCart
Abstract. Motivated by the problem of how to communicate over a public channel with an active adversary, Dodis and Wichs [DW09] introduced the notion of a nonmalleable extractor. A nonmalleable extractor nmExt: {0, 1}n × {0, 1}d → {0, 1}m takes two inputs, a weaklyrandom W and a uniformly
Leakageresilient nonmalleable codes
, 2014
"... A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the leakage attacks in which the adversary obtains some information about the internal state of the machine, and the tampering attacks where the a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
the adversary can modify this state. One of the popular tools used to provide tamperresistance are the nonmalleable codes introduced by Dziembowski, Pietrzak and Wichs (ICS 2010). These codes can be defined in several variants, but arguably the most natural of them are the informationtheoretically secure
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
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 error
Nonmalleable extractors and symmetric key cryptography from weak secrets
 In Proceedings of the 41stACM Symposium on the Theory of Computing
, 2009
"... We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an nbit secret W, which might not be uniformly random, but the adversary has at least k bits of uncertainty about it (formalized using conditional minentropy). Since standard symmetrick ..."
Abstract

Cited by 38 (12 self)
 Add to MetaCart
round (challengeresponse) protocol extracting nearly k random bits. This dramatically improves the previous construction of Renner and Wolf [RW03], which requires Θ(λ + log(n)) rounds where λ is the security parameter. Our solution takes a new approach by studying and constructing “nonmalleable” seeded
NonMalleable Extractors with Short Seeds and Applications to Privacy Amplification
"... Motivated by the classical problem of privacy amplification, Dodis and Wichs (STOC ’09) introduced the notion of a nonmalleable extractor, significantly strengthening the notion of a strong extractor. A nonmalleable extractor is a function nmExt: {0, 1} n × {0, 1} d → {0, 1} m that takes two input ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Motivated by the classical problem of privacy amplification, Dodis and Wichs (STOC ’09) introduced the notion of a nonmalleable extractor, significantly strengthening the notion of a strong extractor. A nonmalleable extractor is a function nmExt: {0, 1} n × {0, 1} d → {0, 1} m that takes two
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
, ” and establish optimal bounds on the achievable rate as a function of the family size, answering an open problem from Dziembowski et al. (ICS 2010). Specifically, • We prove that for every family F with F  � 22αn, there exist nonmalleable codes against F with rate arbitrarily close to 1 − α (this is achieved
Nonmalleable Codes from Additive Combinatorics
, 2013
"... Nonmalleable codes provide a useful and meaningful security guarantee in situations where traditional errorcorrection (and even errordetection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is nonmalleable if the message contained ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
Nonmalleable codes provide a useful and meaningful security guarantee in situations where traditional errorcorrection (and even errordetection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is nonmalleable if the message contained
Results 1  10
of
1,472,198