Learn More
The arrival of indistinguishability obfuscation (iO) has transformed the cryptographic landscape by enabling several security goals that were previously beyond our reach. Consequently, one of the pressing goals currently is to construct iO from well-studied standard cryptographic assumptions. In this work, we make progress in this direction by presenting a(More)
We show how to construct indistinguishability obfuscation (iO) for circuits from any non-compact functional encryption (FE) scheme with sub-exponential security against unbounded collusions. We accomplish this by giving a generic transformation from any such FE scheme into a compact FE scheme. By composing this with the transformation from sub-exponentially(More)
— Active Queue Management (AQM) policies are mechanisms for congestion avoidance, which pro-actively drop packets in order to provide an early congestion notification to the sources. In this paper we propose a new Adaptive Prediction based Approach for Congestion Estimation in Active Queue Management (APACE) that predicts the instantaneous queue length at a(More)
The notion of multi-input functional encryption (MI-FE) was recently introduced by Goldwasser et al. [EUROCRYPT'14] as a means to non-interactively compute aggregate information on the joint private data of multiple users. A fundamental limitation of their work, however, is that the total number of users (which corresponds to the arity of the functions(More)
Present constructions of indistinguishability obfuscation (iO) create obfuscated programs where the size of the obfuscated program is at least a factor of a security parameter larger than the size of the original program. In this work, we construct the first iO scheme that achieves only a constant multiplica-tive overhead (in fact, the constant is 2) in the(More)