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

We propose and analyze a proportional share resource allocation algorithm for realizing
real-time performance in time-shared operating systems. Processes are assigned a weight …

Increasing deployment of advanced zero-knowledge proof systems, especially zkSNARKs,
has raised critical questions about their security against real-world attacks. Two classes of …

Abstract Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs)
are becoming an increasingly fundamental tool in many real-world applications where the …

We consider what constitutes identities in cryptography. Typical examples include your
name and your social-security number, or your fingerprint/iris-scan, or your address, or your …

We study the design of cryptographic primitives resistant to a large class of side-channel
attacks, called “memory attacks”, where an attacker can repeatedly and adaptively learn …

We present a new non-malleable commitment protocol. Our protocol has the following
features: itemize The protocol has only three rounds of interaction. Pass (TCC 2013) showed …

Randomness extractors and error correcting codes are fundamental objects in computer
science. Recently, there have been several natural generalizations of these objects, in the …

We present the first constant-round non-malleable commitment scheme and the first
constant-round non-malleable zero-knowledge argument system, as defined by Dolev …

We present a nonmalleable commitment scheme that retains its security properties even
when concurrently executed a polynomial number of times. That is, a man-in-the-middle …