| Path ORAM: an extremely simple oblivious RAM protocol E Stefanov, MV Dijk, E Shi, THH Chan, C Fletcher, L Ren, X Yu, ... Journal of the ACM (JACM) 65 (4), 1-26, 2018 | 962 | 2018 |
| Privacy-preserving aggregation of time-series data R Shi, R Chow, THH Chan | 772 | 2016 |
| Multi-dimensional range query over encrypted data E Shi, J Bethencourt, THH Chan, D Song, A Perrig 2007 IEEE Symposium on Security and Privacy (SP'07), 350-364, 2007 | 686 | 2007 |
| Oblivious RAM with O ((logN) 3) worst-case cost E Shi, THH Chan, E Stefanov, M Li International Conference on The Theory and Application of Cryptology and …, 2011 | 470 | 2011 |
| Private and continual release of statistics THH Chan, E Shi, D Song ACM Transactions on Information and System Security (TISSEC) 14 (3), 1-24, 2011 | 431 | 2011 |
| Circuit oram: On tightness of the goldreich-ostrovsky lower bound X Wang, H Chan, E Shi Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 266 | 2015 |
| Privacy-preserving stream aggregation with fault tolerance THH Chan, E Shi, D Song International Conference on Financial Cryptography and Data Security, 200-214, 2012 | 219 | 2012 |
| Oblivious data structures XS Wang, K Nayak, C Liu, THH Chan, E Shi, E Stefanov, Y Huang Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014 | 192 | 2014 |
| SCORAM: oblivious RAM for secure computation XS Wang, Y Huang, THH Chan, A Shelat, E Shi Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014 | 177 | 2014 |
| On hierarchical routing in doubling metrics THH Chan, A Gupta, BM Maggs, S Zhou Carnegie Mellon University, 2005 | 127 | 2005 |
| How to vote privately using bitcoin Z Zhao, THH Chan International Conference on Information and Communications Security, 82-96, 2015 | 102 | 2015 |
| Differentially private continual monitoring of heavy hitters from distributed streams THH Chan, M Li, E Shi, W Xu International Symposium on Privacy Enhancing Technologies Symposium, 140-159, 2012 | 101 | 2012 |
| A random-surfer web-graph model A Blum, THH Chan, MR Rwebangira 2006 Proceedings of the Third Workshop on Analytic Algorithmics and …, 2006 | 92 | 2006 |
| Optimal lower bound for differentially private multi-party aggregation THH Chan, E Shi, D Song European Symposium on Algorithms, 277-288, 2012 | 91 | 2012 |
| Finding subgraphs with maximum total density and limited overlap OD Balalau, F Bonchi, THH Chan, F Gullo, M Sozio Proceedings of the Eighth ACM International Conference on Web Search and …, 2015 | 75 | 2015 |
| Spectral properties of hypergraph laplacian and approximation algorithms THH Chan, A Louis, ZG Tang, C Zhang Journal of the ACM (JACM) 65 (3), 1-48, 2018 | 60 | 2018 |
| Communication complexity of byzantine agreement, revisited I Abraham, THH Chan, D Dolev, K Nayak, R Pass, L Ren, E Shi Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 59 | 2019 |
| Aggregate queries for discrete and continuous probabilistic XML S Abiteboul, THH Chan, E Kharlamov, W Nutt, P Senellart Proceedings of the 13th international conference on database theory, 50-61, 2010 | 55 | 2010 |
| Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006 | 49 | 2006 |
| Small hop-diameter sparse spanners for doubling metrics THH Chan, A Gupta Discrete & Computational Geometry 41 (1), 28-44, 2009 | 48 | 2009 |
