OSPEAD: Optimal Ring Signatures
summary
Claims that timing alone boosts correct real-spend guesses from 6.25% to 23.5% on 16-member rings, and that changing decoy selection cuts that to 7.6%. Uses the MAP decoder (ratio FS/FD), algebraic inversion from Patra & Sen to isolate FS, and a BJR estimator (Bonhomme, Jochmans & Robin 2016) to separate multiple wallet decoy distributions. Provides code at github.com/rucknium/osspeed and evaluates deployment risks from staggered wallet updates.
AI-written summary · about
chapters (13)
- 0:00OSPEAD ring signatures intro
- 1:45Ring signature privacy flaws
- 3:39Decoy selection history
- 5:05Probability density functions
- 7:35Decoy selection in practice
- 8:55Flaws in decoy distributions
- 10:04MAP decoder attack
- 12:13Real vs decoy distributions
- 14:23Wallet software variations
- 15:50BJR estimator for mixtures
- 16:57Better decoys counter MAP
- 18:01OSPEAD impact on attacks
- 18:22Deployment risks
related talks
22mDetecting Compromise of Synced Passkeys
16mDSig: Breaking the Barrier of Signatures in Data Centers
39mWhen Is a Proof Actually Not?
47mRSAC Security Scholar Poster Pitch-Off
28mRecent Developments on Multi-Party Schnorr Signatures
26mConstant-Time Callees with Variable-Time Callers
40mBadge of Shame: Breaking into Secure Facilities with OSDP
24mA Decade After Bleichenbacher '06, RSA Signature Forgery Still Works