Selected work

Representative Papers

Robust and leakage-resilient device-independent oblivious transfer in MiniQCryp

Oct 01, 2026

This study addresses the robustness and leakage-resilient security challenges of device-independent oblivious transfer (DI-OT) in quantum settings. Building upon post-quantum one-way functions, it constructs DI-OT and bit commitment using only trusted classical computation to control untrusted quantum devices. The work introduces a unified protocol framework compatible with both isolated and adaptive leakage models, integrating key techniques including parallel repetition bounds for the Magic Square game, affine consistency checks, and multi-round threshold theorems. It achieves simulation-based security and sequential composition, establishing DI-completeness to support secure computation of arbitrary classical functionalities. Furthermore, the authors construct efficient simulators and DI coin flipping with abort using polynomial device complexity, yielding a provably secure general-purpose computation scheme against static corruption.

0 citationsRead paper

Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model

Oct 01, 2026

The original TLDR content provided is incomplete, containing only fragmented phrases such as "this project adopts/uses," which precludes the extraction of specific research information. To strictly satisfy the optimization requirements, a general academic template is offered for direct substitution. This work addresses the existing limitations in [core problem] by proposing [innovative method]. By introducing [key technology or module], the proposed approach effectively resolves [specific challenge]. Experimental results demonstrate that the model significantly outperforms existing baselines on [benchmark dataset], achieving an improvement of [X%] in [core metric]. The primary contributions of this study are twofold: first, it establishes a novel [framework or theory]; second, it validates the effectiveness of [specific mechanism], thereby providing new perspectives and empirical support for [related field].

0 citationsRead paper

A Hierarchy for Constant Communication Complexity

Sep 26, 2025

This paper addresses the classification of communication complexity measures, challenging the conventional asymptotic growth-based equivalence (e.g., logarithmic, polynomial) in favor of a novel paradigm grounded in “constancy”—i.e., whether a measure is bounded by a constant. Method: We define two measures as equivalent iff they are either both constant or both non-constant, and construct a bidirectional constancy-determination framework over families of Boolean functions, integrating asymptotic analysis with equivalence relation modeling. Contribution/Results: We systematically identify five mutually exclusive and collectively exhaustive constancy equivalence classes—the first such complete characterization—revealing non-intuitive intrinsic connections across distinct communication models and transcending intuitive limitations of classical hierarchy-based reasoning. This classification provides a more fundamental, structural perspective on communication complexity theory and opens new avenues for theoretical investigation.

0 citationsRead paper

Recent publications

Latest Papers

Robust and leakage-resilient device-independent oblivious transfer in MiniQCryp

Oct 01, 2026

This study addresses the robustness and leakage-resilient security challenges of device-independent oblivious transfer (DI-OT) in quantum settings. Building upon post-quantum one-way functions, it constructs DI-OT and bit commitment using only trusted classical computation to control untrusted quantum devices. The work introduces a unified protocol framework compatible with both isolated and adaptive leakage models, integrating key techniques including parallel repetition bounds for the Magic Square game, affine consistency checks, and multi-round threshold theorems. It achieves simulation-based security and sequential composition, establishing DI-completeness to support secure computation of arbitrary classical functionalities. Furthermore, the authors construct efficient simulators and DI coin flipping with abort using polynomial device complexity, yielding a provably secure general-purpose computation scheme against static corruption.

0 citationsRead paper

Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model

Oct 01, 2026

The original TLDR content provided is incomplete, containing only fragmented phrases such as "this project adopts/uses," which precludes the extraction of specific research information. To strictly satisfy the optimization requirements, a general academic template is offered for direct substitution. This work addresses the existing limitations in [core problem] by proposing [innovative method]. By introducing [key technology or module], the proposed approach effectively resolves [specific challenge]. Experimental results demonstrate that the model significantly outperforms existing baselines on [benchmark dataset], achieving an improvement of [X%] in [core metric]. The primary contributions of this study are twofold: first, it establishes a novel [framework or theory]; second, it validates the effectiveness of [specific mechanism], thereby providing new perspectives and empirical support for [related field].

0 citationsRead paper

A Hierarchy for Constant Communication Complexity

Sep 26, 2025

This paper addresses the classification of communication complexity measures, challenging the conventional asymptotic growth-based equivalence (e.g., logarithmic, polynomial) in favor of a novel paradigm grounded in “constancy”—i.e., whether a measure is bounded by a constant. Method: We define two measures as equivalent iff they are either both constant or both non-constant, and construct a bidirectional constancy-determination framework over families of Boolean functions, integrating asymptotic analysis with equivalence relation modeling. Contribution/Results: We systematically identify five mutually exclusive and collectively exhaustive constancy equivalence classes—the first such complete characterization—revealing non-intuitive intrinsic connections across distinct communication models and transcending intuitive limitations of classical hierarchy-based reasoning. This classification provides a more fundamental, structural perspective on communication complexity theory and opens new avenues for theoretical investigation.

0 citationsRead paper