T.-H. Hubert Chan

According to our database1, T.-H. Hubert Chan authored at least 118 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Consensus through Herding.
IACR Cryptology ePrint Archive, 2019

Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search.
Proceedings of the World Wide Web Conference, 2019

Foundations of Differentially Oblivious Algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Consensus Through Herding.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Locality-Preserving Oblivious RAM.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
ACM Trans. Algorithms, 2018

Online Submodular Maximization with Free Disposal.
ACM Trans. Algorithms, 2018

Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity.
ACM Trans. Algorithms, 2018

A PTAS for the Steiner Forest Problem in Doubling Metrics.
SIAM J. Comput., 2018

Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming.
SIAM J. Comput., 2018

Path ORAM: An Extremely Simple Oblivious RAM Protocol.
J. ACM, 2018

Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
J. ACM, 2018

PaLa: A Simple Partially Synchronous Blockchain.
IACR Cryptology ePrint Archive, 2018

PiLi: An Extremely Simple Synchronous Blockchain.
IACR Cryptology ePrint Archive, 2018

Perfectly Secure Oblivious Parallel RAM.
IACR Cryptology ePrint Archive, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
IACR Cryptology ePrint Archive, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
CoRR, 2018

Communication-Efficient Byzantine Agreement without Erasures.
CoRR, 2018

An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
CoRR, 2018

Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators.
CoRR, 2018

On (1,ϵ)-Restricted Max-Min Fair Allocation Problem.
Algorithmica, 2018

Fully Dynamic k-Center Clustering.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Perfectly Secure Oblivious Parallel RAM.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Cache-Oblivious and Data-Oblivious Sorting and Applications.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Distributed Private Data Analysis: Lower Bounds and Practical Constructions.
ACM Trans. Algorithms, 2017

Finding k most influential edges on flow graphs.
Inf. Syst., 2017

Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.
IACR Cryptology ePrint Archive, 2017

Cache-Oblivious and Data-Oblivious Sorting and Applications.
IACR Cryptology ePrint Archive, 2017

On the Depth of Oblivious Parallel RAM.
IACR Cryptology ePrint Archive, 2017

Foundations of Differentially Oblivious Algorithms.
IACR Cryptology ePrint Archive, 2017

Oblivious Computation with Data Locality.
IACR Cryptology ePrint Archive, 2017

Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian.
CoRR, 2017

A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
CoRR, 2017

Online Submodular Maximization Problem with Vector Packing Constraint.
CoRR, 2017

Large Scale Density-friendly Graph Decomposition via Convex Programming.
Proceedings of the 26th International Conference on World Wide Web, 2017

Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method.
Proceedings of the 34th International Conference on Machine Learning, 2017

Online Submodular Maximization Problem with Vector Packing Constraint.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Double Auction for Resource Allocation in Cloud Computing.
Proceedings of the CLOSER 2017, 2017

Maintaining Densest Subsets Efficiently in Evolving Hypergraphs.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

On the Depth of Oblivious Parallel RAM.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
On Hierarchical Routing in Doubling Metrics.
ACM Trans. Algorithms, 2016

Circuit OPRAM: A (Somewhat) Tight Oblivious Parallel RAM.
IACR Cryptology ePrint Archive, 2016

On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem.
CoRR, 2016

Spectral Properties of Hypergraph Laplacian and Approximation Algorithms.
CoRR, 2016

Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR, 2016

A PTAS for the Steiner Forest Problem in Doubling Metrics.
CoRR, 2016

Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A PTAS for the Steiner Forest Problem in Doubling Metrics.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Beating Ratio 0.5 for Weighted Oblivious Matching Problems.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
New Doubling Spanners: Better and Simpler.
SIAM J. Comput., 2015

How to Vote Privately Using Bitcoin.
IACR Cryptology ePrint Archive, 2015

How to Use SNARKs in Universally Composable Protocols.
IACR Cryptology ePrint Archive, 2015

Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs.
CoRR, 2015

Influence Maximization under The Non-progressive Linear Threshold Model.
CoRR, 2015

Online Convex Covering and Packing Problems.
CoRR, 2015

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree.
Algorithmica, 2015

Finding Subgraphs with Maximum Total Density and Limited Overlap.
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

How to Vote Privately Using Bitcoin.
Proceedings of the Information and Communications Security - 17th International Conference, 2015

Dynamic Tree Shortcut with Constant Degree.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Cheeger Inequalities for General Edge-Weighted Directed Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

On the Complexity of the Minimum Independent Set Partition Problem.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Fast Convergence for Consensus in Dynamic Networks.
ACM Trans. Algorithms, 2014

SCORAM: Oblivious RAM for Secure Computation.
IACR Cryptology ePrint Archive, 2014

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.
IACR Cryptology ePrint Archive, 2014

An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function.
Algorithmica, 2014

Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

An incentive protocol for distributed dynamic P2P video-on-demand streaming.
Proceedings of the 23rd International Conference on Computer Communication and Networks, 2014

Oblivious Data Structures.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

SCORAM: Oblivious RAM for Secure Computation.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.
CoRR, 2013

A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem.
CoRR, 2013

New Doubling Spanners: Better and Simpler.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Approximating TSP on Metrics with Bounded Global Growth.
SIAM J. Comput., 2012

Optimal Lower Bound for Differentially Private Multi-Party Aggregation.
IACR Cryptology ePrint Archive, 2012

Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.
IACR Cryptology ePrint Archive, 2012

Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics
CoRR, 2012

Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.
Proceedings of the Privacy Enhancing Technologies - 12th International Symposium, 2012

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Privacy-Preserving Stream Aggregation with Fault Tolerance.
Proceedings of the Financial Cryptography and Data Security, 2012

Optimal Lower Bound for Differentially Private Multi-party Aggregation.
Proceedings of the Algorithms - ESA 2012, 2012

Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Capturing continuous data and answering aggregate queries in probabilistic XML.
ACM Trans. Database Syst., 2011

Private and Continual Release of Statistics.
ACM Trans. Inf. Syst. Secur., 2011

Oblivious RAM with O((log N)3) Worst-Case Cost.
IACR Cryptology ePrint Archive, 2011

Privacy-Preserving Stream Aggregation with Fault Tolerance.
IACR Cryptology ePrint Archive, 2011

A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
Discrete & Computational Geometry, 2011

Privacy-Preserving Aggregation of Time-Series Data.
Proceedings of the Network and Distributed System Security Symposium, 2011

Fast Convergence for Consensus in Dynamic Networks.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Oblivious RAM with O((logN)3) Worst-Case Cost.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Ultra-low-dimensional embeddings for doubling metrics.
J. ACM, 2010

Private and Continual Release of Statistics.
IACR Cryptology ePrint Archive, 2010

A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Aggregate queries for discrete and continuous probabilistic XML.
Proceedings of the Database Theory, 2010

Private and Continual Release of Statistics.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Metric Embeddings with Relaxed Guarantees.
SIAM J. Comput., 2009

Small Hop-diameter Sparse Spanners for Doubling Metrics.
Discrete & Computational Geometry, 2009

An SDP primal-dual algorithm for approximating the Lovász-theta function.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Ultra-low-dimensional embeddings for doubling metrics.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Approximating TSP on metrics with bounded global growth.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
A Theory of Loss-Leaders: Making Money by Pricing Below Cost.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Multi-Dimensional Range Query over Encrypted Data.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

2006
Small hop-diameter sparse spanners for doubling metrics.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Spanners with Slack.
Proceedings of the Algorithms, 2006

A Tight Lower Bound for the Steiner Point Removal Problem on Trees.
Proceedings of the Approximation, 2006

A Random-Surfer Web-Graph Model.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005
On hierarchical routing in doubling metrics.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Metric Embeddings with Relaxed Guarantees.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005


  Loading...