CryptoDB
Kaartik Bhushan
Publications
Year
Venue
Title
2024
PKC
R3PO: Reach-Restricted Reactive Program Obfuscation and its Applications
Abstract
In recent breakthrough results, novel use of grabled circuits yielded
constructions for several primitives like Identity-Based Encryption
(IBE) and 2-round secure multi-party computation, based on standard
assumptions in public-key cryptography. While the techniques in these
different results have many common elements, these works did not offer a
modular abstraction that could be used across them.
Our main contribution is to introduce a novel notion of obfuscation, called
Reach-Restricted Reactive-Program Obfuscation (R3PO) that
captures the essence of these constructions, and exposes additional capabilities.
We provide a powerful composition theorem whose proof fully encapsulates the
use of garbled circuits in these works.
As an illustration of the potential of R3PO, and as an important
contribution of independent interest, we present a variant of
Multi-Authority Attribute-Based Encryption (MA-ABE) that can be based on
(single-authority) CP-ABE in a blackbox manner, using only standard
cryptographic assumptions (e.g., DDH) in addition. This is in stark contrast
to the existing constructions for MA-ABE, which rely on the random oracle
model and supports only limited policy classes.
2022
TCC
Secure Non-Interactive Reducibility is Decidable
Abstract
Secure Non-Interactive Reductions (SNIR) is a recently introduced, but fundamental cryp- tographic primitive. The basic question about SNIRs is how to determine if there is a SNIR from one 2-party correlation to another. While prior work provided answers for several pairs of correlations, the possibility that this is an undecidable problem in general was left open. In this work we show that the existence of a SNIR between any pair of correlations can be determined by an algorithm.
At a high-level, our proof follows the blueprint of a similar (but restricted) result by Khorasgani et al. But combining the spectral analysis of SNIRs by Agrawal et al. (Eurocrypt 2022) with a new variant of a “junta theorem” by Kindler and Safra, we obtain a complete resolution of the decidability question for SNIRs. The new junta theorem that we identify and prove may be of independent interest.
Coauthors
- Kaartik Bhushan (2)
- Ankit Kumar Misra (1)
- Varun Narayanan (1)
- Sai Lakshmi Bhavana Obbattu (1)
- Manoj Prabhakaran (2)
- Rajeev Raghunath (1)