A signature scheme is malleable if, on input a message m and a signature σ, it is possible toefficiently compute a signature σ′ on a related message m′ = T (m), for a transformation T thatis allowable with respect to this signature scheme. Previous work considered various useful flavorsof allowable transformations, such as quoting and sanitizing messages. In this paper, we explore a...

The authors examined the link between malleable racial identification and psychological well-being among self-identified multiracial adults. Malleable racial identification refers to the tendency to identify with different racial identities across different social contexts. Results across three studies suggested that malleable racial identification was associated with lower psychological well-b...

We study ballot independence for election schemes. First, we formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. Secondly, we introduce a notion of controlled malleability and prove that it is sufficient for ballot independence. We also prove that non-malleable ballots are sufficient for ballot independence. Thirdly, we prove th...

We study ballot independence for election schemes: – We formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. – We introduce a notion of controlled malleability and show that it is sufficient for ballot independence. We also show that non-malleable ballots are sufficient, but not necessary, for ballot independence. – We prove that...

Dziembowski, Pietrzak, and Wichs (ICS–2010) introduced the notion of non-malleable codes as a relaxation of the error-correcting codes. Intuitively, a non-malleable code ensures that the tampered codeword encodes the original message or a message that is entirely independent of the original message. One of the fundamental research directions in the field of non-malleable code construction consi...

We introduce the notion of “non-malleable codes” which relaxes the notion of error-correction and errordetection. 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 contrast to error-correction and error-detection, nonmalleability can be achieved for very rich classes of modifications. We constr...