T-H. Hubert Chan

T-H. Hubert Chan publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where T-H. Hubert Chan sits on this spectrum.

T-H. Hubert Chan D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where T-H. Hubert Chan sits on this spectrum.

Best Publications

• Multi-Dimensional Range Query over Encrypted Data

  E. Shi;J. Bethencourt;T.-H.H. Chan;Dawn Song

  754
  Citations

• Oblivious RAM with o((logn) 3 ) worst-case cost

  Elaine Shi;T.-H. Hubert Chan;Emil Stefanov;Mingfei Li

  510
  Citations

• Private and Continual Release of Statistics

  T.-H. Hubert Chan;Elaine Shi;Dawn Song

  392
  Citations

• Privacy-Preserving Stream Aggregation with Fault Tolerance

  T. H. Hubert Chan;Elaine Shi;Dawn Song

  247
  Citations

• Oblivious Data Structures

  Xiao Shaun Wang;Kartik Nayak;Chang Liu;T-H. Hubert Chan

  232
  Citations

• SCORAM: Oblivious RAM for Secure Computation

  Xiao Shaun Wang;Yan Huang;T-H. Hubert Chan;Abhi Shelat

  202
  Citations

• Path ORAM: An Extremely Simple Oblivious RAM Protocol

  Emil Stefanov;Marten Van Dijk;Elaine Shi;T.-H. Hubert Chan

  188
  Citations

• On Hierarchical Routing in Doubling Metrics

  T.-H. Hubert Chan;Anupam Gupta;Bruce M. Maggs;Shuheng Zhou

  174
  Citations

• Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.

  T.-H. Hubert Chan;Mingfei Li;Elaine Shi;Wenchang Xu

  116
  Citations

• Differentially private continual monitoring of heavy hitters from distributed streams

  T.-H. Hubert Chan;Mingfei Li;Elaine Shi;Wenchang Xu

  115
  Citations

• Optimal lower bound for differentially private multi-party aggregation

  T-H. Hubert Chan;Elaine Shi;Dawn Song

  101
  Citations

• Communication Complexity of Byzantine Agreement, Revisited

  Ittai Abraham;T-H. Hubert Chan;Danny Dolev;Kartik Nayak

  100
  Citations

• Finding Subgraphs with Maximum Total Density and Limited Overlap

  Oana Denisa Balalau;Francesco Bonchi;T-H. Hubert Chan;Francesco Gullo

  99
  Citations

• How to Vote Privately Using Bitcoin

  Unknown

  97
  Citations

• Private and continual release of statistics

  T.-H. Hubert Chan;Elaine Shi;Dawn Song

  91
  Citations

• A random-surfer web-graph model

  Avrim Blum;T-H. Hubert Chan;Mugizi Robert Rwebangira

  90
  Citations

• Oblivious RAM with O((log N) 3 ) Worst-Case Cost.

  Elaine Shi;T.-H. Hubert Chan;Emil Stefanov;Mingfei Li

  87
  Citations

• Large Scale Density-friendly Graph Decomposition via Convex Programming

  Unknown

  73
  Citations

• Small hop-diameter sparse spanners for doubling metrics

  T-H. Hubert Chan;Anupam Gupta

  60
  Citations

• Aggregate queries for discrete and continuous probabilistic XML

  Serge Abiteboul;T.-H. Hubert Chan;Evgeny Kharlamov;Werner Nutt

  59
  Citations