We introduce a novel generic ring signature construction, called DualRing, which can be
built from several canonical identification schemes (such as Schnorr identification) …

Formulating cryptographic definitions to protect against software piracy is an important
research direction that has not received much attention. Since natural definitions using …

We present a new scheme for quantum homomorphic encryption which is compact and
allows for efficient evaluation of arbitrary polynomial-sized quantum circuits. Building on the …

Copy-protection allows a software distributor to encode a program in such a way that it can
be evaluated on any input, yet it cannot be" pirated"–a notion that is impossible to achieve in …

Quantum copy protection, introduced by Aaronson, enables giving out a quantum program-
description that cannot be meaningfully duplicated. Despite over a decade of study, copy …

We initiate the study of encryption schemes where the decryption keys are unclonable
quantum objects, which we call single decryptor encryption. We give a number of initial …

We construct the first constant-round protocols for secure quantum computation in the two-
party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries …

In classical computing, garbled circuits (and their generalization known as randomized
encodings) are a versatile cryptographic tool with many applications such as secure …

A major unresolved question in quantum cryptography is whether it is possible to obfuscate
arbitrary quantum computation. Indeed, there is much yet to understand about the feasibility …

Virtual black-box obfuscation is a strong cryptographic primitive: it encrypts a circuit while
maintaining its full input/output functionality. A remarkable result by Barak et al.(Crypto 2001) …