Quantum cryptography is arguably the fastest growing area in quantum information science.
Novel theoretical protocols are designed on a regular basis, security proofs are constantly …

Quantum cryptography exploits principles of quantum physics for the secure processing of
information. A prominent example is secure communication, ie, the task of transmitting …

Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

We propose a novel paradigm for defining security of cryptographic protocols, called
universally composable security. The salient property of universally composable definitions …

Quantum Information Theory is an area of physics which studies both fundamental and
applied issues in quantum mechanics from an information-theoretical viewpoint. The …

A credential system is a system in which users can obtain credentials from organizations
and demonstrate possession of these credentials. Such a system is anonymous when …

We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to
hash a large set of inputs into one short value, such that there is a short proof that a given …

This paper describes the direct anonymous attestation scheme (DAA). This scheme was
adopted by the Trusted Computing Group (TCG) as the method for remote authentication of …

We give a O (√ log n)-approximation algorithm for the sparsest cut, edge expansion,
balanced separator, and graph conductance problems. This improves the O (log n) …

We show how to securely realize any multi-party functionality in a universally composable
way, regardless of the number of corrupted participants. That is, we consider a multi-party …