Prabhanjan Ananth
Prabhanjan Ananth
Assistant Professor, UCSB
Geverifieerd e-mailadres voor cs.ucsb.edu - Homepage
Geciteerd door
Geciteerd door
Indistinguishability obfuscation from compact functional encryption
P Ananth, A Jain
Annual Cryptology Conference, 308-326, 2015
From selective to adaptive security in functional encryption
P Ananth, Z Brakerski, G Segev, V Vaikuntanathan
Annual Cryptology Conference, 657-677, 2015
Differing-inputs obfuscation and applications
P Ananth, D Boneh, S Garg, A Sahai, M Zhandry
Cryptology ePrint Archive, 2013
Optimizing obfuscation: avoiding Barrington's theorem
P Ananth, D Gupta, Y Ishai, A Sahai
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014
Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
P Ananth, A Sahai
Annual International Conference on the Theory and Applications of …, 2017
Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
P Ananth, A Jain, H Lin, C Matt, A Sahai
Annual International Cryptology Conference, 284-332, 2019
Indistinguishability obfuscation from functional encryption for simple functions
P Ananth, A Jain, A Sahai
Cryptology ePrint Archive, 2015
Functional encryption for turing machines
P Ananth, A Sahai
Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2016
Cryptography from pseudorandom quantum states
P Ananth, L Qian, H Yuen
Annual International Cryptology Conference, 208-236, 2022
A new approach to round-optimal secure multiparty computation
P Ananth, AR Choudhuri, A Jain
Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017
Secure software leasing
P Ananth, RL La Placa
Annual International Conference on the Theory and Applications of …, 2021
Multi-key fully-homomorphic encryption in the plain model
P Ananth, A Jain, Z Jin, G Malavolta
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
Round-optimal secure multiparty computation with honest majority
P Ananth, AR Choudhuri, A Goel, A Jain
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
Rainbow connectivity: Hardness and tractability
P Ananth, M Nasre, KK Sarpatwar
IARCS annual conference on foundations of software technology and …, 2011
Universal obfuscation and witness encryption: Boosting correctness and combining security
P Ananth, A Jain, M Naor, A Sahai, E Yogev
Cryptology ePrint Archive, 2016
Delegating RAM computations with adaptive soundness and privacy
P Ananth, YC Chen, KM Chung, H Lin, WK Lin
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
Provable Robust Watermarking for AI-Generated Text
X Zhao, P Ananth, L Li, YX Wang
https://arxiv.org/abs/2306.17439, 2023
Private circuits: A modular approach
P Ananth, Y Ishai, A Sahai
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
Achieving privacy in verifiable computation with multiple servers–without FHE and without pre-processing
P Ananth, N Chandran, V Goyal, B Kanukurthi, R Ostrovsky
International Workshop on Public Key Cryptography, 149-166, 2014
Optimal bounded-collusion secure functional encryption
P Ananth, V Vaikuntanathan
Theory of Cryptography Conference, 174-198, 2019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20