Optimal Untelegraphable Encryption and Implications for Uncloneable Encryption

We investigate the notion of untelegraphable encryption UTE, a quantum encryption primitive that is a special case of uncloneable encryption UE, where the adversary's capabilities are restricted to producing purely classical information rather than arbitrary quantum states. We present an...

udisks2 security update

2.9.0-16.1 - udiskslinuxmanager: Add lower bounds check to fdindex CVE-2025-8067 RHEL-109408...

Oracle Linux 9 : udisks2 (ELSA-2025-15018)

The remote Oracle Linux 9 host has packages installed that are affected by a vulnerability as referenced in the ELSA-2025-15018 advisory. - udiskslinuxmanager: Add lower bounds check to fdindex CVE-2025-8067 RHEL-109417 Tenable has extracted the preceding description block directly from the Oracl...

The Cost of Restaking Vs. Proof-Of-Stake

We compare the efficiency of restaking and Proof-of-Stake PoS protocols in terms of stake requirements. First, we consider the sufficient condition for the restaking graph to be secure. We show that the condition implies that it is always possible to transform such a restaking graph into secure P...

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage

In this paper, we study the problem of private information retrieval PIR in both graph-based and multigraph-based replication systems, where each file is stored on exactly two servers, and any pair of servers shares at most $r$ files. We derive upper bounds on the PIR capacity for such systems an...

On the Price of Differential Privacy for Hierarchical Clustering

Hierarchical clustering is a fundamental unsupervised machine learning task with the aim of organizing data into a hierarchy of clusters. Many applications of hierarchical clustering involve sensitive user information, therefore motivating recent studies on differentially private hierarchical...