Signatures 1
summary
Two constructions: a Merkle-tree batch signatures scheme that buffers many messages, signs the Merkle root with a PQC signer (Dilithium/Falcon/SPHINCS), and sends per-message sibling paths so verification is one-to-one; it proves weak batch privacy (not full batch privacy) assuming tweakable hashes with SM-TCR, cuts transmitted PQC cost drastically and boosts throughput at batch sizes like 16–32 while adding modest latency and requiring controlled endpoints or standards work. A second framework yields history-free sequential aggregation for hash‑and‑sign trapdoor functions using salts, alpha/beta encodings and a hash state, fixes oil‑and‑vinegar malleability, reduces security to one‑wayness plus preimage indistinguishability in the ROM, and achieves ~20–30% aggregation for classic O&V while signature size still grows linearly with signers.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 2:16Batch signatures defined
- 3:01Merkle trees and tweakable hashes
- 7:23Batch signatures with Merkle trees
- 12:50Performance and use cases
- 15:48HSMs and load balancers
- 17:58Q&A 1
- 24:11Sequential aggregated signatures
- 27:09Full domain hash and aggregation
- 32:06Aggregation with trapdoor functions
- 34:08Aggregation security challenges
- 42:26Conclusion and open problems
- 43:29Q&A 2
related talks
49mDigital Signatures
28mSchnorr Signatures
41mStateful Hash-Based Signature Schemes
26mSecure protocols on BIP taproot
01h 11mEVERYTHING about Schnorr Signatures
30mStateful Hash based Signatures: Practical Enhancements and Lessons learned
36mPost-Quantum Cryptography for Digital Signing
30mCoping with post-quantum signatures in the WebPKI