Aggregating Falcon signatures with LaBRADOR
From MaRDI portal
Publication:6648189
DOI10.1007/978-3-031-68376-3_3MaRDI QIDQ6648189
Diego F. Aranha, Katharina Boudgoust, Sebastian Kolby, Akira Takahashi, Marius A. Aardal
Publication date: 4 December 2024
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Compact multi-signatures for smaller blockchains
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- Recursive proof composition from accumulation schemes
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Does Fiat-Shamir require a cryptographic hash function?
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- A practical lattice-based sequential aggregate signature
- Worst-case to average-case reductions for module lattices
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- On the (In)Security of SNARKs in the Presence of Oracles
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice-based Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On Zeros of a Polynomial in a Finite Grid
- Towards Lattice Based Aggregate Signatures
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- One-Shot Verifiable Encryption from Lattices
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Fiat-Shamir transformation of multi-round interactive proofs
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Lattice-based functional commitments: fast verification and cryptanalysis
This page was built for publication: Aggregating Falcon signatures with LaBRADOR
