关注
Abhishek Jain
Abhishek Jain
Associate Professor, Johns Hopkins University
在 cs.jhu.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Bounded ciphertext policy attribute based encryption
V Goyal, A Jain, O Pandey, A Sahai
International Colloquium on Automata, Languages, and Programming, 579-591, 2008
7872008
Multiparty computation with low communication, computation and interaction via threshold FHE
G Asharov, A Jain, A López-Alt, E Tromer, V Vaikuntanathan, D Wichs
Annual International Conference on the Theory and Applications of …, 2012
5342012
Multi-input functional encryption
S Goldwasser, SD Gordon, V Goyal, A Jain, J Katz, FH Liu, A Sahai, E Shi, ...
Annual International Conference on the Theory and Applications of …, 2014
4222014
Indistinguishability obfuscation from compact functional encryption
P Ananth, A Jain
Advances in Cryptology--CRYPTO 2015, 308-326, 2015
2642015
Time-lock puzzles from randomized encodings
N Bitansky, S Goldwasser, A Jain, O Paneth, V Vaikuntanathan, B Waters
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
1752016
Function-hiding inner product encryption
A Bishop, A Jain, L Kowalczyk
Advances in Cryptology–ASIACRYPT 2015, 470-491, 2015
1542015
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards
AR Choudhuri, M Green, A Jain, G Kaptchuk, I Miers
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
1512017
Practical UC security with a global random oracle
R Canetti, A Jain, A Scafuro
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014
1382014
Commitments and efficient zero-knowledge proofs from learning parity with noise
A Jain, S Krenn, K Pietrzak, A Tentes
Advances in Cryptology–ASIACRYPT 2012, 663-680, 2012
1352012
Efficient Authentication from Hard Learning Problems
E Kiltz, K Pietrzak, D Venturi, D Cash, A Jain
Journal of Cryptology 30 (4), 1238-1275, 2017
1312017
Efficient authentication from hard learning problems
E Kiltz, K Pietrzak, D Cash, A Jain, D Venturi
Advances in Cryptology–EUROCRYPT 2011, 7-26, 2011
131*2011
Succinct garbling and indistinguishability obfuscation for ram programs
R Canetti, J Holmgren, A Jain, V Vaikuntanathan
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of …, 2015
127*2015
On the achievability of simulation-based security for functional encryption
A De Caro, V Iovino, A Jain, A O’Neill, O Paneth, G Persiano
Advances in Cryptology–CRYPTO 2013, 519-535, 2013
1132013
Leakage-resilient zero knowledge
S Garg, A Jain, A Sahai
Advances in Cryptology–CRYPTO 2011, 297-315, 2011
892011
Packet-dropping adversary identification for data plane security
X Zhang, A Jain, A Perrig
Proceedings of the 2008 ACM CoNEXT Conference, 1-12, 2008
862008
SNARGs for P from LWE.
AR Choudhuri, A Jain, Z Jin
IACR Cryptol. ePrint Arch. 2021, 808, 2021
84*2021
Why “fiat-shamir for proofs” lacks a proof
N Bitansky, D Dachman-Soled, S Garg, A Jain, YT Kalai, A López-Alt, ...
Theory of Cryptography, 182-201, 2013
712013
Distinguisher-dependent simulation in two rounds and its applications
A Jain, YT Kalai, D Khurana, R Rothblum
Annual International Cryptology Conference, 158-189, 2017
702017
Promise zero knowledge and its applications to round optimal MPC
S Badrinarayanan, V Goyal, A Jain, YT Kalai, D Khurana, A Sahai
Annual International Cryptology Conference, 459-487, 2018
682018
A new approach to round-optimal secure multiparty computation
P Ananth, AR Choudhuri, A Jain
Annual International Cryptology Conference, 468-499, 2017
682017
系统目前无法执行此操作,请稍后再试。
文章 1–20