28 results for “Morph”

What you seeeverything

All types28 Papers21 Write-ups3 Articles2 Repos2

eprint.iacr.orgpaper🛡️ Security

Smoothness of Shortest Isogenies to Frobenius Conjugatess

Paper by Yi Ouyang, Wei Wei and Zheng Xu on the minimum degree of an isogeny from a supersingular elliptic curve E to its Frobenius conjugate E^(p). It bounds the probability that this degree is smooth, which makes Wesolowski's p^(1/3+o(1)) attack on the supersingular endomorphism ring problem unconditional. It also gives a uniform asymptotic formula, with Dirichlet L-values in the main term, for the probability that a connection isogeny of degree n exists.

supersingular endomorphism ring problemWesolowskiYi Ouyang+2

other· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Private Information Retrieval with Accountability at Erasure-Optimal Server Redundancy

SynTrace is a single-round compiler that adds accountability to linear private information retrieval (PIR). The client mixes the retrieval query with m audit queries, so audit syndromes identify up to d deviating servers among t colluding ones before reconstruction. The paper proves perfect query privacy and zero false identification within the threshold. For Shamir-based PIR it needs k=t+d+1 servers. For a 32 KiB record from a 1 GiB database it uses 2.25 MiB, against 8.96 MiB for the Eriguchi, Kurosawa and Nuida (TCC 2022) homomorphic-MAC construction.

SynTraceEriguchi-Kurosawa-Nuida homomorphic MACTCC 2022

other· Published and added 26 Oct 2026

eprint.iacr.orgpaper🛡️ Security

On the Inapplicability of Residue-Confined Error Attacks to CRT-FHE with Non-Degenerate Error Distributions

Anil Kumar Pradhan's October 2026 ePrint rebuts the Olejnik and Naskrecki (2026) key-recovery and plaintext-recovery attack on the Pradhan CRT-RLWE fully homomorphic encryption scheme. It argues the attack works only because the chosen error distribution lies in the kernel of the CRT encoding, which makes the effective error zero. It also argues that the intended centered-binomial errors make that event negligible at the reported parameters. This is the author's own response, not independent verification.

CRT-FHERLWE

Olejnik and NaskreckiAnil Kumar PradhanKey Recovery from Residue-Confined Errors in the Pradhan CRT-RLWE Construction+1

other· Added 26 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

OWLS: Open-world Language-conditioned Speed Fields for Zero-Shot Rover Navigation

OWLS (Open-world Language-conditioned Speed Fields) plans directly over a vision-language model's dense feature map. A text prompt describing traversable terrain scores every pixel of one camera image. The scores are projected onto the ground, adapted with two morphological operations, and used as the speed field of a minimum-time planner. It needs no training, terrain labels, map or extra sensors. It was tested on a physical rover, on simulated Mars and Moon rovers over 200 procedural terrains, and on real planetary imagery.

vision-language model

OWLSarXiv

research, multimodal· Added 26 Oct 2026, published 23 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Mímir: A Stateless Private Search Engine

Mímir is a cryptographic protocol for stateless semantic private search over highly dynamic public databases. It uses homomorphic ciphertext switching, relies on (Ring) Learning with Errors, and needs no offline communication. Against Tiptoe it matches search quality with 84x less per-query communication (0.24 MiB). Against PACMANN it raises quality from 76% to 81% of non-private search, with a 9.54 MiB one-time cost instead of 2.68 GiB, but is 2.1x slower.

TiptoePACMANNLearning with Errors+1

other· Added 24 Oct 2026, published 22 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Balsamic: One-round Threshold UOV from GPU-Accelerated FHE

Balsamic is a complete homomorphic Unbalanced Oil and Vinegar (UOV) signer, used to build one-round threshold UOV signatures from a packed discrete-CKKS FHE circuit. A paired-pivot linear solver and pivot-success certificates allow encrypted retry selection. In 2-out-of-3 semihonest signing, each online partial signature takes 10.7 s on an RTX 6000 Ada and 7.77 s on a GB300, with 5.25 MB per response.

UOVCKKSFHE+2

Balsamicuniversal thresholdizerspaired-pivot solver+1

other· Added 24 Oct 2026, published 22 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Rerandomizable Garbling for Arithmetic Circuits

Rerandomizable Garbling for Arithmetic Circuits is an IACR ePrint paper (2026/2590) by Acharya, Meyer, Orlandi and Roy. It gives the first rerandomizable garbling scheme for arithmetic circuits, built on techniques from garbling via homomorphic secret sharing. Communication is O(|C| log B), with 17 group elements per multiplication gate and free additions. Security rests on subgroup-indistinguishability assumptions such as DCR and class groups.

Decisional Composite ResiduosityYao's garbled circuitshomomorphic secret sharing+4

other· Added 24 Oct 2026, published 21 Oct 2026

eprint.iacr.orgpaper🛡️ Security

RDK-CKKS: A Framework for Rigorous Error Analysis for CKKS Computation

RDK-CKKS is a framework for rigorous probabilistic error analysis of CKKS homomorphic encryption. It injects randomization keys (encryptions of zero) at key-switching and rescaling so each operation's error has provable tail bounds, which noise flooding needs for IND-CPA^D and threshold settings. It gives a full rigorous analysis of binary bootstrapping, at about 3% extra modulus and 27% extra key communication over bootstrapping keys.

CKKS

IND-CPA^Dnoise floodingrandomization keys+1

other· Added 24 Oct 2026, published 21 Oct 2026

eprint.iacr.orgpaper🛡️ Security

A Spectral Theory of Local-to-Global Leakage

A Spectral Theory of Local-to-Global Leakage is an IACR ePrint paper (2026/2571) by Rei Ueno on additive secret sharing over finite abelian groups. It gives an exact leakage decomposition into local leakage magnitude and spectral alignment across shares. Two channels with identical local mutual information can have exponentially different global leakage. Automorphism-weighted sharing can cancel leakage perfectly with finitely many shares, which ordinary additive sharing cannot do.

Rei UenoMöbius inversion

Hardware & RF· Added 21 Oct 2026, published 20 Oct 2026

eprint.iacr.orgpaper🧠 AI

HERMES: High-Performance Private Decoding for Large Language Models

HERMES is a privacy-preserving inference (PI) system optimised for multi-token LLM decoding rather than prefill. It swaps high-round nonlinear protocols for compute- and bandwidth-heavy ones with fewer rounds, and adds a homomorphic-encryption matrix-multiplication protocol that keeps the KV cache encrypted on the server and uses grouped-query attention. On Llama 3.1 8B Instruct it cuts TPOT by up to 2.7× and total PI latency by up to 2.1×.

LlamaLLMTransformer+1

Llama 3.1 8B InstructHERMES

research, inference· Added 19 Oct 2026, published 18 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Computing endomorphisms of superspecial principally polarized abelian surfaces in time and memory \(p^{4/5+o(1)}\)

Computing endomorphisms of superspecial principally polarized abelian surfaces is a cryptanalysis preprint by Marc Houben and Lam L. Pham, posted to IACR ePrint in October 2026. It gives an algorithm that, under a standard heuristic, finds a non-scalar polarized endomorphism in expected time and memory p^(4/5+o(1)). The abstract is the only text available, so the method and its effect on specific schemes are not described.

Marc HoubenLam L. Pham

other· Added 19 Oct 2026, published 18 Oct 2026

eprint.iacr.orgpaper🛡️ Security

GKS FHE: Security Analysis

"GKS FHE: Security Analysis" is a Cryptology ePrint Archive preprint (2026/2523, October 2026) giving a formal security analysis of the Gribov-Kahrobaei-Shpilrain private-key fully homomorphic encryption scheme. The abstract says the scheme needs no bootstrapping or de-linearization, gives bit-exact decryption, supports native encrypted search and has unbounded depth. The page shows only the abstract, so the analysis's methods and results are not visible.

GKS FHE

other· Added 19 Oct 2026, published 18 Oct 2026

eprint.iacr.orgpaper🛡️ Security

CHAMP: Cayley HAshing with Matrix Products

CHAMP is a Cayley hash function that hashes binary strings by mapping each bit to a 2x2 matrix over a finite field and multiplying the matrices. The product's semigroup structure gives the hash homomorphic properties. The authors (Demin, Ovchinnikov, Shpilrain) discuss its collision resistance, implementation and performance. Cayley-style hashes have a history of structural attacks, so the security analysis is what a cryptographer would check.

CHAMPCayley hash functionsAlexander Demin+2

other· Added 17 Oct 2026, published 16 Oct 2026

arxiv.orgpaper🧠 AI

SpikeQ: Spike-Guided Post-Training Quantization for Spiking Neural Networks

SpikeQ is a spike-guided post-training quantization framework for spiking neural networks on neuromorphic chips. It picks each weight level by simulating downstream neurons to minimize spike errors, and uses a reset-aware grid for pre-fire membrane potentials. With 4-bit weights and potentials, models stay within 2.59 points of full precision, with 7.8 to 7.9 times smaller memory and 6.4 to 6.9 times less energy.

spiking neural networksneuromorphic chips

SpikeQ

research, inference· Added 20 Oct 2026, published 16 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Reaction Attack on CKKS Deployments with Asymptotically Optimal Query Complexity

Shows a protocol-level reaction attack on CKKS homomorphic-encryption deployments that publish coefficient-to-slot (C2S) evaluation keys and let the client return a 1-bit validity response. A malicious evaluator shifts a public encryption key, uses the public C2S layer to repack it into a ciphertext whose validity depends on one secret coefficient, and recovers a ternary secret key with O(H) queries, within a factor 2/log2(3) of the entropy lower bound. Each query is re-randomized with a fresh encryption of zero to evade trivial detection. The authors implemented it end to end in Lattigo v6.2.0 and recovered full keys across four standard CKKS parameter sets. It does not break RLWE or CKKS IND-CPA security.

LattigoCKKS

reaction attackcoefficient-to-slotRLWE+1

other· Published and added 15 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Average-Case Hardness of Lattice Problems in Special Genera of Fixed Rank

The paper proves, under GRH, a worst-case to average-case reduction inside any special genus of Hermitian lattices of fixed rank r≥2 over cyclotomic fields. It covers (H)SVP, HCVP, (Δ)BDD, DSP and DGS, at a poly(d)·det^{O_r(1)/d} loss in the approximation factor. The reduction is a random walk on the Kneser p-neighbour graph, and its fast mixing comes from spectral bounds on Hecke operators. It also gives a direct, tight security proof for a minimal Lattice Isomorphism Problem (LIP) based KEM. The proof rests on two assumptions: the KEM's lattice is indistinguishable from a random lattice of its genus, and ΔBDD is hard on that genus. This removes the need for the ad-hoc qΛ⊕(q+1)Λ lattice and the tightness loss from the dense sublattice.

Lattice Isomorphism ProblemΔLIPGRH+7

other· Added 11 Oct 2026, published 8 Oct 2026

eprint.iacr.orgpaper🛡️ Security

The Lattice Isomorphism Problem with Hints

This IACR ePrint paper (published TCHES 2027) presents a new cryptanalysis technique for the Lattice Isomorphism Problem that embeds LIP into a shortest-vector-problem instance on a different lattice than the one used in Hawk's specification, allowing attackers to integrate "hints" — partial information on the secret key obtained via side-channel attacks or other leakage. Using the LeakyLWEEstimator tool, the authors show Hawk signatures themselves leak exploitable information about the secret key, eroding Hawk-1024's security by roughly 11 bits, and apply the framework to resolve an open side-channel problem from TCHES 2024 plus discuss further fault-injection attack paths. Hawk is a lattice-based signature scheme submitted to NIST's second post-quantum signature call, making this a concrete key-recovery cryptanalysis relevant to PQC migration planning.

HawkLeakyLWEEstimator

Lattice Isomorphism ProblemShortest Vector ProblemMélissa Rossi

Hardware & RF· Added 8 Oct 2026, published 6 Oct 2026

arxiv.orgpaper🧠 AI

Language Unalignability: Why Some Concepts Resist Cross-Cultural Benchmark Evaluation

This paper argues that the "Translation-Isomorphism Assumption" underlying multilingual LLM benchmarks is not just violated in practice but ill-posed for a class of concepts (pragmatic markers, honorifics, diachronically stratified terms). The authors formalize "α-unalignability" using a usage-cloud framework of contextualized embeddings, showing via FLORES-200 translation failures, LOBSTER reasoning scores, and a nine-model case study on the Yami language that models encode cross-lingual regularities (e.g. Yami clustering with other Austronesian/low-resource languages) that are not actionable via neuron-level interventions (a "Representation-Intervention Gap"). They propose a multidimensional diagnostic profile (Cycle-Consistency, Pragmatic-Load Disagreement, Manifold-Curvature Mismatch, RIG) to replace single-scalar cross-cultural evaluation.

FLORES-200LOBSTERYami

evals, research· Added 7 Oct 2026, published 6 Oct 2026

eprint.iacr.orgpaper🛡️ Security

One-Round Threshold XMSS and SPHINCS+ from Fully Homomorphic Encryption

IACR ePrint paper constructing and implementing the first one-round threshold signing protocol for the hash-based post-quantum signature schemes XMSS and SPHINCS+, producing signatures that verify unmodified against RFC 8391 and FIPS 205. The approach shares the secret key among t-of-n signing parties and evaluates the signing algorithm homomorphically using threshold FHE over discrete CKKS, achieving 3.4ms amortized per hash and 0.69s online threshold XMSS signing.

XMSSSPHINCS+CKKS+1

RFC 8391FIPS 205

other· Added 8 Oct 2026, published 5 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Output Policies for Anomaly Detection with Homomorphic Encryption: Threshold Resolution, Decision Preservation, and Numerical Stability

This IACR eprint paper studies output policies for CKKS homomorphic-encryption-based anomaly detection, evaluating whether limiting released scores and decisions can hide a private detection threshold without breaking existing decisions. Across 45 plaintext and 45 CKKS experiments on three intrusion-detection datasets and autoencoder scoring models, the authors show thresholds remain estimable, quantization preserves about 99.86 percent of decisions, and a surrogate model trained on only 128 decision-only responses achieves 0.817 mean balanced accuracy at predicting decisions on new inputs, a decision-prediction model-extraction-style attack whose success depends heavily on data-splitting strategy. It argues numerical threshold leakage and decision-prediction leakage are distinct protection goals that output policies for encrypted intrusion detection systems must address separately.

CKKSHomomorphic Encryption

CIC-IDS2017

AI Security· Added 8 Oct 2026, published 5 Oct 2026

arxiv.orgpaper🛡️ Security

From A2A Attacks to Envelope-Layer Defense: Red-Teaming Evaluation of LLM Agents and a Three-Layer Isomorphic Attack-Defense Model

This paper proposes A2A-TIBA, an indirect prompt injection attack that abuses agent-to-agent (A2A/ACP) protocols by getting a target LLM agent to deploy a callback program, letting an attacker bypass the agent entirely to issue commands and exfiltrate data. It also introduces GDA Measurement, a red-team testbed that captures raw gateway context to distinguish four outcome classes (semantic refusal, semantic breach, interception, penetration) instead of a single attack-success-rate metric, and ELA-ITL, a three-layer isomorphic attack-defense model splitting defense into envelope packaging, LLM recognition, and agent interception. Testing on 15 agent-frontend x LLM-backend combinations and a 1,000-case dataset shows that labeling malicious-prompt indicators in envelope channels (A2A, tool, memory) significantly improves LLM recognition of injected content.

LLM

A2A-TIBAGDA MeasurementELA-ITL

AI Security· Added 2 Oct 2026, published 30 Sep 2026

github.comrepo🧠 AI

emlai/defi-native-skill

An open-source Agent Skill ("defi-native") that teaches Claude Code, Cursor, Codex and other Agent-Skills-compatible agents capital-markets and DeFi domain knowledge, including yield decomposition, vault/curator anatomy, oracle classes, and stablecoin/RWA taxonomy. It is structured with progressive disclosure (SKILL.md routes to task-specific reference files only when needed), an api-routes.json router that forces live data pulls (vaults.fyi, DefiLlama, Morpho's GraphQL, rwa.xyz, Merkl, 130+ protocol docs) before any numeric claim, and a verified 90+ source manifest. The author describes an eval-gated release process (paired with/without-skill runs graded on structure) and adversarial review by independent models before publishing, making it a useful case study in skill engineering even for readers uninterested in DeFi itself.

Claude CodeCursorCodex+1

Emily Lai

prompting· Added 2 Oct 2026, published 28 Aug 2026

huntress.comwriteup🛡️ Security

MacSync Stealer: How a Google Search for Claude Led to a macOS Infostealer

Huntress SOC analysts reverse-engineer MacSync, a macOS infostealer/RAT distributed via a sponsored Google Ads link to a fake "Apple Support"-branded claude.ai shared conversation that uses ClickFix to trick victims into pasting a curl/zsh loader into Terminal. The six-stage chain runs a polymorphic gzip/Base64 loader, an in-memory AppleScript stealer that harvests Chromium Safe Storage keys, keychain secrets, Telegram/SSH/cloud credentials, abuses TCC (Full Disk Access and Screen Recording) prompts, drops a Mach-O RAT with WebSocket/TLS C2 and an XOR-obfuscated fallback domain, and trojanizes 84 crypto wallet extensions/apps to phish seed phrases. The piece also compares it to prior AMOS Stealer and SectopRAT ClickFix campaigns and offers behavior-based detection guidance.

macOSAppleScriptzsh+3

MacSyncClickFixSectopRAT+2

Malware & RE, Threat Intel, Blue Team & Detection· Added 3 Sep 2026, published 17 Aug 2026

endorlabs.comarticle🛡️ Security

AI-Generated Malware and the Software Supply Chain | Blog | Endor Labs

Endor Labs analysis of how generative AI is reshaping software supply chain attacks: lowering the skill barrier via tools like WormGPT/FraudGPT, enabling faster AI-generated variant/polymorphic malware, scaling malicious package generation (including slopsquatting from LLM package-name hallucinations), and improving phishing for maintainer account takeover. Cites a 14x increase in malware advisories over two years and that 92% of npm account takeovers led to malware distribution, referencing the open-sourced Shai-hulud npm worm. Recommends behavior-based detection before install, dependency/package firewalls, CI/CD hardening against credential-harvesting postinstall scripts, and dependency governance.

npmPyPI

WormGPTFraudGPTShai-Hulud+1

Supply Chain, AI Security· Added 3 Sep 2026, published 29 Jul 2026

huntress.comwriteup🛡️ Security

Reverse Engineering the Six Stages of MacSync Stealer and RAT

Huntress reverse-engineers MacSync, a macOS stealer-and-RAT chain delivered via a weaponised claude.ai share link promoted through Google Ads malvertising, where a victim searching for how to install Claude on a Mac pastes a curl piped to zsh one-liner. The writeup traces all six stages: a polymorphic zsh loader, a server-side AppleScript that social-engineers Full Disk Access and validates the account password via dscl authonly, keychain and browser Safe Storage theft, a statically-linked C++ Mach-O RAT with WebSocket and AES-CBC C2 plus LaunchAgent persistence disguised as legitimate updaters, a signed Screen Recording-badged helper that phishes the TCC screen-capture permission, and trojanised Electron wallet apps (Ledger Live and Ledger Wallet) that inject a fake recovery-phrase phishing flow. It ties the kit to the AMOS and Atomic Stealer lineage via Russian-language code comments and shared infrastructure, and documents concrete IOCs including domains, C2 IP, mutex naming, and plist patterns for defenders.

macOSClaudeGhidra+3

MacSyncAMOS stealerSectopRAT

Malware & RE, Threat Intel· Added 3 Sep 2026, published 29 Jul 2026

endorlabs.comwriteup🛡️ Security

SANDWORM_MODE: Dissecting a Multi-Stage npm Supply Chain Attack | Blog | Endor Labs

Endor Labs dissects "SANDWORM_MODE", a multi-stage npm supply-chain attack using typosquatted packages (e.g. suport-color, fake claude-code) that combines credential theft, worm-like propagation via npm and GitHub Actions, and DNS/HTTPS/GitHub API exfiltration with a domain generation algorithm. Notably it installs a rogue MCP server into AI coding assistants (Cursor, Claude Code, Windsurf, Continue) and uses prompt injection to trick the AI into silently exfiltrating SSH keys, AWS credentials, and password-manager secrets. The post walks through the three-layer deobfuscation chain (Base64 + zlib + XOR + eval), differential-analysis detection techniques, and disabled destructive dead-switch/polymorphic-rewrite features.

npmModel Context ProtocolCursor+3

SANDWORM_MODEShai-Hulud

Supply Chain, Malware & RE, AI Security· Added 27 Jul 2026

deepmind.googlearticle🧠 AI

Our approach to bioresilience

Google DeepMind and Isomorphic Labs describe their joint bioresilience program, organized around preventing misuse of models like Gemini, detecting outbreaks earlier, and accelerating response. Concrete efforts named include a four-step safety process (threat modeling, evaluations, mitigations, monitoring) under DeepMind's Frontier Safety Framework, adapting SynthID watermarking to flag AI-generated biological sequences for DNA synthesis screening, using the AlphaEvolve agent to optimize metagenomic sequencing algorithms for cheaper pathogen surveillance, and applying AlphaGenome and Protein Function annotation to pathogen characterization, alongside Isomorphic Labs' Drug Design Engine (IsoDDE) for rapid countermeasure design.

GeminiAlphaFoldAlphaGenome+1

Google DeepMindIsomorphic LabsAlphaEvolve+1

ai-safety, ai-policy· Added 29 Sep 2026, published 16 Jul 2026

github.comrepo🛡️ Security

0xMohammedHassan/morphkatz

MorphKatz is a static C++20 Windows x64 tool that rewrites PE binaries and raw shellcode into semantically identical but byte-different variants using a Zydis-powered CFG-aware disassembler/encoder, YAML rewrite rules, and EFLAGS liveness tracking. It targets two audiences: detection engineers who can measure what percentage of their YARA/Defender/Elastic/Sigma rules survive N polymorphic variants (--variants, --target, --bisect against a live Defender via MpCmdRun), and authorized red-teamers who need reproducible, seed-based, rule-cited evasion runs with JSON/HTML diff reports for engagement deliverables. It explicitly excludes ML-behavioral evasion and live pop-malware obfuscation, restricting mutations to author-audited, semantically-proven equivalence rules.

WindowsYARASigma+3

HackTool:Win32/AmDisable!MTB

Blue Team & Detection, Offensive Security, Malware & RE· Published and added 7 May 2026