Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to
almost any known cryptographic object. Prior candidate IO constructions were based on …

Registered encryption (Garg et al., TCC'18) is an emerging paradigm that tackles the key-
escrow problem associated with identity-based encryption by replacing the private-key …

We consider the question of finding the lowest degree L for which L-linear maps suffice to
obtain IO. The current state of the art (Lin, EUROCRYPT'16, CRYPTO'17; Lin and …

The exact hardness of computing a Nash equilibrium is a fundamental open question in
algorithmic game theory. This problem is complete for the complexity class PPAD. It is well …

We devise a novel simulation technique that makes black-box use of the adversary as well
as the distinguisher. Using this technique we construct several round-optimal protocols …

This paper introduces the first registered functional encryption RFE scheme tailored for
linear functions. Distinctly different from classical functional encryption (FE), RFE addresses …

We define and construct Deniable Fully Homomorphic Encryption based on the Learning
With Errors (LWE) polynomial hardness assumption. Deniable FHE enables storing …

Functional encryption lies at the frontiers of the current research in cryptography; some
variants have been shown sufficiently powerful to yield indistinguishability obfuscation (IO) …

Over the last decade, indistinguishability obfuscation (iO) has emerged as a seemingly
omnipotent primitive with numerous applications to cryptography and beyond. Moreover …

The Complexity of Public-Key Cryptography Page 1 Chapter 2 The Complexity of Public-Key
Cryptography Boaz Barak Abstract We survey the computational foundations for public-key …