Algorithms for comparison in residue number systems. - Hanshen Xiao; Yu Ye 001; Guoqiang Xiao 001; Qin Kang (APSIPA, 2016)

Symmetric polynomial & CRT based algorithms for multiple frequency determination from undersampled waveforms. - Hanshen Xiao; Cas Cremers; Hari Krishna Garg (GlobalSIP, 2016)

New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations. - Hari Krishna Garg; Hanshen Xiao (IEEE Access, 2016)

A Rotation-Aided Arctangent Phase Discriminator With One-Bit Quantization. - Yu Ye 001; Hanshen Xiao; Guoqiang Xiao 001 (IEEE Signal Process. Lett., 2016)

New residue arithmetic based Barrett algorithms: Modular polynomial computations. - Hari Krishna Garg; Hanshen Xiao (ICASSP, 2017)

Robustness in Chinese Remainder Theorem. - Hanshen Xiao; Yufeng Huang; Yu Ye 001; Guoqiang Xiao 001 (CoRR, 2017)

On Iterative Collision Search for LPN and Subset Sum. - Srinivas Devadas; Ling Ren 001; Hanshen Xiao (IACR Cryptol. ePrint Arch., 2017)

Notes on CRT-based robust frequency estimation. - Hanshen Xiao; Guoqiang Xiao 001 (Signal Process., 2017)

Statistical Robust Chinese Remainder Theorem for Multiple Numbers: Wrapped Gaussian Mixture Model. - Nan Du; Zhikang Wang; Hanshen Xiao (CoRR, 2018)

Robustness in Chinese Remainder Theorem for Multiple Numbers and Remainder Coding. - Hanshen Xiao; Yufeng Huang; Yu Ye 001; Guoqiang Xiao 001 (IEEE Trans. Signal Process., 2018)

On Privacy-preserving Decentralized Optimization through Alternating Direction Method of Multipliers. - Hanshen Xiao; Ye Yu; Srini Devadas (CoRR, 2019)

On Solving Ambiguity Resolution With Robust Chinese Remainder Theorem for Multiple Numbers. - Hanshen Xiao; Guoqiang Xiao 001 (IEEE Trans. Veh. Technol., 2019)

A Framework of Topology-Transparent Scheduling Based on Polynomial Ring. - Hanshen Xiao; Guoqiang Xiao 001 (IEEE Wirel. Commun. Lett., 2019)

On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data. - Di Wang 015; Hanshen Xiao; Srinivas Devadas; Jinhui Xu 001 (ICML, 2020)

Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions. - Jun Wan 008; Hanshen Xiao; Srinivas Devadas; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

On the Foundation of Sparse Sensing (Part I): Necessary and Sufficient Sampling Theory and Robust Remaindering Problem. - Hanshen Xiao; Yaowen Zhang; Guoqiang Xiao 001 (CoRR, 2021)

On the Foundation of Sparse Sensing (Part II): Diophantine Sampling and Array Configuration. - Hanshen Xiao; Beining Zhou; Guoqiang Xiao 001 (CoRR, 2021)

DAUnTLeSS: Data Augmentation and Uniform Transformation for Learning with Scalability and Security. - Hanshen Xiao; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2021)

The Art of Labeling: Task Augmentation for Private(Collaborative) Learning on Transformed Data. - Hanshen Xiao; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2021)

Towards Understanding Practical Randomness Beyond Noise: Differential Privacy and Mixup. - Hanshen Xiao; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2021)

Wrapped ambiguity Gaussian mixed model with applications in sparse sampling based multiple parameter estimation. - Hanshen Xiao; Nan Du; Zhikang Wang; Guoqiang Xiao 001 (Signal Process., 2021)

High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data. - Lijie Hu; Shuo Ni; Hanshen Xiao; Di Wang 015 (PODS, 2022)

PAC Security: Automatic Privacy Measurement and Control of Data Processing. - Hanshen Xiao; Srinivas Devadas (CoRR, 2022)

Differentially Private Deep Learning with ModelMix. - Hanshen Xiao; Jun Wan 008; Srinivas Devadas (CoRR, 2022)

Geometry of Sensitivity: Twice Sampling and Hybrid Clipping in Differential Privacy with Optimal Gaussian Noise and Application to Deep Learning. - Hanshen Xiao; Jun Wan 008; Srinivas Devadas (CCS, 2023)

PAC Privacy: Automatic Privacy Measurement and Control of Data Processing. - Hanshen Xiao; Srinivas Devadas (CRYPTO (2), 2023)

A Theory to Instruct Differentially-Private Learning via Clipping Bias Reduction. - Hanshen Xiao; Zihang Xiang; Di Wang 015; Srinivas Devadas (SP, 2023)

On the Foundation of Sparsity Constrained Sensing - Part I: Sampling Theory and Robust Remainder Problem. - Hanshen Xiao; Yaowen Zhang; Beining Zhou; Guoqiang Xiao 001 (IEEE Trans. Signal Process., 2023)

On the Foundation of Sparsity Constrained Sensing - Part II: Diophantine Sampling With Arbitrary Temporal and Spatial Sparsity. - Hanshen Xiao; Beining Zhou; Yaowen Zhang; Guoqiang Xiao 001 (IEEE Trans. Signal Process., 2023)

Formal Privacy Proof of Data Encoding: The Possibility and Impossibility of Learnable Encryption. - Hanshen Xiao; G. Edward Suh; Srinivas Devadas (CCS, 2024)

Online Robust Mean Estimation. - Daniel M. Kane; Ilias Diakonikolas; Hanshen Xiao; Sihan Liu (SODA, 2024)

PAC-Private Algorithms. - Mayuri Sridhar; Hanshen Xiao; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2024)

Automated Profile Inference with Language Model Agents. - Yuntao Du 002; Zitao Li; Bolin Ding; Yaliang Li; Hanshen Xiao; Jingren Zhou 001; Ninghui Li (CoRR, 2025)

Cascading and Proxy Membership Inference Attacks. - Yuntao Du 002; Jiacheng Li; Yuetian Chen; Kaiyuan Zhang 002; Zhizhen Yuan; Hanshen Xiao; Bruno Ribeiro 001; Ninghui Li (CoRR, 2025)

Expected Constant Round Byzantine Broadcast under Dishonest Majority. - Jun Wan 008; Hanshen Xiao; Elaine Shi; Srinivas Devadas (J. ACM, 2025)