Cryptography in Distributed Systems
summary
Claims a secret-shared q-SDH accumulator with constant-size witnesses that uses MPC (SPDZ or Shamir) so all updates and witness creation run in constant time while initial accumulation stays O(n) and works in practice via MP-SPDZ+Relic. Benchmarks show non-MPC updates cost >100s for 2^14 items but the SPDZ instantiation runs under 0.25s in LAN and under 4s in WAN. The identity scheme uses blind Pointcheval‑Sanders signatures, Dodis‑Yampolskiy PRF, threshold ElGamal/Shamir and NIZKs to enforce a MaxACC limit and recover PRF keys for revocation. A separate result gives non-interactive half-aggregation for Schnorr/EdDSA: a Sigma-based compressor that achieves ~50% size reduction, Fiat‑Shamir aggregates 1000 signatures in <1ms, Fischlin gives tighter security at higher cost.
AI-written summary · about
chapters (26)
- 0:00Intro
- 2:02Accumulators in Digital Identity Management
- 2:24Digital Identity Management - Authentication
- 2:41Digital Identity Management - Anonymous Credentials
- 3:12Digital Identity Management - Accumulator updates
- 7:11MPC protocols and Implementation
- 8:07Keyless q-SDH benchmark
- 10:36Conclusion
- 11:55Distributed payment systems
- 15:02Registration
- 16:16Account Creation in more detail
- 18:01Anonymity Revocation
- 19:10Accounts Tracing
- 20:06Cryptographic Tools and Techniques
- 21:19Security Analysis
- 22:46Schnorr Signatures
- 23:31Signature Aggregation
- 24:29Application: Compressing Blockchains
- 24:47Problem Scope
- 26:25Quick recap: Sigma Protocol for relation R
- 27:03Sigma Protocol for Pok of Schnorr Signature
- 28:21Compressing Poks for n discrete logarithm instances
- 29:29Compressed Sigma Protocol for Pok of n Schnorr Sigs
- 31:00From Sigma Protocol to Non-interactive Pok
- 31:23Benchmarks
- 32:57Apply these constructions
related talks
01h 08mSecure Computation 1
25mPractical Accountability of Secret Processes
49mDigital Signatures
01h 00mSecure Computation 3
18mzkSaaS: Zero-Knowledge SNARKs as a Service
56mCollaborative zk-SNARKs: Proving as One over Distributed Secrets
29mTowards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
01h 14mDecentralized Cryptography: A Distant Dream or an Immediate Possibility?
