Non-malleable commitments are a fundamental cryptographic tool for preventing
(concurrent) man-in-the-middle attacks. Since their invention by Dolev, Dwork, and Naor in …

We study the foundations of secure computation in the blockchain-hybrid model, where a
blockchain–modeled as a global functionality–is available as an Oracle to all the …

We show the following result: Assuming the existence of p ublic-coin differing-input
obfuscation (pc-diO) for the class of all polynomial time Turing machines, then there exists a …

We present a round-efficient black-box construction of a general MPC protocol that satisfies
composability in the plain model. The security of our protocol is proven in angel-based UC …

From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the
first ε-simulatable two-party computation (2PC) against quantum polynomial-time (QPT) …

We propose a new framework for concurrently composable security that relaxes the security
notion of UC security. As in previous frameworks, our notion is based on the idea of …

We present the first general MPC protocol that satisfies the following:(1) the construction is
black-box,(2) the protocol is universally composable in the plain model, and (3) the number …

The round complexity of secure computation has been a fundamental problem in
cryptography. Katz and Ostrovsky proved that 5 rounds are both necessary and sufficient for …

A non-malleable code protects messages against various classes of tampering. Informally, a
code is non-malleable if the message contained in a tampered codeword is either the …

Non-interactive zero-knowledge (NIZK) proofs allow a prover to convince a verifier about the
validity of an NP-statement by sending a single message and without disclosing any …