Indistinguishability Obfuscation of Circuits and its Application in Security

06/28/2022
by   Shilun Li, et al.
0

Under discussion in the paper is an i𝒪 (indistinguishability obfuscator) for circuits in Nick's Class. The obfuscator is constructed by encoding the Branching Program given by Barrington's theorem using Multilinear Jigsaw Puzzle framework. We will show under various indistinguishability hardness assumptions, the constructed obfuscator is an i𝒪 for Nick's Class. Using Fully Homomorphic Encryption, we will amplify the result and construct an i𝒪 for P/poly, which are circuits of polynomial size. Discussion on i𝒪 and Functional Encryption is also included in this paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2018

A quantum homomorphic encryption scheme for polynomial-sized circuits

Quantum homomorphic encryption (QHE) is an encryption method that allows...
research
10/02/2018

A rebit-based quantum homomorphic encryption scheme

Quantum homomorphic encryption (QHE) is an encryption method that allows...
research
02/20/2023

Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More

We study certified everlasting secure functional encryption (FE) and man...
research
02/22/2023

Obfuscation of Pseudo-Deterministic Quantum Circuits

We show how to obfuscate pseudo-deterministic quantum circuits, assuming...
research
08/21/2020

Indistinguishability Obfuscation from Well-Founded Assumptions

In this work, we show how to construct indistinguishability obfuscation ...
research
09/06/2021

FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption

Computation on ciphertexts of all known fully homomorphic encryption (FH...
research
03/12/2022

Categories of Differentiable Polynomial Circuits for Machine Learning

Reverse derivative categories (RDCs) have recently been shown to be a su...

Please sign up or login with your details

Forgot password? Click here to reset