A Framework for Universally Composable Non-committing Blind Signatures
From MaRDI portal
Publication:3650707
Recommendations
- A framework for universally composable non-committing blind signatures
- A Provably Secure Blind Signature Scheme
- scientific article; zbMATH DE number 1759331
- Theory of Cryptography
- Unconditionally secure blind signatures
- A framework for constructing convertible undeniable signatures
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
- scientific article; zbMATH DE number 1759784
- Efficient Partially Blind Signatures with Provable Security
Cited in
(14)- A framework for universally composable non-committing blind signatures
- An efficient blind signature scheme based on SM2 signature algorithm
- Security of blind signatures revisited
- Universal composition with responsive environments
- Universally composable zero-knowledge arguments and commitments from signature cards
- Equivocal Blind Signatures and Adaptive UC-Security
- Information Security
- Improved structure preserving signatures under standard bilinear assumptions
- Efficient round-optimal blind signatures in the standard model
- Multi-theorem preprocessing NIZKs from lattices
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- The Abe-Okamoto partially blind signature scheme revisited
- Universally composable key-insulated and privacy-preserving signature scheme with publicly derived public key
- Pairing-free blind signatures from standard assumptions in the ROM
This page was built for publication: A Framework for Universally Composable Non-committing Blind Signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650707)
