This paper develops a runtime recovery framework for broadcasting in dense Gaussian networks under static and dynamic faults, proving necessary and sufficient repair edges and providing efficient repa…

The paper introduces a topology-hiding connectivity assurance protocol that allows network providers to cryptographically prove the existence of a secure connection in QKD networks without revealing t…

This paper proves lower bounds for the size of multiplicative graph spanners in the $f$-degree fault tolerant model, matching previous conditional lower bounds and current upper bounds.

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

The paper proposes a provably secure path validation protocol for large-scale Quantum Key Distribution (QKD) networks that allows receivers to verify network compliance without revealing sensitive top…

The paper addresses secure distributed hypothesis testing, proving impossibility in the standard setting and achieving secure testing for simple and general classes by incorporating a shared secret ke…

The paper presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.

This paper introduces a new distance measure between graph states and shows its applications to graph edit-distance problems, including the ancilla integrity problem.

This paper studies the depth required for a graph neural network on a sparse graph using the contextual stochastic block model, and proves that the error is governed by the Kesten-Stigum ratio.

The paper introduces local private information retrieval (local PIR), redefining user privacy in graph-replicated systems to focus on hiding the message index from servers, and demonstrates that local…

The paper uses majorization theory to analyze lattice reduction, showing that local swaps smooth the Gram-Schmidt profile and deriving variational and telescoping identities for the worst-case profile…

This paper quantifies the latency impact of increasing certificate chain sizes required by Post-Quantum Cryptography (PQC) on TLS Time to First Byte (TTFB), finding that Merkle Tree Certificates (MTC)…

This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…