Partial Linkable Spontaneous Anonymous Group (PLSAG)
summary
Proposes a Partial Linkable Spontaneous Anonymous Group scheme that turns three per-input CLSAG signatures into one signature regardless of input count by adding linkability to selected columns of a 2D key matrix, e.g., linkability on odd columns for three inputs. Claims concrete size win when anonymity set n is much larger than input count m (PLSAG stores ~m^2 vs CLSAG ~n·m), reports algorithm matches CLSAG primitives so it is easy to drop in.
AI-written summary · about
related talks
57mPractical Groth16 Aggregation
31mSecure Aggregation with Lightweight Committees
01h 06mOn the Assumptions Used for Obfuscation
31mAggios: Scalable Aggregator-Based Voting
25mSonic: zkSNARKs from Linear Size Universal and Updatable SRS
28mProving Obliviousness of Probabilistic Algorithms with Formal Verification
01h 29mLLM Safety, Alignment, and Generalization
01h 05mAn Algebraic Framework for Universal and Updatable zkSNARKs