T.-H. Hubert Chan

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 119

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

SODA

ACM Trans. Algorithms

Publications

T.-H. Hubert Chan, Quan Xue
Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition. CoRR (2024)
T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
Fully Dynamic Algorithms for Euclidean Steiner Tree. WALCOM (2024)
Yajing Zhi, Lanfang Kong, Samed Atouati, T.-H. Hubert Chan, Mauro Sozio
Explaining Cryptocurrency Price Trends: Statistical Analysis of Social Media Posts vs Market Prices. CACML (2024)
T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
Max-min greedy matching problem: Hardness for the adversary and fractional variant. Theor. Comput. Sci. 986 (2024)
T.-H. Hubert Chan, Ke Wu, Elaine Shi
Mechanism Design for Automated Market Makers. CoRR (2024)
Oana Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio, Hao Xie
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. ACM Trans. Knowl. Discov. Data 18 (4) (2024)
T.-H. Hubert Chan, Hao Xie, Mengshi Zhao
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions. AAAI (2024)
T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang
Fully Dynamic k-Center Clustering with Outliers. Algorithmica 86 (1) (2024)
Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi
Advanced Composition Theorems for Differential Obliviousness. ITCS (2024)
T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
Fully Dynamic Algorithms for Euclidean Steiner Tree. CoRR (2023)
T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem. ACNS (2023)
T.-H. Hubert Chan, Ting Wen, Hao Xie, Quan Xue
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem. CoRR (2023)
T.-H. Hubert Chan, Enze Sun, Bo Wang
Generalized Sorting with Predictions Revisited. IJTCS-FAW (2023)
Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon
A Theory of Composition for Differential Obliviousness. EUROCRYPT (3) (2023)
T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant. IJTCS-FAW (2023)
Pui-Wai Ma, T.-H. Hubert Chan
A feedforward unitary equivariant neural network. Neural Networks 161 (2023)
Yajing Zhi, T.-H. Hubert Chan
Clustering Social Media Data for Bitcoin Price Prediction with Transformer Model. MLNLP (2023)
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Communication complexity of byzantine agreement, revisited. Distributed Comput. 36 (1) (2023)
Mingxun Zhou, Mengshi Zhao, T.-H. Hubert Chan, Elaine Shi
Advanced Composition Theorems for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2023 (2023)
T.-H. Hubert Chan, Hao Xie, Mengshi Zhao
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions. CoRR (2023)
T.-H. Hubert Chan, Arnaud Guerquin, Shuguang Hu, Mauro Sozio
Fully Dynamic $k$k-Center Clustering With Improved Memory Efficiency. IEEE Trans. Knowl. Data Eng. 34 (7) (2022)
Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi
Locally Differentially Private Sparse Vector Aggregation. IEEE Symposium on Security and Privacy (2022)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Locality-Preserving Oblivious RAM. J. Cryptol. 35 (2) (2022)
Xusheng Chen, Shixiong Zhao, Ji Qi, Jianyu Jiang, Haoze Song, Cheng Wang, Tsz On Li, T.-H. Hubert Chan, Fengwei Zhang, Xiapu Luo, Sen Wang, Gong Zhang, Heming Cui
Efficient and DoS-resistant Consensus for Permissioned Blockchains. SIGMETRICS Perform. Evaluation Rev. 49 (3) (2022)
Pui-Wai Ma, T.-H. Hubert Chan
A Feedforward Unitary Equivariant Neural Network. CoRR (2022)
T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi
Foundations of Differentially Oblivious Algorithms. J. ACM 69 (4) (2022)
Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search. ACM Trans. Knowl. Discov. Data 16 (2) (2022)
T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang
Fully Dynamic k-Center Clustering with Outliers. COCOON (2022)
Xusheng Chen, Shixiong Zhao, Ji Qi, Jianyu Jiang, Haoze Song, Cheng Wang, Tsz On Li, T.-H. Hubert Chan, Fengwei Zhang, Xiapu Luo, Sen Wang, Gong Zhang, Heming Cui
Efficient and DoS-resistant Consensus for Permissioned Blockchains. Perform. Evaluation 153 (2022)
Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon
A Theory of Composition for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2022 (2022)
T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. ITC (2021)
Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi
Locally Differentially Private Sparse Vector Aggregation. CoRR (2021)
Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. ITC (2021)
T.-H. Hubert Chan, Chui Shan Lee
-Budget on Varying Susceptibility to Persuasion. CoRR (2021)
T.-H. Hubert Chan, Mauro Sozio, Bintao Sun
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier. J. Parallel Distributed Comput. 147 (2021)
Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election. CRYPTO (2) (2021)
T.-H. Hubert Chan, Chui Shan Lee
-Budget on Varying Susceptibility to Persuasion. COCOON (2021)
Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2021 (2021)
Rediet Abebe, T.-H. Hubert Chan, Jon M. Kleinberg, Zhibin Liang, David C. Parkes, Mauro Sozio, Charalampos E. Tsourakakis
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. CoRR (2020)
T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. SODA (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR (2020)
T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ACM Trans. Algorithms 16 (2) (2020)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Sublinear-Round Byzantine Agreement Under Corrupt Majority. Public Key Cryptography (2) (2020)
T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi
N/ log log N) Overhead. IACR Cryptol. ePrint Arch. 2020 (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA (2020)
Bintao Sun, T.-H. Hubert Chan, Mauro Sozio
Fully Dynamic Approximate k-Core Decomposition in Hypergraphs. ACM Trans. Knowl. Discov. Data 14 (4) (2020)
T.-H. Hubert Chan, Naomi Ephraim, Antonio Marcedone, Andrew Morgan, Rafael Pass, Elaine Shi
Blockchain with Varying Number of Players. IACR Cryptol. ePrint Arch. 2020 (2020)
T.-H. Hubert Chan, Zhibin Liang
Generalizing the hypergraph Laplacian via a diffusion process with mediators. Theor. Comput. Sci. 806 (2020)
T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. IACR Cryptol. ePrint Arch. 2020 (2020)
T.-H. Hubert Chan, Fei Chen, Li Ning
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism. Theory Comput. Syst. 64 (6) (2020)
T.-H. Hubert Chan, Li Ning, Yong Zhang
Influence Maximization Under the Non-progressive Linear Threshold Model. FAW (2020)
Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass. IEEE Trans. Knowl. Data Eng. 32 (3) (2020)
T.-H. Hubert Chan, Li Ning, Yong Zhang
Maximizing the Expected Influence in Face of the Non-progressive Adversary. WASA (1) (2020)
T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. ITCS (2020)
Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions. IACR Cryptol. ePrint Arch. 2020 (2020)
Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. Proc. VLDB Endow. 13 (10) (2020)
T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi
Foundations of Differentially Oblivious Algorithms. SODA (2019)
T.-H. Hubert Chan, Mauro Sozio, Bintao Sun
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier. IPDPS (2019)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Locality-Preserving Oblivious RAM. EUROCRYPT (2) (2019)
T.-H. Hubert Chan, Zhibin Liang, Mauro Sozio
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search. WWW (2019)
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Communication Complexity of Byzantine Agreement, Revisited. PODC (2019)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Consensus Through Herding. EUROCRYPT (1) (2019)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Round Complexity of Byzantine Agreement, Revisited. IACR Cryptol. ePrint Arch. 2019 (2019)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Consensus through Herding. IACR Cryptol. ePrint Arch. 2019 (2019)
T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. CoRR (2019)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
Diffusion operator and spectral analysis for directed hypergraph Laplacian. Theor. Comput. Sci. 784 (2019)
T.-H. Hubert Chan, Kartik Nayak, Elaine Shi
Perfectly Secure Oblivious Parallel RAM. TCC (2) (2018)
T.-H. Hubert Chan, Arnaud Guerqin, Mauro Sozio
-Center Clustering. WWW (2018)
T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ESA (2018)
T.-H. Hubert Chan, Kartik Nayak, Elaine Shi
Perfectly Secure Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2018 (2018)
T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting. ASIACRYPT (3) (2018)
T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. IACR Cryptol. ePrint Arch. 2018 (2018)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Communication-Efficient Byzantine Agreement without Erasures. CoRR (2018)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. Algorithmica 80 (7) (2018)
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
Online Submodular Maximization with Free Disposal. ACM Trans. Algorithms 14 (4) (2018)
Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas
Path ORAM: An Extremely Simple Oblivious RAM Protocol. J. ACM 65 (4) (2018)
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
Cache-Oblivious and Data-Oblivious Sorting and Applications. SODA (2018)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
PaLa: A Simple Partially Synchronous Blockchain. IACR Cryptol. ePrint Arch. 2018 (2018)
T.-H. Hubert Chan, Shaofeng H.-C. Jiang
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. ACM Trans. Algorithms 14 (1) (2018)
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. J. ACM 65 (3) (2018)
T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. CoRR (2018)
T.-H. Hubert Chan, Zhibin Liang
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. CoRR (2018)
T.-H. Hubert Chan, Bintao Sun
An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. CoRR (2018)
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming. SIAM J. Comput. 47 (4) (2018)
T.-H. Hubert Chan, Bintao Sun
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. COCOON (2018)
T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang
A PTAS for the Steiner Forest Problem in Doubling Metrics. SIAM J. Comput. 47 (4) (2018)
T.-H. Hubert Chan, Zhibin Liang
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. COCOON (2018)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
PiLi: An Extremely Simple Synchronous Blockchain. IACR Cryptol. ePrint Arch. 2018 (2018)
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity. ACM Trans. Algorithms 14 (2) (2018)
T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi
Foundations of Differentially Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2017 (2017)
Zhichao Zhao, Fei Chen, T.-H. Hubert Chan, Chuan Wu
Double Auction for Resource Allocation in Cloud Computing. CLOSER (2017)
T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi
On the Depth of Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2017 (2017)
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
Online Submodular Maximization Problem with Vector Packing Constraint. ESA (2017)
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. IACR Cryptol. ePrint Arch. 2017 (2017)
T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi
On the Depth of Oblivious Parallel RAM. ASIACRYPT (1) (2017)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian. CoRR (2017)
Shuguang Hu, Xiaowei Wu, T.-H. Hubert Chan
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs. CIKM (2017)
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. SODA (2017)
T.-H. Hubert Chan, Elaine Shi
Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. TCC (2) (2017)
T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi
Cache-Oblivious and Data-Oblivious Sorting and Applications. IACR Cryptol. ePrint Arch. 2017 (2017)

T.-H. Hubert Chan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

T.-H. Hubert Chan