Beholder signatures
From MaRDI portal
Cites work
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Constant-Size Commitments to Polynomials and Their Applications
- Cryptoeconomic security for data availability committees
- Efficient signature generation by smart cards
- Foundations of data availability sampling
- Fraud and data availability proofs: detecting invalid blocks in light clients
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Individual cryptography
- On Signatures of Knowledge
- Proofs of Catalytic Space
- Proofs of space
- Security arguments for digital signatures and blind signatures
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Strong secret sharing with snitching
- The hunting of the SNARK
- The Knowledge Complexity of Interactive Proof Systems
- Tight proofs of space and replication
- Time space tradeoffs for attacks against one-way functions and PRGs
This page was built for publication: Beholder signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443228)