Results 561 - 570 of 24343
We construct an adaptively-sound succinct non-interactive argument (SNARG) for NP in the CRS model from sub-exponentially-secure indistinguishability obfuscation (iO) and sub-exponentially-secure one-way functions. Previously, Waters and Wu (STOC 2024), and subsequently, Waters and Zhandry (CRYPTO 2024) showed how to construct adaptively-sound SNARGs for NP by relying on sub-exponentially-secure indistinguishability obfuscation, one-way functions, and an additional algebraic assumption
(i.e., discrete log, factoring, or learning with errors). In this work, we show that no additional algebraic assumption is needed and vanilla (sub-exponentially-secure) one-way functions already suffice in combination with iO.
Abstract not available.
Obfuscation of quantum programs is emerging as a fascinating and still largely mysterious frontier in cryptography. In this talk, I will present recent progress in this area: a new obfuscation scheme capable of handling any quantum program that implements a unitary transformation, even those involving auxiliary quantum states. I will give a high-level overview of the core techniques and discuss where these ideas might take us next.
We consider indistinguishability obfuscation (iO) for multi-output circuits of size s, where s is the number of AND/OR/NOT gates in C. Under the worst-case assumption that NP not in BPP, we establish that there is no efficient indistinguishability obfuscation scheme that outputs circuits of size s+ o(s/log s). In other words, to be secure, an efficient iO scheme must incur an s/log s additive overhead in the size of the obfuscated circuit.
The proof of our main result builds on a connection between obfuscation and meta-complexity, and on the NP-hardness of circuit minimization for multi-output circuits established by Loff, Ilango, and Oliveira [ILO20], together with other techniques from cryptography and complexity theory.
Based on a joint work with Zhenjian Lu, Igor C. Oliveira and Rafael Pass.
A central line of inquiry in the study of indistinguishability obfuscation (IO) is to minimize the size of the obfuscation. Today we know how to obfuscate programs represented as Turing machines, where the size of the obfuscation grows only with the input size and not with the machine's running time. Jain and Jin [FOCS 2022] showed how to remove the dependency on the input size for functionally equivalent programs where equivalence can be proven in Cook's theory PV, assuming IO for circuits and LWE.
In this work we investigate the limits of the pursuit of succinct obfuscation. We consider the task of obfuscating a program with a large description, most of which can be made public while some portion of the description is secret. We put forth a new notion of \emph{fully succinct IO} where the size of obfuscated program only grows with the size of the program's secret part and not with the public part or with the input size.
Starting with input-succinct IO for PV-equivalent machines, we construct fully succinct IO for the same class of programs. We refer to such an obfuscation as fully succinct pv-IO. Next, we show how to bootstrap our fully succinct pv-IO to achieve full IO security. Our bootstrapping theorems are based on succinct cryptographic primitives with seemingly weaker functionality: either succinct witness encryption or SNARGs for NP with unique proofs. We also require that the correctness of these primitives can be proven in theory PV. We show that these assumptions are sufficient and necessary.
We demonstrate several applications of fully succinct IO and pv-IO:
We give the first IO construction where the size of the obfuscated program is less than twice the size of the original program for a large class of useful programs.
We show how to avoid padding the program before obfuscating it -- a step often necessitated by security analysis -- by replacing the padding with a public random string.
Assuming only fully succinct pv-IO and other standard assumptions, we give the first construction of succinct computational secret sharing for access structures represented by polynomial-size monotone circuits where the share size does not grow with the size of the access structure.