Depending on the application, malleability in cryptography can be viewed as either a flaw or — especially if sufficiently understood and restricted — a feature. In this vein, Chase, Kohlweiss, Lysyanskaya, and Meiklejohn recently defined malleable zero-knowledge proofs, and showed how to control the set of allowable transformations on proofs. As an application, they construct the first compact ...

OBJECTIVE Previous research has shown that biological (e.g., genetic, biochemical) accounts of depression--currently in ascendancy--are linked to the general public's pessimism about the syndrome's prognosis. This research examined for the first time whether people with depressive symptoms would associate biological accounts of depression with pessimism about their own prognoses and whether a p...

Let Γ y X be a measure preserving (m.p.) action of a discrete group Γ on a probability measure space (X,μ) and H ⊂ Γ a non-amenable subgroup with commutant H = {g ∈ Γ | gh = hg, ∀h ∈ H} infinite. We prove that if the action satisfies a malleability condition on HH, is weak mixing on H and has stable spectral gap on H (e.g. if the action is Bernoulli on HH), then any cocycle with values in a Pol...

We show how to transform any semantically secure encryption scheme into a non-malleable one, with a black-box construction that achieves a quasilinear blow-up in the size of the ciphertext. This improves upon the previous non-black-box construction of Pass, Shelat and Vaikuntanathan (Crypto ’06). Our construction also extends readily to guarantee non-malleability under a boundedCCA2 attack, the...

The Implicit Association Test (IAT) was designed to measure automatically activated attitudinal associations, free of the influence of processes that affect their expression. Subsequent research has shown that IAT performance also is influenced by non-associative processes, but the extent to which these non-associative processes are content-specific or if they operate similarly regardless of th...