In this report,based on the paper of Dziembowski et al.'s [DPW10], we explain how we can construct an e cient code that is nonmalleable with respect to modi cations that e ect each bit of the codeword arbitrarily. A variety of modi cations of codewords are considered such as ipping each bit of the codeword, leaving it untouched, or setting it to either 0 or 1 but independently of the value of t...

Verifiability is central to building protocols and systems with integrity. Initially, efficient methods employed the Fiat-Shamir heuristics. Since 2008, the Groth-Sahai techniques have been the most efficient in constructing non-interactive witness indistinguishable and zero-knowledge proofs for algebraic relations. For the important task of proving membership in linear subspaces, Jutla and Roy...

Dual-process models imply that automatic attitudes should be less flexible than their selfreported counterparts; the relevant empirical record, however, is mixed. To advance the debate, we conducted four experiments investigating how readily automatic preferences for one imagined social group over another could be induced and/or reversed. Experiments 1 and 2 revealed that automatic preferences,...

We construct the first constant-round non-malleable commitment scheme and the first constantround non-malleable zero-knowledge argument system, as defined by Dolev, Dwork and Naor. Previous constructions either used a non-constant number of rounds, or were only secure under stronger setup assumptions. An example of such an assumption is the shared random string model where we assume all parties...

The notion of non-malleable codes was introduced as a relaxation of standard error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In the information theoretic setting, although existence of such codes for various rich classes of tampering functions is known, expl...

This study examined if women’s beliefs regarding the malleability of traits influences their tendency to disengage from the math domain following failure. As predicted, women who believed their math skills were fixed and unchangeable showed less math identification and less interest in math tasks than women who believed their math skills were malleable. These results suggest that women with fix...

We sketch some reasons for thinking that modern formulations of mechanics might shed some light on old questions about human nature, in particular the malleability of human nature and the character of limits on cognition and volition. We illustrate the approach by showing how to regard certain forces that depend on mental states or the states of artificial controllers as interaction forces betw...