ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “efficiency”

13 stories in the last 3d

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI research 14Research 13AI industry 12Model release 7Tools 5Industry 3Phishing & fraud 2Data breach 1AI safety & security 1AI tools & infra 1Advisory 1Policy & legal 1
SeverityAllcritical 0high 0medium 4low 0info 57

SEEK: Secure and Efficient Encrypted Keyword Search For Privacy-Preserving Messaging Protocols

Researchers propose SEEK, a homomorphic-encryption plus 2PC protocol for encrypted keyword search that hides keywords while detecting matches.

SEEK partitions messages into ciphertext fragments with minimum sufficient overlap and homomorphically correlates them using encrypted keyword trapdoors, combined with 2PC-based selected decoding, blinded zero testing, and secure aggregation. It reduces sender-side encryption and upload overhead by up to two orders of magnitude over state-of-the-art baselines and computes correlations up to 5.47x faster, revealing only the keyword presence bit while hiding contents, counts, and locations. A prototype achieves 1.92 seconds online computation per search on a weekly messaging history and is realized as a web and cross-platform mobile application.

arXiv cs.CR · 20h agoResearch

ROSETTA: Efficient and Accurate Privacy-Preserving LLM Decoding via Hybrid CKKS/TFHE Evaluation

ROSETTA is a hybrid CKKS/TFHE homomorphic encryption framework for privacy-preserving LLM decoding, achieving up to 4.8x Softmax and 2.1x end-to-end speedups.

The paper proposes ROSETTA, a hybrid CKKS/TFHE fully homomorphic encryption framework for private inference on generative LLMs, targeting the nonlinear operations that dominate autoregressive decoding cost. It introduces an adaptive segmented lookup-table protocol based on TFHE and a scheme-aware operator-selection framework that assigns each nonlinear operator to CKKS or TFHE to minimize latency. Experiments show up to 4.8x Softmax speedup and 1.5-2.1x end-to-end decoding speedup over the state-of-the-art CacheMir framework.

arXiv cs.CR · 1d agoResearch

Differential Trust: Dynamic Multi-Authority Anonymous Credentials with Epoch-Weighted Updates

Researchers propose MA-ACEW, the first multi-authority anonymous credential model with epoch-weighted issuance and efficient cross-epoch credential updates.

The paper introduces MA-ACEW, a multi-authority anonymous credential scheme that weights authorities differently during credential issuance, targeting decentralized systems such as Proof-of-Stake networks. Its core primitive, Epoch-Bound Pointcheval-Sanders Signatures (EB-PS), binds signatures to time epochs, enabling non-interactive credential updates when authority weight distributions change. The authors formalize EUF-eCMA unforgeability and prove unforgeability, anonymity, and blindness under a novel STB-GPS assumption. Aggregating a credential from 128 partial credentials takes about 10.68 ms on average.

arXiv cs.CR · 16h agoResearch

HYDRA: Quantifying Botnet Resource Thresholds for Efficient Link-Flooding Attacks on LEO Satellite Networks

HYDRA models link-flooding attacks on LEO satellite constellations as botnet minimization, matching prior disruption with 34% fewer bots and 23% less traffic.

HYDRA formulates link-flooding attack variants against LEO constellations such as Starlink and Kuiper as botnet minimization problems, quantifying the smallest bot subset and traffic allocation needed to disrupt communications between targeted geographic areas. Under matched stealth constraints it matches the ICARUS attack's disruption using 34% fewer bots and 23% less aggregate traffic, sustaining over 97% attack success as topology evolves. The framework also evaluates five mitigations, including routing diversification, ingress policing, distance-based constraints, source throttling, and botnet attrition.

arXiv cs.CR · 2d agoResearch

A Cyber Range Evaluation of Autonomous Network Incident Response Agents

Cyber range evaluation shows reinforcement learning incident response agents defend emulated networks more efficiently than heuristic policies, depending heavily on adversary behavior.

The paper evaluates agents for automated network intrusion response in a cyber range designed for human operator training, featuring variable topology, red-team emulation, and simulated users. Alerts are generated by a SIEM platform and mapped to a data modeling language used by the agents, with reinforcement learning policies optimized to minimize combined defense and availability costs using a cyber attack simulator. Reinforcement learning agents defended the system more efficiently than heuristic policies, with performance highly dependent on the adversary policy and simulated user behavior.

arXiv cs.CR · 2d agoResearch

Unmasking Cloud Identities: From Behavioral Clustering to Automated Detection

Unit 42 clusters behavior of 40,000+ AWS identities from 125 cloud environments to map functional roles and enable lightweight SQL-based detection.

Palo Alto Unit 42 built an unsupervised behavioral clustering model using UMAP and HDBSCAN on AWS CloudTrail logs to map cloud identities to functional roles such as administrators, backup services, security tooling and DevOps. The study analyzed over 40,000 identities across 125 cloud environments over two months. The researchers show that heuristics extracted from the clustering map can be implemented in standard SQL, enabling role classification at scale without running a continuous ML pipeline. The methodology extends to audit logs from other cloud providers, SaaS and Kubernetes.

Palo Alto Unit 42 · 2d agoResearch

Normal Alignment: Improved Cryptanalytic Sign Recovery on Hard-Label Networks

Researchers propose Normal Alignment, improving cryptanalytic sign recovery for hard-label neural networks and enabling polynomial-time full model extraction.

The paper improves on Carlini et al.'s EUROCRYPT 2025 cryptanalytic extraction of hard-label (S1) DNNs, whose Future Toggle sign-recovery method offered only marginal advantage over random guessing and triggered exponential-time enumeration on errors. Normal Alignment infers neuron signs via expected length differences between projected normals of adjacent decision facets at dual points, delivering higher voting accuracy and low-confidence errors. Combined with the SOE extension, it achieves exact polynomial-time full sign recovery: CIFAR-10 (192-64x8-10) and MNIST (64-96x3-32-10) models are fully recovered where the prior method required 2^52 or 2^82 sign guesses.

arXiv cs.CR · 16h agoResearch

A GAN-Based Framework for Robust DDoS Attack Detection

WGAN-GP-generated adversarial DDoS traffic augments training data, improving detection resilience against evasion attempts.

Researchers built a DDoS detection framework combining Random Forests, deep neural ensembles, and Transformer-based models trained on CICDDoS2019 with synthetic adversarial flows generated by a Wasserstein GAN with gradient penalty. Hybrid datasets of benign, malicious, and generated traffic taught models more generalizable decision boundaries. Experiments showed improved accuracy and resilience against unseen adversarial traffic, validated on real-world generated flows.

arXiv cs.CR · 23h agoResearch

Building a Linux GPU Driver for the M4 Mac Mini in One Month

Two developers built a fully OpenGL ES 3.0 compliant Linux GPU driver for the M4 Mac Mini in one month via clean-room reverse engineering.

Niklas and the author reverse engineered Apple's AGX GPU firmware ABI and user-space components in about a month, a process that normally takes years, producing an OpenGL ES 3.0 conformant driver fast enough to run Minecraft at 200fps on an M4 Mac Mini. The work was done transparently using hypervisor traces without examining Apple binaries, following clean-room practices, and included a custom shader compiler, command stream builder, and a full Linux kernel driver for the firmware ABI. The A18 Pro firmware ABI proved significantly more complex than the M1's, with 1.5x as many structs and twice as many pointers. All experiments and provenance evidence were published in public agx-re repositories.

Hacker News · AI · 1d agoResearchHN 40↑ · 5 comments

You Shall Not Pass into Ring-0! A User Privacy-Friendly Anti-Cheat Architecture for Personal Computers

Tirith replaces invasive kernel-level game anti-cheats with protected VMs and a dual-trusted virtualization monitor, preserving detection and near-native performance.

Researchers present Tirith, an anti-cheat architecture that runs video games in Protected Virtual Machines, sandboxing computations from untrusted root admins, and uses a virtualization monitor trusted by both players and developers to watch for malicious drivers. This removes the need for privacy-invasive ring-0 kernel anti-cheat components while matching their protection against a wide range of cheating mechanisms. To overcome VM stack limitations, the work contributes a security-focused Library OS kernel for games and an efficient graphics sharing pipeline for near-native rendering performance.

arXiv cs.CR · 1d agoResearch

OptiPrime: Optimizing Private Inference through Protocol-Hardware Co-design

OptiPrime co-designs HE-MPC protocols with hardware acceleration to remove network communication bottlenecks in private DNN inference, beating Cheetah by up to 5.7x.

OptiPrime is a protocol-hardware co-optimization framework for private deep neural network inference based on hybrid homomorphic encryption (HE) and multi-party computation (MPC). It introduces a novel HE protocol for convolutions that reduces the number of transmitted output ciphertexts, addressing the network bottleneck that limits gains from commercial HE accelerators. A lightweight compression system reduces weight plaintext memory traffic by 10x, while a specialized dataflow maximizes on-chip reuse of intermediate ciphertexts. Experiments show up to 5.7x speedup over the Cheetah baseline on CPUs and 4.2x with an accelerator.

arXiv cs.CR · 1d agoResearch

The MAL Simulator: Cyber Operations Simulation based on Attack & Defense Graphs

MAL Simulator grounds attack-defense graph simulations in a CRATE-emulated network, training RL attacker and defender agents where attackers outperform search methods.

The MAL Simulator is a cyber operations simulator built on the Meta Attack Language (MAL), enabling decision-driven attack and defense simulations adaptable to new domains without modifying source code. Case studies trained defensive and offensive agents, grounded in data collected from an emulated network implemented in the CRATE cyber range. The trained attacker policy reached designated targets more efficiently than compared search methods, and the trained defender induced lower costs than a naive heuristic under noisy alerts, though defender performance dropped significantly against an RL attacker.

arXiv cs.CR · 2d agoResearch

Large Universe Subset Predicate Encryption with IND-CCA Security (with Constant-size Ciphertext and Keys)

New construction achieves first large-universe subset predicate encryption with IND-CCA security and constant-size ciphertexts and keys under subgroup decision assumptions.

The paper proposes the first large-universe subset predicate encryption scheme achieving IND-CCA security with both constant-size ciphertexts and constant-size secret keys. Prior large-universe constructions by Chatterjee and Mukherjee either achieved only restricted selective security with constant sizes or adaptive security with attribute-dependent ciphertext size, and none achieved CCA security. The new construction is proven selectively secure under standard subgroup decision problems. Black-box transformations yield the first CCA-secure WIBE and WKD-IBE with constant-size ciphertexts and keys.

arXiv cs.CR · 2d agoResearch