MoneroResearch.info

WIKINDX Resources

Cachin, C., & Wicht, F.-X. (2025). Toxic Decoys: A Path to Scaling Privacy-Preserving Cryptocurrencies. Proceedings on Privacy Enhancing Technologies, 2025(4), 926–943. 
Added by: Rucknium (17/11/2026, 18:04)   
Resource type: Journal Article
DOI: 10.56553/popets-2025-0165
ID no. (ISBN etc.): 2299-0984
BibTeX citation key: anon2025e
View all bibliographic details
Categories: Monero-focused
Creators: Cachin, Wicht
Collection: Proceedings on Privacy Enhancing Technologies
Views: 3/15
Attachments   popets-2025-0165.pdf [0/0] URLs   https://petsymposi ... pets-2025-0165.php
Abstract
Anonymous cryptocurrencies attracted much attention over the past decade, yet ensuring both integrity and privacy in an open system remains challenging. Their transactions preserve privacy because they do not reveal on which earlier transaction they depend, specifically which outputs of previous transactions are spent. However, achieving privacy imposes a significant storage overhead due to two current limitations. First, the set of potentially unspent outputs of transactions grows indefinitely because the design hides cryptographically which one have been consumed; and, second, additional data must be stored for each spent output to ensure integrity, that is, to prevent that it can be spent again. We introduce a privacy-preserving payment scheme that mitigates these issues by randomly partitioning unspent outputs into fixed-size bins. Once a bin has been referenced in as many transactions as its size, it is pruned from the ledger. This approach reduces storage overhead while preserving privacy. We first highlight the scalability benefits of using smaller untraceability sets instead of considering the entire set of outputs, as done in several privacy-preserving cryptocurrencies. We then formalize the security and privacy notions required for a scalable, privacy-preserving payment system and analyze how randomized partitioning plays a key role in both untraceability and scalability. To instantiate our approach, we provide a construction based on Merkle trees, which ensures efficient argument systems and easy pruning of the state. We finally show the storage benefits of our scheme and analyze its resilience against large-scale flooding attacks using empirical transaction data.
Added by: Rucknium  
WIKINDX 6.12.1 | Total resources: 313 | Username: -- | Bibliography: WIKINDX Master Bibliography | Style: American Psychological Association (APA) | Time Zone: UTC (Z)