The current study examined how manipulating information about whether emotions are fixed or malleable influences the extent to which individuals engage in different emotion regulation strategies. We hypothesized that fixed, compared to malleable, emotion beliefs would produce less effort invested in emotion regulation. Participants were randomly assigned to experimental conditions emphasizing t...

We are building a Malleable Interactive Software Toolkit (MIST), a tool set and infrastructure to simplify the design and construction of dynamically-reconfigurable (malleable) interactive software. Malleable software offers the end-user powerful tools to reshape their interactive environment on the fly. We aim to make the construction of such software straightforward, and to make reconfigurati...

This article introduces a novel human computer interaction device, developed in the scope of a Master’s Thesis. The device allows continuous localized interaction by providing a malleable interaction surface. Diverse multi-finger as well as multi-handed manipulations can be applied. Furthermore, the device acts as a tangible user interface object, integrated into a tangible computing framework ...

a non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. the main idea behind nonmalleable coding is that the adversary should not be able to obtain any valuable information about the message. non-malleablecodes are used in tamper-resilient cryptography and protecting memories against tampering attacks. many different types of nonmalleability have already...

We present an information-theoretically secure continuously non-malleable code in the constant split-state model, where there is a self-destruct mechanism which ensures that the adversary loses access to tampering after the first failed decoding. Prior to our result only codes with computational security were known for this model, and it has been an open problem to construct such a code with in...

A (k, ε)-non-malleable extractor is a function nmExt : {0, 1}×{0, 1} → {0, 1} that takes two inputs, a weak source X ∼ {0, 1} of min-entropy k and an independent uniform seed s ∈ {0, 1}, and outputs a bit nmExt(X, s) that is ε-close to uniform, even given the seed s and the value nmExt(X, s′) for an adversarially chosen seed s′ 6= s. Dodis and Wichs (STOC 2009) showed the existence of (k, ε)-no...