Verifiable Obtained Random Subsets for Improving SPHINCS+
From MaRDI portal
Recommendations
- Semidefinite programs for randomness extractors
- Randomized partial checking revisited
- Improving probability bounds by optimization over subsets
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Random probing security: verification, composition, expansion and new constructions
- Verifiable random functions with optimal tightness
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model
- A generic approach to constructing and proving verifiable random functions
- Derandomization for sparse approximations and independent sets
Cites work
- Forward secure signatures on smart cards
- Hash-based signatures revisited: a dynamic FORS with adaptive chosen message security
- scientific article; zbMATH DE number 4035726 (Why is no real title available?)
- scientific article; zbMATH DE number 1950338 (Why is no real title available?)
- Improving stateless hash-based signatures
- Mitigating multi-target attacks in hash-based signatures
- On the security of the Winternitz one-time signature scheme
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Random oracles in a quantum world
- Selected Areas in Cryptography
- SPHINCS: practical stateless hash-based signatures
- W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Cited in
(4)
This page was built for publication: Verifiable Obtained Random Subsets for Improving SPHINCS+
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488404)
