Prabhanjan Vijendra Ananth

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption.

[BibT_eX]

[DOI]

Aayush Jain

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Cryptography with Updates.

[BibT_eX]

[DOI]

Aloni Cohen

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

A New Approach to Round-Optimal Secure Multiparty Computation.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Functional Encryption for Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Delegating RAM Computations with Adaptive Soundness and Privacy.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Patchable Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation with Constant Size Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation from Compact Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

From Selective to Adaptive Security in Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Lower Bounds in the Hardware Token Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Interactive Proofs under Continual Memory Leakage.

[BibT_eX]

[DOI]

Vipul Goyal

Omkant Pandey

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.

[BibT_eX]

[DOI]

Divya Gupta

Yuval Ishai

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013

Differing-Inputs Obfuscation and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

On the (In)security of Fischlin's Paradigm.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Non Observability in the Random Oracle Model.

[BibT_eX]

[DOI]

Raghav Bhaskar

Proceedings of the Provable Security - 7th International Conference, 2013

2012

Complexity of Gröbner basis detection and border basis detection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

An Algebraic Characterization of Rainbow Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

2011

Hardness and Parameterized Algorithms on Rainbow Connectivity problem

[BibT_eX]

[DOI]

Meghana Nasre

Kanthi K. Sarpatwar

CoRR, 2011

On Gröbner Basis Detection for Zero-dimensional Ideals

[BibT_eX]

[DOI]

CoRR, 2011

New Hardness Results in Rainbow Connectivity

[BibT_eX]

[DOI]

Meghana Nasre

CoRR, 2011

Border basis detection is NP-complete.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Rainbow Connectivity: Hardness and Tractability.

[BibT_eX]

[DOI]