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 ...

This paper presents a user-level runtime system which provides memory malleability to programs running on non-dedicated computational environments. Memory malleability is analogous to processor malleability in the memory space, i.e. it lets a program shrink and expand its resident set size in response to runtime events, without affecting the correct execution of the program. Malleability become...

We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class F , it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof...

We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely disseminate a proof of a statement while protecting the prover from plagiarism in the following sense: although proofs are transferable (i.e., publicly verifiable), they are also bound to the identity of the prover in a way whi...

Non-generic feedback refers to a specific event and implies that performance is malleable, while generic feedback implies that task performance reflects an inherent ability. The present study examined the influences of generic versus non-generic feedback on motor performance and learning in 10-year-old children. In the first experiment, using soccer ball kicking at a target as a task, providing...

We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class F , it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof...