THE DAILY EDITION

CS & research

6 items · 13 articles in this topic

A light day: hardware experimentation at Los Alamos, formal verification, and a cluster of privacy and verified-compilation papers.

  1. 1

    Los Alamos will test NextSilicon's Maverick-2 in its Darwin testbed, exploring GPU-less supercomputing with adaptive hardware.

    NotableThe Register ↗2 min read
  2. 2

    A Xena Project blog post reports a mathematical proof has been checked in the Lean theorem prover.

    Hacker News (front page) ↗12 min read
  3. 3

    BlueDown is a postprocessing algorithm that reduces error in differentially private 2020 US Census demographic tables using regression and constrained optimization.

  4. 4

    VellSSLH selectively applies speculative load hardening in LLVM IR to cut runtime overhead while preventing speculative secret leaks.

  5. 5

    DeCompCert is a Rocq-verified decompiler that reconstructs CompCert C from AArch64 assembly generated by CompCert.

  6. 6

    A blog post explains how Rust declarative macros are organized, scoped and used in common patterns.

    NotableLobsters ↗21 min read
More in CS & research · 7 articles›
  • A retrocomputing Stack Exchange question examines whether the Apollo Guidance Computer really used 60% of world ICs in 1963.

    Hacker News (front page)historyhardwareapollo
    Feed excerpt

    Article URL: https://retrocomputing.stackexchange.com/questions/12158/did-the-apollo-guidance-computer-really-use-60-of-the-worlds-ics-in-1963 Comments URL: https://news.ycombinator.com/item?id=50514257 Points: 9 # Comments: 1

  • Paper proposes Structural Gradient Alignment, a robustness metric for evaluating adversarial vulnerability of vision and vision-language models.

    arXiv cs.CR (Cryptography & Security)adversarial-mlevaluationvision-models
    Feed excerpt

    arXiv:2611.17377v1 Announce Type: new Abstract: Visual adversarial robustness remains a fundamental security property as vision systems evolve from conventional classifiers to vision-language models (VLMs) and large vision-language models (LVLMs), with visual inputs remaining an attack surface across generations. Yet existing evaluation methods often depend on prescribed attacks, in-distribution data, extensive probing, or classifier-specific formulations, limiting external auditing of diverse models. We introduce Structural Gradient Alignment (SGA), a complementary robustness metric measuring the structural alignment between input content and objective-conditioned local model sensitivity. SGA uses a few randomly sampled, unlabeled public probes that need not follow the downstream task distribution and only one input-gradient computation per model--probe pair. Across 38 distinct DNNs, VLMs, and LVLMs, SGA produces rankings consistent with attack-based references. Without robustness references, uncalibrated SGA achieves $83.72\%$ average pairwise agreement across eight public-probe conditions, outperforming the strongest overall baseline in all eight by $9.38$ percentage points on a…

  • Paper formalizes differential privacy for online allocation problems and proposes the PPOA meta algorithm.

    arXiv cs.CR (Cryptography & Security)differential-privacyalgorithms
    Feed excerpt

    arXiv:2611.17554v1 Announce Type: new Abstract: We study private online allocation problems, where allocation decisions must satisfy differential privacy (DP) to protect sensitive user information while optimizing performance under limited resources. We first formalize differential privacy notions suited to different privacy requirements in online allocation and establish the fundamental performance limits of any algorithm under these definitions. Based on these insights, we propose PPOA, a privacy-preserving meta algorithm for online allocation, and establish sufficient conditions under which PPOA preserves Joint DP (JDP) or Local DP (LDP) while achieving asymptotically near-optimal performance. Building on these conditions, PPOA can be instantiated into a variety of concrete algorithms. In particular, we present the specific designs, which include PPOA-DMD that preserves JDP and LDP and PPOA-FTRL that preserves JDP. We analyze their performance under both adversarial and stochastic settings and characterize the fundamental trade-offs between DP and allocation performance. Finally, we demonstrate the superior performance of the proposed algorithms via numerical experiments on AI m…

  • Paper presents importance sampling to make Monte Carlo differential privacy accounting tractable for small delta values.

    arXiv cs.CR (Cryptography & Security)differential-privacymonte-carlo
    Feed excerpt

    arXiv:2611.17596v1 Announce Type: new Abstract: Evaluating tight Differential Privacy (DP) parameters for DP matrix factorization with privacy amplification by sampling requires analyzing high-dimensional, correlated Gaussian mixtures. Because integrating these mixture distributions to find the exact privacy failure probability ($\delta$) is analytically intractable, these mechanisms are typically analyzed using Monte Carlo accounting. However, standard sampling suffers from prohibitive variance when estimating small $\delta$ associated with strict privacy guarantees, which in turn requires a large sample complexity, making Monte Carlo accounting inefficient. We demonstrate that Monte Carlo accounting can be made much more efficient via importance sampling. We give a shifted importance sampling proposal distribution parameterized by a stretch factor $\alpha > 1$. We prove a closed-form bound $B(\alpha) < 1$ on the support of the importance-weighted estimator that holds identically for both directions of the hockey-stick divergence, show that $B$ is log-convex so that the optimal $\alpha$ is a one-dimensional root-finding problem, and show that the resulting estimator seamlessly plu…

  • Proposes a blockchain-based generative federated learning framework for privacy-preserving healthcare analytics across institutions.

    arXiv cs.CR (Cryptography & Security)federated-learningblockchainhealthcare
    Feed excerpt

    arXiv:2611.17703v1 Announce Type: new Abstract: Healthcare organizations collect huge amounts of patient data from clinical records, medical tests, monitoring systems, and healthcare services. Such data can underpin intelligent healthcare analytics but remains distributed across institutions and cannot be shared directly due to privacy, security, and trust concerns. Federated learning (FL) enables collaborative learning without sharing raw patient records, but the exchanged model information remains vulnerable to privacy leakage, tampering, replay, and unauthorized access. In this paper, we propose iGRAIL, a blockchain-enabled generative FL framework for trustworthy healthcare intelligence. iGRAIL combines local generative learning for data augmentation with differential privacy to protect sensitive information during local training. Model communication is secured using cryptographic mechanisms, and blockchain-based verification and smart-contract access control ensure that only authorized, authentic, fresh, and integrity-preserving updates are accepted for federated aggregation. The framework is evaluated on four healthcare datasets and compared with the conventional FL and blockc…

  • Studies quadratic APN functions over F_2^10 that have nontrivial linear self-equivalences of prime order, a cryptographic Boolean function result.

    arXiv cs.CR (Cryptography & Security)cryptographyapn-functions
    Feed excerpt

    arXiv:2611.18358v1 Announce Type: cross Abstract: Almost perfect nonlinear (APN) functions of $\mathbb{F}_2^n$ have the lowest possible differential uniformity. The only known APN permutation in even dimension, in dimension six, is equivalent to a quadratic APN function with a nontrivial linear self-equivalence; no APN permutation is known for even $n \geq 8$. In a published collection of about 3.8 million quadratic APN classes of dimension eight, at most 0.34% have a nontrivial linear self-equivalence. In dimension ten, the 25 literature classes considered here all have one. We study all quadratic APN functions of $\mathbb{F}_2^{10}$ with such a self-equivalence, which usually confines them to a much smaller linear space. Up to conjugacy and power similarity, self-equivalences of prime order have 299 types. We settle 298 of them. Elementary lemmas exclude 280 types, and exhaustive searches confirm this for 242 of them. The other 18 types are settled by exhaustive searches with exact equivalence certificates. Up to extended affine equivalence, the 298 types contain 29 classes of quadratic APN functions, four of them new. This also classifies the quadratic APN functions with coeffic…

  • VerfGraph presents a zero-knowledge system for verifiable evaluation of multi-hop and shortest-path graph queries on private databases.

    arXiv cs.CR (Cryptography & Security)zero-knowledgegraph-database
    Feed excerpt

    arXiv:2611.04240v2 Announce Type: replace Abstract: Graph databases are widely used to manage relationship-rich data and support multi-hop traversal and shortest-path queries in applications such as financial risk control and social networks. When a client issues such queries to a database owner, the returned result may be incorrect. However, the client cannot directly verify it because the graph is typically large and private, making re-executing the query both infeasible and insecure. Verifiable and confidential graph query evaluation thus plays an important role in such applications. We present VerfGraph, a zero-knowledge verifiable graph query evaluation system, which enables a client to verify that the query result was correctly computed over a committed graph, without revealing anything beyond the public inputs and what is implied by the query result. While adopting the expansion-centric operator model introduced by ZKGraph (ICDE'26), VerfGraph improves both proving efficiency and query expressiveness in two key ways. First, we propose new proof methods for the core operators in ZKGraph, such as graph expansion and shortest path, that require substantially fewer expensive com…

Written by claude-sonnet-5-5 from feed titles and summaries. The model can misstate details; every claim links to its source.