activity
20052026
most citedThe Communication Complexity of the Hamming Distance Problem

57 citations · 74 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CR2026

FESC: Remodeling Long-Context Private Inference with Encrypted State-Space Models

Yufan Zhu, Chao Jin, Khin Mi Mi Aung +1

Processing long, sensitive documents with machine-learning models requires efficient, privacy-preserving long-context inference. Prior private inference systems optimize or distrib…

cs.CR2026

Implicit Identity Technologies for LLMs: Fingerprinting and Watermarking across Datasets, Models, and Generated Content

Bing Liu, Shunping Wang, Yufan Zhu +5

This paper presents a survey and taxonomy of LLM fingerprinting and watermarking for identity, ownership verification, provenance, and generated-content attribution. Large language…

cs.CR2026

EncFormer: Secure and Efficient Transformer Inference over Encrypted Data

Yufan Zhu, Chao Jin, Khin Mi Mi Aung +1

Transformer inference in machine-learning-as-a-service (MLaaS) raises privacy concerns for sensitive user inputs. Prior secure solutions that combine fully homomorphic encryption (…

quant-ph2007★ 6 cited

Quantum communication complexity of block-composed functions

Yaoyun Shi, Yufan Zhu

A major open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical protocols on _total_ Boolean functions in th…

quant-ph2005★ 11 cited

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

Yaoyun Shi, Yufan Zhu

We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive genera…

quant-ph2005★ 57 cited

The Communication Complexity of the Hamming Distance Problem

Wei Huang, Yaoyun Shi, Shengyu Zhang +1

We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no le…