A Public-Key-Dependent Adversarial-Deletion Ceiling for Fixed-Alphabet Multi-Bit Pseudorandom Codes

arXiv:2609.02943 · cs.CR, cs.IT, math.IT · Submitted 2026-08-31 · Read on arXiv

cs.CR, cs.IT, math.IT

Submitted: 2026-08-31

Updated: 2026-08-31

Terminology

• Decode — 27× in this paper · explained in 2 episodes
• Robustness — 12× in this paper · explained in 5 episodes
• Accuracy — 2× in this paper · explained in 1 episode
• Core — 1× in this paper · explained in 2 episodes
• Embeddings — 1× in this paper · explained in 2 episodes
• Generative Model — 1× in this paper · explained in 2 episodes
• Generative Models — 1× in this paper · explained in 2 episodes
• Superadditivity — 1× in this paper · explained in 2 episodes

Sources

• Ideal Pseudorandom Codes
• Pseudorandom Error-Correcting Codes
• Improved Pseudorandom Codes from Permuted Puzzles
• Watermarking Language Models for Many Adaptive Users
• The Coding Limits of Robust Watermarking for Generative Models
• New constructions of pseudorandom codes
• Black-Box Crypto is Useless for Pseudorandom Codes
• Edit Distance Robust Watermarks via Indexing Pseudorandom Codes
• High-Rate Public-Key Pseudorandom Codes for Edit Errors
• Improved Lower Bounds on the Expected Length of Longest Common Subsequences
• Expected Length of the Longest Common Subsequence of Multiple Strings

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs