How many rounds and which computational assumptions are needed for concurrent nonmalleable commitments? The above question has puzzled researchers for several years. Recently, Pass in [TCC 2013] proved a lower bound of 3 rounds when security is proven through black-box reductions to falsifiable assumptions. On the other side, positive results of Goyal [STOC 2011], Lin and Pass [STOC 2011] and G...

We introduce a new security notion for public-key encryption (PKE) that we dub non-malleability under (chosen-ciphertext) self-destruct attacks (NM-SDA), which appears to be the strongest natural PKE security notion below full-blown chosen-ciphertext (IND-CCA) security. In this notion, the adversary is allowed to ask many adaptive “parallel” decryption queries (i.e., a query consists of many ci...

Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryption E(m) of some unknown message m, it should be hard to transform this ciphertext into some encryption E(m∗) of a related message m∗. This notion has been studied extensively for primitives like encryption, commitmen...

In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for commitment schemes have been proposed in the literature: concurrent non-malleability with respect to commitment and concurrent non-malleability with respect to decommitment (i.e., opening). After the original notion of non-mal...

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

In this paper we introduce two notions of security: multiuser indistinguishability and multiuser non-malleability. We believe that they encompass the correct requirements for public key encryp-tion schemes in the context of multicast communications. A precise and non-trivial analysis prove that they are equivalent to the former single-user notions, provided the number of participants is polynom...

Malleability, the ability to adapt materials specific shapes, is necessary in applications where a form closure requested. The material should be easily deformable between desired stable shapes. Such stability can obtained through bistable elements that act as memory metamaterials. In this paper, with behavior programmed by local temperature presented. switched permanent shape change and comple...

Knots in long DNA molecules are prevalent biological systems and serve as a model system for investigating static dynamic properties of biopolymers. We explore the dynamics knots double-stranded new regime nanometer-scale confinement, large forces, short time scales, using solid-state nanopores. show that undergo isomorphic translocation through nanopore, retaining their equilibrium morphology ...