An efficient divisible electronic cash scheme
From MaRDI portal
Recommendations
Cited in
(24)- A practical anonymous multi-authority e-cash scheme.
- Lattice-based e-cash, revisited
- Scalable Divisible E-cash
- Efficient schemes for anonymous yet authorized and bounded use of cloud resources
- Schemes for digital gift certificates with low computation complexity
- A realistic divisible transferable electronic cash for general use
- Lower bounds on term-based divisible cash systems
- Universal Electronic Cash
- Easy come-easy go divisible cash
- Efficient electronic cash using batch signatures
- Efficient electronic money. (Extended abstract)
- Methodology for digital money based on general cryptographic tools
- Single-term divisible electronic coins
- scientific article; zbMATH DE number 2030096 (Why is no real title available?)
- scientific article; zbMATH DE number 2080174 (Why is no real title available?)
- scientific article; zbMATH DE number 1759333 (Why is no real title available?)
- scientific article; zbMATH DE number 2102674 (Why is no real title available?)
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- A Universally Composable Scheme for Electronic Cash
- Asymmetric group message franking: definitions and constructions
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- An improvement of the digital cash protocol of Okamoto and Ohta
- Non-interactive zero-knowledge functional proofs
- Mild asymmetric message franking: illegal-messages-only and retrospective content moderation
This page was built for publication: An efficient divisible electronic cash scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343415)
