CS & research
5 items · 19 articles in this topic
A quiet day for non-AI research, with practical systems posts and one language-governance paper from the C++ committee.
- 1
Herb Sutter's paper P4454R0 discusses disagreement between a language's creator and its owners, using C++26 post-DIS as the example.
NotableHacker News (front page) ↗
- 2
Sem86 is a full-system x86 emulator that derives instruction behavior from specifications rather than hardcoded semantics.
- 3
An arXiv paper analyzes performance bottlenecks in GPU-accelerated PlonK zero-knowledge proof generation for large constraint sets.
- 4
A blog post presents a C++ quicksort implementation, blqsort, claimed to outperform std::sort. The summary gives no benchmark numbers.
Lobsters ↗27 min read
- 5
A Lobsters post explains what the malloc memory allocator does internally.
Lobsters ↗13 min read
More in CS & research · 14 articles›
A Lobsters post discusses tricks related to public key cryptography.
LobsterscryptographydiscussionFeed excerpt
Comments
Proposes a method for model-checking execution traces from negative tests to detect security property violations in cryptographic protocols.
arXiv cs.CR (Cryptography & Security)cryptographic-protocolsformal-verificationFeed excerpt
arXiv:2611.09315v1 Announce Type: new Abstract: Developing cryptographic protocols that are free from vulnerabilities is very challenging, as evidenced by numerous design flaws and implementation bugs in widely used protocols. Recent work has leveraged model checking to generate negative test cases, that is test cases that include the behavior of Dolev-Yao attacker. In this paper, we address the problem of analyzing execution traces produced by testing protocol implementations with such negative test cases. We propose a method for detecting violations of security properties by model-checking execution traces. Our approach employs a model checker based on DLTL, a Linear Temporal Logic with freeze operators, and supports automation of the testing process through pre- and post-processing steps. These steps, respectively, bridge the gap between different levels of abstraction and synthesize the results produced by the model checker.We present experimental results as a proof of concept for the feasibility of the proposed method.
A study of differentially private least-squares linear regression in batch and continual observation settings, with improved continual-setting bounds.
arXiv cs.CR (Cryptography & Security)differential-privacytheoryFeed excerpt
arXiv:2611.08737v1 Announce Type: cross Abstract: We study the classic least-squares linear regression problem under differential privacy (DP) in the batch and the continual observation setting. In the latter setting, the mechanism receives a stream of $n$ data points $(x_i,y_i)$ ($x_i\in\mathbb{R}^d$ and $y_i\in\mathbb{R}$) and must output an estimate of the optimal parameters at each time step $i$. Although differentially private linear regression has been extensively studied in the batch setting, the problem remains underexplored for the continual setting, with prior work being restricted to constrained linear regression and update time polynomial in $n$. In this work, we introduce ContinualAdaSSP, the first mechanism for unconstrained linear regression under continual differential privacy. Our mechanism's suboptimality gap is proportional to $\sqrt{d}\operatorname{polylog}(n)$. It requires $O(d^2\log{n})$ space and $O(d^2\log{n}+d^{\omega})$ update time, where $d$ is the dimension of the input space. We also study fundamental limits of differentially private linear regression by showing the first lower bounds for the box-constrained least-squares linear regression problem. Our …
Proposes replication certificates, cryptographically signed records of deposited research files and logged outputs, to make reproducibility checkable.
arXiv cs.CR (Cryptography & Security)reproducibilitycryptographyopen-scienceFeed excerpt
arXiv:2611.09214v1 Announce Type: cross Abstract: Authors increasingly deposit replication datasets---the data and code behind publications---in archives, and journals increasingly require them to, under progressively onerous rules. But a deposit alone proves little, so authors keep paying: months for the journal's reanalyses, years answering readers' questions, and rancor as failed replications become accusations because no record establishes what actually ran. We introduce a replication certificate: a cryptographically signed record of the deposited files and logged output. It replaces the journal's reanalyses with evidence anyone can check in seconds, which no one, including the archive, can backdate, and no one can fake without risking detection. Certification asks little of anyone and benefits everyone: The author deposits, then reruns the analysis once under a random seed the archive computes from the deposit's hash and a blockchain block; the archive signs, timestamps (in that blockchain), and stores the record---confidential data included---without rerunning anything; the journal merely checks a website for the certificate; and anyone can check or replay any step decades la…
Compares Fit-Then-Protect and Protect-Then-Fit pipelines for differentially private functional mean estimation, analyzing their ordering of privatization and smoothing.
arXiv cs.CR (Cryptography & Security)differential-privacystatisticsFeed excerpt
arXiv:2611.09799v1 Announce Type: cross Abstract: Differential privacy (DP) is a leading framework for privacy protection, yet privacy mechanisms tailored to functional data analysis (FDA) remain relatively underexplored. For functional mean estimation, we investigate a fundamental question regarding the ordering of privatization and estimation by comparing two canonical pipelines: Fit-Then-Protect (FTP), which smooths trajectories before privatization, and Protect-Then-Fit (PTF), which privatizes observations at discrete time points before smoothing. When data are observed without error, we prove that FTP achieves strictly smaller mean squared error than PTF asymptotically (as the sample size increases) under the same $\mu$-Gaussian differential privacy ($\mu$-GDP) budget in both finite-dimensional Hilbert spaces and infinite-dimensional reproducing kernel Hilbert spaces (RKHS). Simulation studies support our theory and explore settings with observation error and fitting constraints, demonstrating that FTP outperforms PTF under small observation noise, whereas PTF can become preferable in high-noise settings. In addition to this comparison, we establish a novel GDP guarantee for G…
Characterizes privacy filters via a Bellman equation and introduces a Gaussian DP residue filter that improves on the naive filter.
arXiv cs.CR (Cryptography & Security)differential-privacytheoryFeed excerpt
arXiv:2602.15815v3 Announce Type: replace Abstract: We study privacy filters, which enable privacy accounting for differentially private (DP) mechanisms with adaptively chosen privacy characteristics. We show that the worst-case privacy loss of interacting with any privacy filter is characterized by a Bellman equation. We apply this theory to develop residue filters, which unify existing privacy filters. We develop the Gaussian DP (GDP) residue filter, which strictly improves upon the na\"ive GDP filter. We show that, in the average case, this new filter asymptotically permits as many pure DP queries as in the non-adaptive case and a factor $\pi/2$ more pure DP queries than the na\"ive GDP filter. We also show that residue filters capture the natural filter, which promises greater utility by leveraging exact privacy accounting techniques. Earlier privacy filters consider only simple privacy parameters such as R\'enyi-DP or GDP parameters. Natural filters account for the entire privacy profile of every query, promising more efficient use of a given privacy budget. We show that, contrary to other forms of DP, natural privacy filters are not free in general. We present a characterizat…
A paper proposes a liquid democracy delegation mechanism that hides delegations to reduce herding and coercion vulnerabilities.
arXiv cs.CR (Cryptography & Security)votinggovernancecryptographyFeed excerpt
arXiv:2607.01730v4 Announce Type: replace Abstract: Liquid democracy lets voters either vote directly or delegate their voting power to another trusted participant. It is often deployed in political parties, municipal participation platforms, and the governance of decentralized autonomous organizations. Existing approaches make delegations publicly visible as they form, which results in herding driven by popularity, makes coercion verifiable, and leaves the election fragile when popular delegates abstain. We propose a novel liquid democracy mechanism that removes these vulnerabilities, while keeping the tally fully auditable. Delegation choices are sealed with decentralized timed-release encryption, while they are formed and before revealed in full for tallying. Each voter determines ranked backup delegates together with a personal fallback ballot so that delegation failures do not result in abstaining. Experiments grounded in real-world voting data show that the mechanism keeps voting power dispersed, whereas transparent formation concentrates it into few hands. Strikingly, vote loss under targeted delegate failures falls from 26% to 3%.
AuditLock proposes pre-specified locked audits with simultaneous finite-sample bounds for verifying synthetic tabular data releases.
arXiv cs.CR (Cryptography & Security)privacysynthetic-datastatisticsFeed excerpt
arXiv:2608.14753v3 Announce Type: replace Abstract: A statistical office with a synthetic version of a protected file must decide whether it may be released for a stated purpose. We study the locked audit, a pre-specified and simultaneous form of the verification servers used in official statistics. Before a protected audit sample is opened, the custodian fixes the use, the candidates, the analyses, a tolerance for each and the schedule. The audit then reports simultaneous finite-sample bounds on paired loss gaps, and a declared negative control must fail. We correct an anytime-valid sequence that an earlier release had implemented with a variance penalty four times too small. Two confirmatory rounds were pre-specified in a hash-locked local ledger and publicly timestamped only after the audits. The control and ideal-generator outcomes were near-certain by design. A Gaussian copula certified in every cell, but only inside the rounding step of the tolerance rule. A second transparent candidate certified once, against a written prediction. Learned models, at library defaults and 4,000 training rows, certified in one of 18 fits in round 1 and in none of 12 tables in round 2. The paper…
A paper optimizes credential blast radius across trust domains under post-quantum authentication latency costs.
arXiv cs.CR (Cryptography & Security)post-quantumauthenticationtrust-domainsFeed excerpt
arXiv:2609.04566v3 Announce Type: replace Abstract: Partitioning interacting services into independently rooted trust domains limits issuer-compromise reach while increasing calls across trust boundaries. Post-quantum replacements for public-key authentication and key-establishment mechanisms can increase crossing latency on constrained or lossy paths. We formulate the joint selection of trust domains and credential-derivation structures under policy and latency constraints, linking separate service-interaction and credential-derivation graphs through domain assignment. Credential blast radius measures weighted service impact after compromise. A linear upper bound supports optimization, while a joint event model gives exact expected impact. We identify when risk from issuers trusted across domains can be incorporated into this linear score, avoiding separate issuer-propagation calculations for each candidate. Although the general problem is NP-hard, we identify restricted cases that can be solved efficiently and exactly. Joint optimization yields lower blast radius than choosing boundaries first in 195 of 230 exhaustive synthetic comparisons, especially under chained delegation. A …
A method removes video watermarks with temporally consistent output, avoiding the flickering of image-domain removal attacks.
arXiv cs.CR (Cryptography & Security)watermarkingvideocopyrightFeed excerpt
arXiv:2610.22457v2 Announce Type: replace Abstract: Recent advances in video generation have increased the demand for reliable watermarking for copyright protection, yet the robustness of video watermarks against removal attacks remains underexplored. Most watermark-removal methods originate from the image domain: signal optimization injects imperceptible pixel-domain perturbations, whereas generative resynthesis produces a visually similar instance through diffusion synthesis. When extended to videos, the former introduces temporally varying noise that causes visible flickering, while the latter regenerates fine-grained structures inconsistently across frames, leading to structural motion inconsistency. To evaluate video watermark robustness, we propose PoseRegen, a pose-consistent reconstruction framework that removes watermarks while preserving the original content and motion. PoseRegen first applies a temporally shared viewpoint transformation to disrupt watermark-bearing spatial patterns and then jointly reconstructs the transformed sequence with a pose-conditioned video model. A frozen video DiT processes the complete sequence with its reference-video latent, and full-sequenc…
An exact attenuation formula describes how randomized response under differential privacy affects multivariate cross-moments.
arXiv cs.CR (Cryptography & Security)differential-privacystatisticsFeed excerpt
arXiv:2610.26460v2 Announce Type: replace Abstract: This paper derives an exact attenuation formula for multivariate cross-moments under differential privacy achieved through randomized response. From a proposed alternative formulation of randomization matrices compliant with differential privacy guarantees we show that, under attribute-level randomization and where the randomization of the whole distribution is characterized by Kronecker products, any cross-moment of the anonymized dataset involving distinct attributes is equal to the original cross-moment multiplied by attenuation parameters, themselves determined by the part of the overall privacy budget allocated to each attribute. This characterization enables explicit and transparent controls of multivariate relationships preservations in differential privacy through privacy budget allocation. A simple numerical illustration demonstrates that identical total budgets can yield substantially different covariance-preservation profiles. The results also make the multiplicative loss of higher-order interactions explicit and thus can support mechanism design guided by analytical priorities.
AQUA proposes a modular framework for modeling authentication quality by separating effects of individual authentication design aspects.
arXiv cs.CR (Cryptography & Security)authenticationusabilitypasskeysFeed excerpt
arXiv:2611.05660v2 Announce Type: replace Abstract: Authentication solutions are the key design, architectural, and implementation decisions that implement authentication security controls. An example is a password-based authentication solution. While researchers often examine authentication quality, existing approaches do not distinguish which effects on quality stem from which aspect of authentication. For example, multi-factor authentication solutions tend to be less usable because they combine multiple authenticators, whereas passkeys are more secure than passwords because of properties inherent to the authenticator itself. This paper presents AQUA, a modular quality modeling framework for authentication solutions. AQUA's core idea is to decompose authentication into four interrelated concepts, enabling modular specification of authentication quality and tracing quality effects back to their source. We demonstrate AQUA with initial definitional quality models that address the levels of authenticators, authentication techniques, and authentication solutions. We further illustrate the interrelations between these concepts through concrete examples and a usability metric, showing …
PACZero applies PAC privacy with sign quantization to zeroth-order fine-tuning of language models to improve the privacy-utility trade-off.
arXiv cs.CR (Cryptography & Security)privacyfine-tuningllmFeed excerpt
arXiv:2605.06505v3 Announce Type: replace-cross Abstract: Differentially private (DP) zeroth-order (ZO) fine-tuning of large language models (LLMs) inherits DP's harsh utility-privacy trade-off. PAC Privacy, an instance-based notion, offers an alternative. It bounds the mutual information (MI) between the secret input and the output, and calibrates the noise to the stability of the output under the input distribution. We introduce PACZero, a family of ZO fine-tuning mechanisms under PAC Privacy. For stability, PACZero quantizes each update to a single bit, the sign of the ZO update aggregated over the secret subset of the training data. On many steps all candidate subsets agree on this sign, so the bit can be released at no cost in MI. On the remaining steps the bit passes through a noisy channel calibrated to a per-step MI budget. We study two channels, the standard additive Gaussian channel of PAC Privacy (PACZero-AGC) and a binary asymmetric channel with optimal bit flipping (PACZero-BAC), along with their zero-budget versions at $\mathrm{MI} \to 0$, PACZero-AGC$_0$ and PACZero-BAC$_0$. At zero MI, nothing released during training, including the fine-tuned model, carries any inf…
Introduces SCDBench, a benchmark for evaluating LLM-based smart contract decompilers on semantic consistency with original contracts.
arXiv cs.CR (Cryptography & Security)smart-contractsdecompilationbenchmarkFeed excerpt
arXiv:2605.29059v2 Announce Type: replace-cross Abstract: Smart contract decompilation aims to recover high-level source code from bytecode, but evaluating decompilers remains difficult because existing studies use narrow datasets, inconsistent metrics, and limited semantic consistency checks. This gap is increasingly important as large language models (LLMs) begin to generate source-like Solidity that may compile and appear plausible, even when its semantics diverge from the original contract. We introduce SCDBench, a dataset and benchmark methodology for LLM-based smart contract decompilation. The dataset contains 600 real-world Solidity contracts with paired bytecode inputs, ground-truth source code, and replayable semantic checkpoints. SCDBench evaluates decompiler outputs through four cumulative stages: format completeness, compilability, Application Binary Interface (ABI) recovery, and semantic consistency via differential replay. We evaluate Claude Opus 4.7, GPT-5.3-Codex, and GLM-5 in a zero-shot decompilation setting, including GLM-5 variants with and without extended reasoning and a zero-shot compilation-repair setting. The results show that frontier LLMs can often produc…