Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Recommendations
Cited in
(29)- On the security of the Courtois-Finiasz-Sendrier signature
- On composable security for digital signatures
- New number-theoretic cryptographic primitives
- MPSign: a signature from small-secret middle-product learning with errors
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Information flow under budget constraints
- Security proofs for signature schemes
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Structure-preserving signatures and commitments to group elements
- Provable security of digital signatures in the tamper-proof device model
- Hash-based Digital Signature Schemes
- scientific article; zbMATH DE number 1330056 (Why is no real title available?)
- scientific article; zbMATH DE number 1950631 (Why is no real title available?)
- scientific article; zbMATH DE number 1927304 (Why is no real title available?)
- Verifiable composition of signature and encryption. A comprehensive study of the design paradigms
- scientific article; zbMATH DE number 883900 (Why is no real title available?)
- LESS is more: code-based signatures without syndromes
- Digital signatures
- Server-Supported Signatures
- Provable security for public key schemes
- Identification protocols and signature schemes based on supersingular isogeny problems
- Resumable zero-knowledge for circuits from symmetric key primitives
- Advanced Signatures
- Signatures and Security Notions
- Lattice-based programmable hash functions and applications
- Practical round-optimal blind signatures in the ROM from standard assumptions
- On the impossibility of ``succinct automata representation of hash functions
- Avoiding trusted setup in isogeny-based commitments
This page was built for publication: Digital Signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605089)
