- Journal Details
- Format
- Journal
- First Published
- 16 Apr 2015
- Publication timeframe
- 4 times per year
- Languages
- English
A ring signature scheme allows the signer to sign on behalf of an ad hoc set of users, called a ring. The verifier can be convinced that a ring member signs, but cannot point to the exact signer. Ring signatures have become increasingly important today with their deployment in anonymous cryptocurrencies. Conventionally, it is implicitly assumed that all ring members are equally likely to be the signer. This assumption is generally false in reality, leading to various practical and devastating deanonymizing attacks in Monero, one of the largest anonymous cryptocurrencies. These attacks highlight the unsatisfactory situation that how a ring should be chosen is poorly understood.
We propose an analytical model of ring samplers towards a deeper understanding of them through systematic studies. Our model helps to describe how anonymous a ring sampler is with respect to a given signer distribution as an information-theoretic measure. We show that this measure is robust – it only varies slightly when the signer distribution varies slightly. We then analyze three natural samplers – uniform, mimicking, and partitioning – under our model with respect to a family of signer distributions modeled after empirical Bitcoin data. We hope that our work paves the way towards researching ring samplers from a theoretical point of view.
Keywords
- Ring Signature
- Anonymity
- Monero
Fortified Multi-Party Computation: Taking Advantage of Simple Secure Hardware Modules Secure integer division with a private divisor SwapCT: Swap Confidential Transactions for Privacy-Preserving Multi-Token Exchanges Multiparty Homomorphic Encryption from Ring-Learning-with-Errors Residue-Free Computing Differentially Private Naïve Bayes Classifier Using Smooth Sensitivity CrowdNotifier: Decentralized Privacy-Preserving Presence Tracing Blocking Without Breaking: Identification and Mitigation of Non-Essential IoT Traffic ZKSENSE: A Friction-less Privacy-Preserving Human Attestation Mechanism for Mobile Devices You May Also Like... Privacy: Recommendation Systems Meet PIR Domain name encryption is not enough: privacy leakage via IP-based website fingerprinting Mercurial Signatures for Variable-Length Messages Editors’ Introduction Supervised Authorship Segmentation of Open Source Code Projects Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC HashWires: Hyperefficient Credential-Based Range Proofs Privacy-Preserving Approximate k -Nearest-Neighbors Search that Hides Access, Query and Volume PatternsLess is More: A privacy-respecting Android malware classifier using federated learning Unifying Privacy Policy Detection “I would have to evaluate their objections”: Privacy tensions between smart home device owners and incidental users Managing Potentially Intrusive Practices in the Browser: A User-Centered Perspective DPlis: Boosting Utility of Differentially Private Deep Learning via Randomized Smoothing LogPicker: Strengthening Certificate Transparency Against Covert Adversaries Oblivious DNS over HTTPS (ODoH): A Practical Privacy Enhancement to DNS Private Stream Aggregation with Labels in the Standard Model SoK: Privacy-Preserving Computation Techniques for Deep Learning Privacy Preference Signals: Past, Present and Future “We, three brothers have always known everything of each other”: A Cross-cultural Study of Sharing Digital Devices and Online Accounts SoK: Efficient Privacy-preserving Clustering