Headlines pulled automatically from NIST, IACR, and trusted security news outlets, refreshed every few hours. Titles and excerpts only — click through to read the full story at the original source.
Secret sharing protects a secret against coalitions below the reconstruction threshold, but it does not stop participants from selling their shares. Traceable secret sharing (TSS) holds participants accountable for such leakage: when a coalition packages its shares into a leaked program, called a reconstruction box, that recovers the secret given enough additional shares, a tracer can identify th…
The XTS-AES mode is widely deployed to provide storage encryption in embedded systems, where hardware accelerators are commonly used to protect sensitive firmware stored in external flash. Existing side-channel attacks against XTS-AES typically assume access to operation-level leakage, requiring precise segmentation of individual AES executions or exploiting implementation-specific temporal struc…
Function secret sharing (FSS) enables local evaluation of secret-shared functions and is an important building block for efficient secure computation, particularly for comparisons and private lookups. However, conventional tree-based distributed point functions (DPFs) and distributed comparison functions (DCFs) incur sequential dependencies during key generation and require $O(n\lambda)$-bit keys…
Falcon was selected by NIST for standardization as FN-DSA in the forthcoming FIPS 206, and its signature generation is driven by the fast Fourier sampler, defined over the complex numbers. This report bounds the Rényi divergence between the sampler in real arithmetic and its fixed-point implementation, on the tail-cut event, where every sample stays within a fixed number of standard deviations of…
Oracle attacks show the importance of a correct implementation of cryptographic standards when translated into code. A notable example is the Bleichenbacher attack on RSA with PKCS#1 v1.5 padding and all the improvements that have been suggested over the decades. This paper shows how an attacker knowing a few least significant bytes of an RSA message can take advantage of a server with an oracle …
In sixteen variables, a Boolean function of degree at most four is bent as soon as every Walsh coefficient is $4$ or $5$ modulo $9$. More generally, let $m\ge4$ and $M=2^m$. We prove that a function of degree at most four on $4m$ variables is bent if all its Walsh coefficients are congruent to $\pm M^2$ modulo a single odd integer $p\ge9M/16$. The sign may vary with the frequency. This improves t…
Threshold signing is widely deployed to protect cryptographic keys, but extending these deployments to post-quantum signatures remains challenging. While NIST's lattice-based signatures now have efficient threshold protocols, distributed signing for SLH-DSA (FIPS 205), NIST's stateless hash-based signature standard, has been considered prohibitively expensive because it lacks the algebraic struct…
Succinct arguments enable efficient verification of large computations, while lattice-based constructions offer a promising path toward post-quantum security. LaBRADOR advances this direction through recursive reductions of knowledge that achieve compact proofs. However, these reductions require careful control of witness norms, relation preservation, and knowledge extraction to maintain their cl…
Federated learning (FL) enables collaborative training without sharing raw data, but exchanged model updates may reveal sensitive information. Homomorphic encryption (HE) protects these updates, yet combining collusion resistance, flexible aggregation, dropout handling, and communication efficiency remains challenging. We propose a communication-efficient threshold-CKKS protocol for cross-silo FL…
LLBC is a 128-bit low-latency block cipher for IoT applications, proposed in the IEEE Internet of Things Journal in 2025. The designers release a reference implementation in C and Verilog for reproducibility. The test vectors in the proposal are outputs of this implementation. We show that the reference implementation differs from the specification of the peer-reviewed proposal in eight points. I…
Chailloux and Loyer (2023) introduced quantum 3- and 4-sieve algorithms for the Shortest Vector Problem (SVP) with asymptotic analyses, but concrete circuit implementations remain unexplored. We present the first complete reversible circuits for both algorithms, designing inner-product predicates with signed symmetric squaring across three architectures (low-qubit, balanced, and low-depth). We va…
Blind signatures and multi-signatures are two fundamental cryptographic primitives for privacy-preserving decentralized protocols. A blind signature enables a user to obtain a signature on a message from a signer while keeping the message hidden from the signer. Moreover, the signer cannot subsequently link the resulting signature to the corresponding signing session. In contrast, a multi-signatu…
We study the addition complexity of sparse invertible circulant matrices over $\mathbb{F}_2$ and odd prime fields. Diffusion is measured by branch numbers, and prime field coefficients are restricted to $\{0,\pm1\}$. Finding optimal general circuits is often difficult, particularly at large matrix orders. Rectangle reuse offers a simpler alternative for explicit circuit construction. We compare t…
Programmable bootstrapping in Fast Fully Homomorphic Encryption over the Torus (TFHE) uses a bootstrapping key (BSK) to control successive external products during blind rotation, incurring computational cost and introducing and propagating error. We introduce Phase-Hiding Programmable Bootstrapping (PH-PBS), in which the key-holding client precomputes single-use phase tokens encrypting randomly …
A central goal in secure multiparty computation (MPC) is to minimize the gap between the total computation performed by all parties and the cost of insecure circuit evaluation. In the honest majority setting, the ideal overhead of $\widetilde{\mathcal{O}}(1)$ is known to be achievable. However, all prior protocols over prime fields attaining this goal for general circuits relied on the so-called …
We investigate the power and limitations of quantum cryptography in distributed consensus protocols. Specifically, we study the fundamental problem of Byzantine Agreement in partial synchrony, in a setting in which each party has access to a finite number $k$ of signature tokens. Classically, this problem is solvable only when less than one-third of the parties can be faulty (Dwork, Lynch, Stockm…
Almost perfect nonlinear (APN) functions of $\mathbb{F}_2^n$ have the lowest possible differential uniformity. The only known APN permutation in even dimension, in dimension six, is equivalent to a quadratic APN function with a nontrivial linear self-equivalence; no APN permutation is known for even $n \geq 8$. In a published collection of about 3.8 million quadratic APN classes of dimension eigh…
Falcon is a compact post-quantum signature scheme selected by the National Institute of Standards and Technology (NIST), and its number-theoretic transform (NTT) computations constitute a critical side-channel attack surface. Existing NTT attacks rely on truncated coefficient ranges and do not cover the full valid range of Falcon secret coefficients, limiting their applicability to complete key r…
The conjugate-invariant variant of CKKS (CI-CKKS) by Kim and Song encrypts real vectors over the subring of a power-of-two cyclotomic ring fixed by $X \mapsto X^{-1}$, with as many real slots as the rank of the ring. The Gentry–Lee scheme (GL) packs batches of complex matrices into a three-variable ring and multiplies them natively. GL bootstrapping replaces the rotations of the slot transforms w…
The revised reference implementation of MoFang moves the S-box of the second message half to row 1, which does not eliminate the original per-round key cancellation. Collisions of this type on the original version have been independently reported2,3; this paper does not repeat those findings, and instead proves for the revised version that when the nonzero words of that half are confined to three…
Homomorphic AES evaluation is an important benchmark for practical FHE systems. Existing BGV-based AES transciphering schemes typically employ byte-oriented representations, which are well suited for exploiting the algebraic structure of the multiplicative inversion in the SubBytes operation. However, evaluating the affine transformation and subsequent linear layers in this representation introdu…
Deniable secret sharing, introduced by Canetti et al. (TCC 2025), protects shareholders when a subset of them is coerced into revealing their shares. Namely, a set of fakers can produce fake shares that are consistent with a fake secret of their choice, and that are indistinguishable from real shares. Very recently, Amores et al. (TCC 2026) studied deniable secret sharing in a setting where the f…
Early-stopping broadcast protocols guarantee termination as a function of the number $f\le t$ of parties actually corrupted in an execution, rather than of the worst-case bound $t
Pseudorandom codes (PRCs) hide messages in strings that look uniformly random to anyone without the decoder key. If the key may be stolen after some codewords have been sent, security requires that these codewords and the stolen key be indistinguishable from uniform strings, chosen independently of the messages, together with a key that decodes each of them to its message. Since such a string car…
Differential privacy is the standard framework for defining privacy-preserving computation and is adopted in large-scale production systems, including industrial-level private learning. The underlying algorithms are based on complex privacy-enhancing mechanisms such as privacy amplification by subsampling and correlated noising. Proving their privacy requires advanced reasoning techniques such as…
Hash-based zero-knowledge (ZK) arguments are particularly attractive for their conservative post-quantum security, relying only on cryptographic hash functions. While VOLE-in-the-Head proofs, based on GGM trees, are the most compact for very small witnesses, Merkle-tree-based approaches take over for larger ones. In this regime, the recent SmallWood scheme achieves the smallest proof sizes for wi…
Financial institutions can be exposed to systemic risk through overlapping portfolios and common liquidity shocks, yet identifying and reducing these dependencies requires precisely the portfolio information that institutions are unwilling to reveal. We present, to the best of our knowledge, the first privacy-preserving framework combining system -level portfolio analysis with coordinated portfol…
An important challenge in homomorphic encryption (HE) is ensuring the integrity of the encrypted computations. Although verifiable computation can address this in theory, making it practical is far from trivial. [Cascudo et al. CRYPTO 2025] recently proposed a solution to this problem for the CKKS scheme. In particular, they propose new succinct arguments that efficiently prove arithmetic circuit…
BitVM-style protocols verify succinct proofs on Bitcoin by garbling a proof verifier off-chain. What reaches the chain in a dispute is the proof itself: its bits under one-time keys, the scripts that authenticate them and the signatures that bind them to transactions. Existing designs garble elliptic-curve SNARK verifiers, which a quantum adversary breaks. Our goal is a post-quantum alternative: a h…
Authorship attribution techniques are routinely used to re- late anonymous or disputed texts to known authors through characteris- tic writing styles. Within the financial sector, such techniques may sup- port investigations of phishing campaigns, impersonation attempts, in- vestment scams, or other forms of fraud. More concretely, these methods can be leveraged to determine whether newly observe…
Apple's Private Cloud Compute (PCC) offloads on-device computation, such as large language-model prompts, to the cloud while seeking to preserve the privacy users expect from local processing. At its core lies a custom authentication protocol that must reconcile three competing goals: restricting access to registered users within a rate limit, doing so without revealing user identities or linking…
Cryptographic software is typically optimized for the instruction set architecture exposed by the processor. Modern processors, however, contain deeper execution layers with computational capabilities and constraints that differ from those of the instruction set architecture (ISA). This work explores the programmable microcode layer in x86 as an implementation target. We characterize the microcod…
Side-channel hints can reduce the cost of solving the Learning with Errors (LWE) problem. We optimize a two-step strategy for LWE with hints that uses BKZ reduction followed by final lattice sieving. Given a lattice constructed from the hints and a specified pair of reduction and sieving algorithms, the strategy jointly selects BKZ block sizes, tour counts, and a final sieving configuration. We a…
CML is a cubic multivariate signature scheme proposed over $\mathbb{F}_q$ with $q = 2^8$. Earlier cubic Oil--Vinegar variants such as CUOV and CSSv were broken by differential and high-rank attacks. CML adds an $\ell$-invertible cycle system and a secret position-hiding map to hide the cubic positions. We show that the cubic homogeneous parts of the public key span a space of dimension at most tw…
A distance-sensitive set representation stores a set $S$ in a metric space and must accept points within distance $r$ of $S$ and reject points farther than $cr$, each with error probability at most $\alpha$. Under differential privacy, even exact membership costs a privacy loss of $\ln(1/\alpha)$; we ask how much \emph{more} the geometry of the space forces. Earlier lower bounds cover only restri…
Blind multi-signatures (BMS) allow a user to obtain a compact signature on a hidden message through the joint participation of multiple signers, providing a basis for decentralized issuance of anonymous tokens.We present BMRaccoon, the first lattice-based post-quantum BMS construction, with a two-round signing protocol secure under concurrent sessions and signatures syntactically compatible with …
A central challenge in Fully Homomorphic Encryption (FHE) is the selection of ciphertext moduli, which depends on accurately estimating noise growth during homomorphic evaluation. Choosing excessively large moduli reduces the efficiency and scalability of the scheme, whereas underestimating noise can result in decryption failures and potential security vulnerabilities. Average-case analyses have …
Vector Commitments allow parties to commit to an (ordered) vector and to later succinctly open it at any desired position. In plain (i.e., known order and pairing-free) prime-order groups, all state-of-the-art constructions rely on the combination of a generalized Pedersen commitment and an inner product argument. This includes the celebrated constructions of Bootle et al. (EUROCRYPT 2016) and Bü…
SHA-2 is the most widely deployed family of hash functions, and its security margin is measured by the number of steps collision attacks reach. Li et al. gave the first classical collision attack on 38-step SHA-256, with an estimated complexity of $2^{104.3}$. The challenge is to extend the attack to more steps while retaining its advantage over generic collision search. In this paper, we show th…
Anamorphic encryption enables covert communication despite disclosure of ordinary decryption keys~\cite{PersianoPY22}. Work on anamorphic signatures extends this capability to settings permitting only authentication and shows that Fiat-Shamir preserves anamorphism~\cite{kutylowski2023anamorphicSignatures,fiat1986prove}. However, this result assumes an already anamorphic protocol and does not by i…