Daily Summary for 2026-10-17

Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.

Nadia: It's the seventeenth of October, twenty twenty-six, and this is the day's research.

Elias: 8 new papers came out today.

Nadia: I'm Nadia.

Elias: And I'm Elias, here with Priya.

Nadia: We'll take the day in one pass, then pull out the papers we're staying with.

Elias: Start us off with Identifier-Free Code Embedding Models for Scalable Search.

The summary: Nadia: Welcome. Today is the seventeenth of October, twenty twenty six.

Elias: We are diving into understanding and protecting small businesses because they form our economy's backbone.

Priya: These businesses are often overlooked in cybersecurity efforts despite their importance to the economy.

Nadia: The systematic review Unaware Unfunded and Uneducated A Systematic Review of SME Cybersecurity looked at literature from two thousand seventeen to twenty twenty four.

Elias: That review found research on small and medium enterprises is underdeveloped and has not made much progress grasping their specific threats or needs.

Priya: Indeed, the findings show a lack of progress in understanding their specific needs.

Nadia: Agreed. The literature reviewed covers that period specifically for SME cybersecurity research.

Nadia: The main hurdles are lack of risk awareness, limited cybersecurity literacy, and tight finances.

Elias: Low literacy seems to be the root cause linking those issues together.

Priya: We also looked at using large language models to spot code vulnerabilities.

Nadia: That paper, Words Speak Louder Than Code, explored cognitive biases in LLM assessment of code flaws.

Elias: It found models are susceptible to effects like the framing effect and anchoring.

Priya: This susceptibility is significant because models can be tricked into misjudging security risks.

Nadia: Even when relying on pattern matching, they can fail deep semantic understanding checks.

Lucky paper: 2605.05251: Nadia: Let's talk about Identifier-Free Code Embedding Models for Scalable Search.

Elias: This paper focuses on how well embedding models can associate source code functions with their decompiled, stripped counterparts that lack identifiers like variable or function names.

Priya: It addresses the problem where binary reverse engineering needs to understand a binary, but the debug information is stripped, leaving little naming around.

Nadia: The authors look at function association in both directions: source code to decompiled code and decompiled code back to source code.

Elias: They use transformer-based embedding models with text inputs to avoid complex preprocessing steps for the search.

Priya: They formalize the function association problem and fine-tune a Qwen3 Embedding model using contrastive learning with an InfoNCE Loss objective.

Nadia: The training involved setting tau equal to zero point zero five and using AdamW as their optimizer on Qwen3 Embedding-0 point 6B with a batch size of five hundred twelve over nine hundred sixty-four steps.

Elias: They tested this on the Assemblage dataset which contains nearly five hundred thousand function pairs, totaling over 1M functions across both representations.

Priya: The results show their new model outperforms other models on all function association baselines by a substantial margin.

Nadia: In the Assemblage experiments, their model exhibited the best performance across every metric and all pool configurations.

Elias: They found that combined search pools, which include both source and decompiled functions, present significantly harder tasks for models that rely on identifier names.

Priya: Their model reduces this reliance on those identifiers.

Nadia: The paper also shows the model generalizes to a separate constant-association task it was never explicitly trained for, which indicates it learns broader algorithmic features.

Elias: Quantization doesn't entirely hinder performance either; their FP8-quantized model performs comparably to the unquantized version on most benchmarks.

Priya: The limitation they mention is that the performance might deviate on binaries compiled for different architectures since the Assemblage dataset only includes xeighty-six compilation.

Nadia: It’s a framework for evaluating how well embedding models associate source code functions with their decompiled, stripped counterparts lacking identifiers like variable or parameter names.

Lucky paper: 2602.05612: Nadia: We’re looking at ADCA, Attention-Driven Multi-Party Collusion Attack in Federated Self-Supervised Learning.

Elias: This paper proposes a novel distributed backdoor attack for FSSL that uses trigger decomposition and an attention mechanism to fight the dilution of backdoor information during model aggregation.

Priya: It works by having malicious clients decompose the global trigger into multiple local patterns during local pretraining to find optimal local patterns.

Nadia: They then collude to form a malicious coalition and use an attention mechanism to dynamically aggregate updates, which mitigates that dilution by benign updates.

Elias: The paper defines this transformation function as R(x, e, phi star) equals x times one minus T phi star plus e times T phi star.

Priya: And the key innovation is their local update strategy based on attention-driven interaction where malicious clients dynamically integrate models from other attackers before each training round.

Nadia: That dynamic integration is supposed to boost backdoor expressiveness while countering high-dimensional defense detection and maintaining stealthiness.

Elias: The optimization objective they use minimizes theta t plus one equals theta t plus alpha j m k equals one alpha k times delta theta j.

Priya: That formula shows how the initialization model update for malicious clients in the next round is defined.

Nadia: They also focus on three dimensions: trigger location T L, size T S, and gap T G in RQ2.

Elias: The construction of distributed backdoor triggers involves decomposing a single complete trigger into M distinct subtriggers embedded across different clients' datasets.

Priya: They build this using the BadEncoder utilizing a shadow dataset with clean samples and backdoor samples embedded with those distributed triggers under a robust contrastive learning framework.

Nadia: The joint optimization objective they use is min theta k L equals lambda one times Leff plus lambda two times Lstealth.

Elias: Leff is the attack effectiveness, defined as minus E x from Padv h f of x XOR ek theta ek plus beta times S f x t theta ek, f x t theta g i.

Priya: And feature stealthiness is formalized as Lstealth equals minus E of x,x plus from Pclean h S f x theta ek, f x theta g plus S f x plus theta ek, f x plus theta g i where the augmented view is called xt plus.

Nadia: The experiments show ADCA consistently outperforms existing methods under various settings on CIFAR-ten STL-ten GTSRB and CIFAR-one hundred.

Elias: Table two shows ADCA performing better than five mainstream defense methods like FLAME, FLTrust, PatchSearch, PoisonCAM and EmInspector.

Priya: Even though those defense strategies offer some robustness in the FSSL setting they are still insufficient to effectively mitigate the impact of ADCA.

Nadia: Table three compares ADCA with five baseline backdoor methods under standard SSL settings with different pre-training and downstream datasets.

Elias: Table four presents the final results under Non-IID settings on CIFAR-ten STL-ten and CIFAR-one hundred.

Priya: When the number of clients increases from ten or twenty-five to twenty or eighty regardless of whether the data is IID or Non-IID, the attack success rate decreases slightly but still stays high.

Nadia: That stability across client numbers indicates ADCA has good stability.

Elias: The paper proposes this innovative distributed trigger building on DBA Xie et al two thousand nineteen unlike traditional approaches which decompose a single complete trigger into M distinct subtriggers embedded in different clients' datasets to achieve a more covert and efficient effect.

Lucky paper: 2601.13031: Nadia: We're looking at a paper called Post Quantum Secure Aggregation via Code Based Homomorphic Encryption from Technical University of Munich.

Elias: This system uses a code based alternative for secure aggregation by instantiating a general framework based on key and message additive homomorphic encryption under the Learning Parity with Noise assumption.

Priya: Secure aggregation is important in federated learning where model updates from users need to be aggregated without revealing individual contributions.

Nadia: It presents this code based approach as equivalent to standard LPN for suitable parameters.

Elias: The protocol involves a single server and N users, each user j holding a k dimensional private input mj quantized to Lambda levels of integer precision.

Priya: That quantization is done into Fk q of cardinality q greater than N times Lambda minus one, which prevents overflows during integer addition modulo q.

Nadia: The protocol has several steps starting with key setup and sharing where each user j generates a secret key sj using KAHE KeyGen.

Elias: Then there's input encryption where each user j encrypts its private input mj under the secret key sj obtaining a ciphertext yj equals KAHE Encrypt(mj, sj).

Priya: After that, users send their ctj and yj to the server for individual key recovery.

Nadia: The decryptor recovers the corresponding secret key as sj equals f minus one of f of sj.

Elias: Next is key aggregation where the decryptor aggregates these recovered keys as s bar equals P N j equals one sj and transmits that aggregate to the server.

Priya: The server then aggregates all the ciphertexts yj under the homomorphic addition procedure of KAHE to obtain y bar.

Nadia: And finally, it uses s bar to recover m bar which is P N j equals one mj in Fk q.

Elias: The central component is the key and message additive homomorphic encryption scheme KAHE constructed based on the LPN assumption following a blueprint of Regev but transferring it to the Hamming metric.

Priya: The definition of LPN based KAHE involves sampling a secret key s from-R Fk q, encrypting the message m under this key as s A plus e plus C enc(m).

Nadia: Where e is from Bern n and p, and y bar equals P j equals one yj under the aggregate key s bar.

Elias: Theorem one proves that KAHE is semantically secure under the LPN assumption when instantiated with noise rate p and a specific noise rate tau.

Priya: The security relies on the Hint LPN assumption which reveals an erroneous version of the LPN error.

Nadia: Theorem three establishes an efficient reduction from LPN k tau to HintLPN p k p.

Elias: This allows the proof to proceed by showing that any adversary breaking semantic security of KAHE can be turned into a distinguisher for HintLPN p k p.

Priya: Then Theorem two demonstrates that assuming an attacker colludes with z clients and receives s bar, they can break semantic security if they can break the LPN k tau prime assumption.

Nadia: The complexity reduction uses the Chinese Remainder Theorem to reduce field size by executing the protocol repeatedly over smaller moduli.

Elias: The aggregate m bar is reconstructed from per modulus aggregates m bar t in Fk qt where q equals q1 times q2 times... alpha.

Priya: This modulus qt is lower bounded by the collusion parameter z, such that it may be chosen to minimize communication costs.

Nadia: The performance evaluation shows a communication cost per user of X t in alpha k t minus z plus k C Rt log2 of qt bit.

Elias: That cost is optimized over the choices of q1... alpha and k1...

Lucky paper: 2505.15051: Nadia: Alright, let's look at our fourth paper of four today. We are looking at An Empirical Analysis of EOS Blockchain: Architecture, Contract, and Security from Hainan University.

Elias: This study looks at the EOS blockchain across five areas: system architecture, decentralization, performance, smart contracts and behavioral security.

Priya: So we start with the system architecture analysis focusing on six core components of the EOS system.

Nadia: The paper details components like the P2P network communication component and the state management and data block component.

Elias: They mention that EOS is built on Graphene, which is a two-dimensional carbon nanomaterial composed of carbon atoms arranged in a hexagonal honeycomb lattice via sp-hybridized orbitals.

Priya: That Graphene software architecture seems to determine the system's architectural advantages for EOS.

Nadia: Moving into decentralization and performance evaluations, they use data from the XBlock data-sharing platform to find critical issues.

Elias: They found low account activity and minimal variation in the set of block producers as critical issues in decentralization.

Priya: And there is a substantial gap between actual throughput and its originally claimed one million TPS performance goal.

Nadia: The average transaction throughput they found was about fifty-six point four zero TPS, which is far from that million TPS target.

Elias: They attribute the sudden surge in transaction and action volume during block height exceeding eighty-seven point seven million to the EIDOS project airdrop on EOS.

Priya: Regarding smart contracts, they identified five common types of vulnerabilities like integer overflow and fake EOS attacks.

Nadia: They compared four mainstream vulnerability detection platforms including EVulHunter, EOSFuzzer, WANA, and EOSafe.

Elias: The paper also looks at behavioral security threats targeting EOSIO, introducing things like Block Delay Attack and CPU Exhaustion Attack.

Priya: A Block Delay attack happens when a block producer transitions from an exhausted state back to the success state after producing a large number of blocks.

Nadia: They also analyzed real-world incidents like the EOS Fomothree dee Werewolf Game and the EOSBet platform suffering various attacks.

Elias: The analysis covers DApp transfer processes and potential attacks on those transfers, which is important for security.

Priya: This study contributes insights for enhancing the security and regulatory mechanisms of blockchain ecosystems by analyzing the EOS blockchain system architecture based on those six core components.