Published file metadata, source observations, indicators, and research history in one bounded catalog.
64Reachable catalog records
3 / 3Current catalog page
24Maximum records per page
0Samples downloaded by this page
Feed collection status
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
src_e53adb99e40ae66258Collection status unverifiedLast successful batch: Unverified
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.
64 MATCHING RECORDSMETADATA ONLY / SOURCE ATTRIBUTION PRESERVED
ePrint Report: Automated Search for Periodic Functions in Quantum Attacks: Distinguishers and Key-Recovery Attacks Qun Liu, Haoyang Wang, Boyun Li, Meiqin Wang Quantum attacks based on Simon's algorithm rely on Boolean functions with hidden XOR periods. At ASIACRYPT 2025, Liu et al. introduced a symbolic automated search model for periodic functions used in distinguishers. However, for distinguish
First reported Oct 05, 2026 17:36 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: On the hull attacks against Construction A lattices Jean-François Biasse, Alexandra V. Hostetler, Anuvrat Jaindungarwal In this paper, we present an algorithm for solving the Lattice Isomorphism Problem between input lattices that are isometric to the Construction A lattice of a certain code C. Our algorithm is a direct extension of a method due to Ducas and Gibbons (PKC 2023). We p
First reported Oct 05, 2026 18:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: DP-Guided Schedule Selection for $\mathbb{F}_2[x]$ Multiplication across ISAs Junyu Zhou, Xiao Lan, Jing Wang, Hao Ren, Weiran Liu, Si Gao Efficient multiplication over $\mathbb{F}_2[x]$ is a core primitive in classical and post-quantum cryptographic software. As ARM and RISC-V become increasingly relevant for open-source cryptographic libraries such as OpenSSL and liboqs, arithmeti
First reported Oct 07, 2026 05:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: StOMR: Stateful Oblivious Message Retrieval Charles Gouert, Keewoo Lee, Dimitris Mouris, Yiannis Tselekounis, Jean-Luc Watson Oblivious Message Retrieval (OMR) enables recipients to retrieve messages from an untrusted server without revealing which messages correspond to them. OMR is useful for privacy-preserving systems such as anonymous messaging and blockchains. Existing construc
First reported Oct 07, 2026 05:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Expander-Based Codes at the Gilbert–Varshamov Bound Peter Rindal We prove that Expand--Accumulate (EA) codes approach the Gilbert--Varshamov (GV) distance as the code length grows. The result holds over the binary field and every fixed finite field. At fixed rate, encoding uses $O(n\log n)$ expected field operations, with a tunable inverse-polynomial probability of sampling a bad co
First reported Oct 04, 2026 22:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Plotkin Attacks! On the (Mis)use of Raptor Codes in Asynchronous Verifiable Information Dispersal Victor Shoup Some asynchronous verifiable information dispersal (AVID) and data-availability protocols certify that a disperser's message is available once $2f+1$ of $n=3f+1$ parties, at most $f$ of them Byzantine, attest that they hold their erasure-coded fragments, and defer reconstru
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Output Policies for Anomaly Detection with Homomorphic Encryption: Threshold Resolution, Decision Preservation, and Numerical Stability Subeen Cho, Jiwon Bang, Minseo Kim, Seungwon Lee, Hwajeong Seo Homomorphic encryption computes anomaly scores without exposing inputs, but released scores and decisions can reveal a private threshold. We evaluate whether output policies limit numeri
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Low-Noise Multi-Value Bootstrapping via Log-Unit Lattice Search and LUT Shifting Olivier Bernard, Nolan Carouge, Marc Joye, Jean-Baptiste Orfila, Samuel Tap Programmable bootstrapping is a central procedure in the FHEW and TFHE families of fully homomorphic encryption schemes, but its computational cost remains a major performance bottleneck. Multi-value bootstrapping amortizes this
First reported Oct 04, 2026 21:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: The Geometry of Witness-Update Tradeoffs in Additive Positive Accumulators Wei Qi An additive positive accumulator represents a growing set by a short public digest. Each inserted element has a membership witness, which may have to be refreshed after later insertions. An execution of $n$ insertions therefore defines a labeled update vector $d=(d_1,\ldots,d_n)$, where $d_i$ is the nu
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Multiplying Not-So-Big Integers with FFTs: Finding and Pushing the Crossover on Large Modern OoO ARM CPUs Cesare Huang, Daisy Meng-Wei Liu, David Shu-Yu Wu, Bow-Yaw Wang, Bo-Yin Yang Established multiple-precision software generally reserves Fast-Fourier Transform (FFT) multiplication for very large operands; for example, GMP reports full-product FFT thresholds of roughly 3000--1000
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: GPU-Assisted FAEST v3 Signing: Challenge Grinding and CPU–GPU Pipelining Ha-Gyeong Kim, Si-Woo Eum, Seung-Won Lee, Min-Ho Song, Hwa-Jeong Seo Applying a GPU to FAEST v3 signing requires more than exploiting parallel computation: challenge grinding must preserve the minimum accepting counter selected by the original signing procedure, and single-sign latency and multi-sign throughput
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Verifier-Aligned Canonical Source Binding for Homomorphic Encryption Computations Subeen Cho, Jiwon Bang, Minseo Kim, Seungwon Lee, Hwajeong Seo q0 preprocessing verification and native HE computation verification can each succeed without establishing that their results refer to the same canonical source. To address this source mismatch across verification paths, we propose a verifi
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Pseudorandom Codes from LWE Keewoo Lee A pseudorandom code (PRC), introduced by Christ and Gunn (Crypto 2024), is an error-correcting code whose codewords look uniformly random to anyone without the secret key. PRCs not only are natural cryptographic objects to study in their own right, but also have interesting applications such as undetectable watermarking of AI-generated content.
First reported Oct 06, 2026 18:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Bandwidth-Balanced Reliable Broadcast in Stake-Weighted Networks Victor Shoup Consider an asynchronous network of $n$ validators in which Byzantine validators hold less than one third of the stake. In erasure-coded reliable broadcast, validators relay fragments of the sender's message. A validator's relay-upload cost is the amount of fragment data it transmits outside the sender's i
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Breaking the $n^2$ Barrier: Information-Theoretic MPC with Sub-Quadratic Communication Alexander Bienstock, Yuval Efron, Kevin Yeo Secure multi-party computation (MPC) considers the problem of securely computing a function across $n$ parties such that no adversary controlling $t$ corrupted parties may learn any additional information beyond the function output. For information-theor
First reported Oct 04, 2026 21:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Role-Specific Signature Placement in TLS 1.3: Cost Propagation and PQC Migration Moonsun Heo, Subeen Cho, Jongbeom Ahn, Minseo Kim, Hwajeong Seo Certificate issuance and per-connection signing impose different costs in TLS 1.3, and authentication cost can change depending on how signature algorithms are assigned to Root, Intermediate, and Leaf roles. PQC migration should therefore c
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
A filename, label, or report mention alone does not establish maliciousness. Observation dates describe cited sources; collection dates describe this local metadata catalog. No malware samples are stored, fetched, or executed by these pages.