arXiv subjects

Baigang Chen

Publications and source records attributed to Baigang Chen.

3 recordsLinked to original sources

arXiv2026

G-Lox: Group-Adaptive, Privacy-Preserving Bridge Distribution with Two-Party Computation

We present G-Lox (group-adaptive Lox), a bridge-distribution system that preserves Lox-style distributor blindness while enabling hidden, stateful group-level adaptation. G-Lox places adaptive assignment logic behind a two-server privacy wall, so no single server learns group identifiers or group-to-bridge assignments. Private state access and state-dependent updates use two-server DPF/FSS protocols and secure two-party computation, supporting blockage reporting, transport-aware reassignment, and privacy-preserving group splitting. We evaluate G-Lox through system measurements and policy simulation. In our C++/EMP implementation over real TCP sockets, private state access has low client-visible overhead: across state sizes up to 2^16, communication remains in the low-KiB range per iteration. At M=1024, the client sends 1,968 bytes, receives 1,280 bytes, and completes an iteration in about 0.25 s. Simulations with group-specific blocking and Sybil enumeration show that G-Lox improves robustness over Lox- and rBridge-like baselines among systems that maintain broad issuance.

cs.CR↗

arXiv2026

Reliable Non-Leveled Homomorphic Encryption for Web Services

With the ubiquitous deployment of web services, ensuring data confidentiality has become a challenging imperative. Fully Homomorphic Encryption (FHE) presents a powerful solution for processing encrypted data; however, its widespread adoption is severely constrained by two fundamental bottlenecks: substantial computational overhead and the absence of a built-in automatic error correction mechanism. These limitations render the deployment of FHE in real-world, complex network environments impractical. To address this dual challenge, this work puts forward a new FHE framework that enhances computational efficiency and integrates an automatic error correction capability through new encoding techniques and an algebraic reliability layer.Our prototype is evaluated through encrypted low-degree activation timing, one experimental public Refresh skeleton invocation, and transport-fault simulations for the Ring--BCH layer. Our current prototype quantifies the cost of encrypted low-degree activation evaluation, the additional latency of an experimental public Refresh skeleton, and the robustness gained from the Ring--BCH transport layer. The Refresh prototype should be interpreted as a skeleton rather than a complete CKKS bootstrapping implementation, since it uses a low-degree surrogate rather than a validated EvalMod circuit. In transport-fault simulations, the BCH interleaver reduces failure rates to below $0.5\%$ under bursty faults and keeps the modeled accuracy within $0.5$ percentage points of the plaintext baseline.

cs.CR↗

arXiv2025

Structure-Preserving Error-Correcting Codes for Polynomial Frames

Modern FFT/NTT analytics, coded computation, and privacy-preserving ML interface routinely move polynomial frames across NICs, storage, and accelerators. However, even rare silent data corruption (SDC) can flip a few ring coefficients and cascade through downstream arithmetic. Conventional defenses are ill-matched to current low-latency pipelines: detect-and-retransmit adds RTTs, while byte-stream ECC ignores the algebraic structure and forces format conversions. To that end, we propose a structure-preserving reliability layer that operates in the encoded data's original polynomial ring, adds a small amount of systematic redundancy, and corrects symbol errors/flagged erasures without round-trip or format changes. We construct two complementary schemes: one for odd length $N_{odd}$ via a Hensel-lifted BCH ideal with an idempotent encoder, and one for power-of-two length $N_{2^m}$ via a repeated-root negacyclic code with derivative-style decoding. In particular, to stay robust against clustered errors, a ring automorphism provides in-place interleaving to disperse bursts. Implementation wise, on four frame sizes $N\!=\!1024, 2048, 4096, 8192$, we meet a per-frame failure target of $10^{-9}$ at symbol error rates $10^{-6}\text{--}10^{-5}$ with $t\!=\!8\text{--}9$, incurring only $0.20\%\text{--}1.56\%$ overhead and tolerating $\sim\!32\text{--}72$\,B unknown-error bursts (roughly doubled when flagged as erasures) after interleaving. By aligning error correction with ring semantics, we take a practical step toward deployable robustness for polynomial-frame computations from an algebraic coding perspective.

cs.IT↗