SearcharxivSearch

arXiv subjects

Brian Neil Levine

Publications and source records attributed to Brian Neil Levine.

4 recordsLinked to original sources

Contrastive Privacy: A Semantic Approach to Measuring Privacy of AI-based Sanitization

AI-based sanitization can remove concepts from images and text, but privacy evaluation remains largely ad hoc. We propose contrastive privacy, a formal definition that yields a quantitative test with a semantic interpretation. Under formal assumptions, we derive a conditional sufficiency result for a class of sanitized renderings (i.e., media files). We operationalize the definition using imperfect semantic-distance models such as CLIP. The test compares sanitized renderings under audit with both the original and sanitized versions of reference renderings known to contain privacy-relevant properties; if the rendering under audit is semantically closer to the unsanitized reference, then the former might leak private information even after sanitization. Importantly, the test is able to conditionally audit an abstract privacy target without enumerating its constituent properties or requiring per-item ground-truth labels; results remain relative to the chosen models and data. We evaluate 34 image-sanitization configurations, 15 social-media text models and one entity recognizer, and four off-the-shelf PII sanitizers on Enron emails. The tests detect residual semantic associations in every setting, including all four PII tools even when they sanitize every candidate their detectors return. Two further studies examine sensitivity to the semantic-distance model. For a synthetic identity, fine-tuning reveals target associations missed by the base model; after broader sanitization, the adapted test detects none. Across 94 matched image collections sanitized to conceal Leonardo DiCaprio's identity, three models yield broadly correlated assessments but sometimes disagree on which sanitizations appear most private. These findings support using multiple models and show how contrastive privacy can reveal retained identifiers and identity-revealing context across sanitization methods.

cs.CR

Bobtail: A Proof-of-Work Target that Minimizes Blockchain Mining Variance (Draft)

Blockchain systems are designed to produce blocks at a constant average rate. The most popular systems currently employ a Proof of Work (PoW) algorithm as a means of creating these blocks. Bitcoin produces, on average, one block every 10 minutes. An unfortunate limitation of all deployed PoW blockchain systems is that the time between blocks has high variance. For example, 5% of the time, Bitcoin's inter-block time is at least 40 minutes. This variance impedes the consistent flow of validated transactions through the system. We propose an alternative process for PoW-based block discovery that results in an inter-block time with significantly lower variance. Our algorithm, called Bobtail, generalizes the current algorithm by comparing the mean of the k lowest order statistics to a target. We show that the variance of inter-block times decreases as k increases. If our approach were applied to Bitcoin, about 80% of blocks would be found within 7 to 12 minutes, and nearly every block would be found within 5 to 18 minutes; the average inter-block time would remain at 10 minutes. Further, we show that low-variance mining significantly thwarts doublespend and selfish mining attacks. For Bitcoin and Ethereum currently (k=1), an attacker with 40% of the mining power will succeed with 30% probability when the merchant sets up an embargo of 8 blocks; however, when k>=20, the probability of success falls to less than 1%. Similarly, for Bitcoin and Ethereum currently, a selfish miner with 40% of the mining power will claim about 66% of blocks; however, when k>=5, the same miner will find that selfish mining is less successful than honest mining. The cost of our approach is a larger block header.

cs.CR

An Explanation of Nakamoto's Analysis of Double-spend Attacks

The fundamental attack against blockchain systems is the double-spend attack. In this tutorial, we provide a very detailed explanation of just one section of Satoshi Nakamoto's original paper where the attack's probability of success is stated. We show the derivation of the mathematics relied upon by Nakamoto to create a model of the attack. We also validate the model with a Monte Carlo simulation, and we determine which model component is not perfect.

cs.CR

An Analysis of Attacks on Blockchain Consensus

We present and validate a novel mathematical model of the blockchain mining process and use it to conduct an economic evaluation of the double-spend attack, which is fundamental to all blockchain systems. Our analysis focuses on the value of transactions that can be secured under a conventional double-spend attack, both with and without a concurrent eclipse attack. Our model quantifies the importance of several factors that determine the attack's success, including confirmation depth, attacker mining power, and any confirmation deadline set by the merchant. In general, the security of a transaction against a double-spend attack increases roughly logarithmically with the depth of the block, made easier by the increasing sum of coin turned-over (between individuals) in the blocks, but more difficult by the increasing proof of work required. In recent blockchain data, we observed a median block turnover value of 6 BTC. Based on this value, a merchant requiring a single confirmation is protected against only attackers that can increase the current mining power by 1% or less. However, similar analysis shows that a merchant that requires a much longer 72 confirmations (~12 hours) will eliminate all potential profit for any double-spend attacker adding mining power less than 40% of the current mining power.

cs.CR