| Indistinguishability obfuscation from well-founded assumptions A Jain, H Lin, A Sahai Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing …, 2021 | 395 | 2021 |
| The hunting of the SNARK N Bitansky, R Canetti, A Chiesa, S Goldwasser, H Lin, A Rubinstein, ... Journal of Cryptology 30 (4), 989-1066, 2017 | 227 | 2017 |
| Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs H Lin Annual International Cryptology Conference, 599-629, 2017 | 200 | 2017 |
| Obfuscation of probabilistic circuits and applications R Canetti, H Lin, S Tessaro, V Vaikuntanathan Theory of cryptography conference, 468-497, 2015 | 182 | 2015 |
| Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings H Lin, V Vaikuntanathan 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 11-20, 2016 | 175 | 2016 |
| Succinct randomized encodings and their applications N Bitansky, S Garg, H Lin, R Pass, S Telang Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 172 | 2015 |
| Succinct randomized encodings and their applications N Bitansky, S Garg, H Lin, R Pass, S Telang Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 172 | 2015 |
| Indistinguishability obfuscation from trilinear maps and block-wise local PRGs H Lin, S Tessaro Annual International Cryptology Conference, 630-660, 2017 | 161 | 2017 |
| Indistinguishability obfuscation from constant-degree graded encoding schemes H Lin Annual International Conference on the Theory and Applications of …, 2016 | 161 | 2016 |
| RICH: Automatically protecting against integer-based vulnerabilities D Brumley, T Chiueh, R Johnson, H Lin, D Song Carnegie Mellon University, 2007 | 156 | 2007 |
| Indistinguishability Obfuscation from LPN over , DLIN, and PRGs in NC A Jain, H Lin, A Sahai Annual International Conference on the Theory and Applications of …, 2022 | 137 | 2022 |
| Taostore: Overcoming asynchronicity in oblivious data storage C Sahin, V Zakhary, A El Abbadi, H Lin, S Tessaro 2016 IEEE Symposium on Security and Privacy (SP), 198-217, 2016 | 137 | 2016 |
| Concurrent non-malleable commitments from any one-way function H Lin, R Pass, M Venkitasubramaniam Theory of Cryptography Conference, 571-588, 2008 | 132 | 2008 |
| Adaptive hardness and composable security in the plain model from standard assumptions R Canetti, H Lin, R Pass 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 541-550, 2010 | 125 | 2010 |
| A unified framework for concurrent security: universal composability from stand-alone non-malleability H Lin, R Pass, M Venkitasubramaniam Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 120 | 2009 |
| After-the-fact leakage in public-key encryption S Halevi, H Lin Theory of Cryptography, 107-124, 2011 | 111 | 2011 |
| Foundations of homomorphic secret sharing E Boyle, N Gilboa, Y Ishai, H Lin, S Tessaro Cryptology ePrint Archive, 2017 | 105 | 2017 |
| Oblivious transfer is in MiniQCrypt AB Grilo, H Lin, F Song, V Vaikuntanathan Annual International Conference on the Theory and Applications of …, 2021 | 104 | 2021 |
| Delegation of computation without rejection problem from designated verifier CS-proofs S Goldwasser, H Lin, A Rubinstein Cryptology ePrint Archive, 2011 | 103 | 2011 |
| Constant-round non-malleable commitments from any one-way function H Lin, R Pass Proceedings of the 43rd annual ACM symposium on Theory of computing, 705-714, 2011 | 102 | 2011 |
Stefano TessaroProfessor, Paul G. Allen School of Computer Science & Engineering, University of WashingtonVerified email at cs.washington.edu
