Power Adjusting Games Under Block-Dependent Pool Payout Schemes
Advanced power adjusting block withholding attacks such as PAW and T-PAW have been analyzed so far under a global-reset
#cs.IT
共收录 102 条相关情报。
← 返回所有主题Improved LCL Equivalences and Curve Decoding Alphabet Sizes
Local Coordinate-wise Linear (LCL) properties, introduced by Levi, Mosheiff, and Shagrithaya (2025), capture coding-theo
A Simple Presentation of Robust Membership Inference Attacks
In a membership inference attack, an attacker is given the data of a particular individual, and tries to determine if th
Information-Theoretic Secure Aggregation With Heterogeneous Client Quantization
In federated learning (FL), secure aggregation enables a server to compute the sum of local model updates of $N$ clients
Maximum-Likelihood Decoding of Gabidulin Codes Is NP-Hard Even in Dimension One
Fix a prime power q. We prove that deciding whether a received word y in Fnqm lies at rank distance at most n-2 from the
SILMARILS-MV: Information-Theoretically Secure Multi-Verifier Signatures with Dealer-Free Key Issuance and Linear Aggregation for Permissioned Blockchains
Permissioned blockchains authenticate transactions, votes and quorum certificates with computationally secure signatures
Homomorphic Encryption with Coset Code Construction
Homomorphic encryption enables computation on input data without decrypting it. This paper extends a construction based
On the Adversarial Vulnerability of Neural Receivers with Unrolled LDPC Decoders
Neural receivers for 5G New Radio (NR) match classical model-based receivers in link-level performance, but their robust
PQ-Vault: Provably Quantum-Safe Asset Custody for Unmodified Ethereum
A quantum computer could recover the key of any Ethereum account whose public key appears on chain. We prove that no sid
Diffusion Sensitivity Geometry and Strong Duality for Optimal Privacy-Utility Tradeoffs
Existing approaches to differential privacy in diffusion models rely on loose sensitivity bounds and isotropic Gaussian
Big Secrets Small Shares: Revisiting Secure Multi-Party Computation
At CRYPTO 2007, Damgård and Nielsen introduced a preprocessing approach to multi-party computation (MPC) to achieve line
DM-RSA-OAEP: Formal Treatment of a Dual-Modulus Fault-Detection Countermeasure Based on Physical Diversity
We revisit DM-RSA, an RSA variant that uses two independent moduli, whose original version was broken by Håstad's attack
Fundamental Limits of Information-Theoretic Secure Aggregation with User Dropouts in Federated Learning
Secure aggregation enables a server to compute the sum of users' gradients or model updates without revealing individual
Private Evaluation of High-Dimensional Functions
We study differentially private black-box evaluation of arbitrary high-dimensional functions. Given a dataset $S$ and qu
Explicit reduced APN permutations: ramification and optimal Galois-ring lifts
Let $m\ge5$ be odd and $q=2^m$. For every odd $r$ with $3\le r<m$ and $\gcd(r,m)=1$ we give the reduced polynomial $P_{m
Optimal Reduced Representatives of Quadratic APN Permutations in Odd Dimension
The formal derivative of the reduced polynomial representative of a map on a binary finite field depends on the coordina
Efficient Agnostic Learning of Univariate Densities Under Local Differential Privacy
We propose a general framework for non-interactive locally differentially private (LDP) learning of structured univariat
Bilinear Compressive Security with Finitely Many Samples
Bilinear Compressive Security (BCS) is a lightweight encryption scheme that combines compressed sensing with a fresh ran
Global and Local Entropy Tests for STL Files Under IEEE-754 Validity Constraints
Shannon entropy is a standard measure of ciphertext randomness, evaluated either globally over the byte histogram of the
Dynamic Attack Surfaces: A Queue of Branching Processes
Modern attack surfaces are inherently dynamic. Vulnerabilities emerge over time and they remain exposed to exploit until