Indistinguishability obfuscation from well-founded assumptions
Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …
programs into unintelligible ones while preserving functionality. It is a fascinating and …
Registered attribute-based encryption
Attribute-based encryption (ABE) generalizes public-key encryption and enables fine-
grained control to encrypted data. However, ABE upends the traditional trust model of public …
grained control to encrypted data. However, ABE upends the traditional trust model of public …
Witness encryption and null-IO from evasive LWE
Witness encryption (WE) allows us to use an arbitrary NP statement x as a public key to
encrypt a message, and the witness w serves as a decryption key. Security ensures that …
encrypt a message, and the witness w serves as a decryption key. Security ensures that …
Adaptively sound zero-knowledge snarks for up
S Mathialagan, S Peters, V Vaikuntanathan - Annual International …, 2024 - Springer
We study succinct non-interactive arguments (SNARGs) and succinct non-interactive
arguments of knowledge (SNARKs) for the class UP in the reusable designated verifier …
arguments of knowledge (SNARKs) for the class UP in the reusable designated verifier …
Candidate iO from homomorphic encryption schemes
We propose a new approach to construct general-purpose indistinguishability obfuscation
(iO). Our construction is obtained via a new intermediate primitive that we call split fully …
(iO). Our construction is obtained via a new intermediate primitive that we call split fully …
Lossy cryptography from code-based assumptions
Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …
primitives with lossy or homomorphic properties built from various assumptions such as …
Indistinguishability obfuscation from bilinear maps and LPN variants
We construct an indistinguishability obfuscation (IO) scheme from the sub-exponential
hardness of the decisional linear problem on bilinear groups together with two variants of …
hardness of the decisional linear problem on bilinear groups together with two variants of …
Registered (inner-product) functional encryption
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 …
escrow problem associated with identity-based encryption by replacing the private-key …
Non-interactive zero-knowledge from LPN and MQ
We give the first construction of non-interactive zero-knowledge (NIZK) arguments from post-
quantum assumptions other than Learning with Errors. In particular, we achieve NIZK under …
quantum assumptions other than Learning with Errors. In particular, we achieve NIZK under …
Registered ABE via predicate encodings
This paper presents the first generic black-box construction of registered attribute-based
encryption (Reg-ABE) via predicate encoding [TCC'14]. The generic scheme is based on k …
encryption (Reg-ABE) via predicate encoding [TCC'14]. The generic scheme is based on k …