The electronic cash system based on non-interactive zero-knowledge proofs
From MaRDI portal
Publication:2804880
Recommendations
Cites work
- Efficient noninteractive proof systems for bilinear groups
- Fully Anonymous Group Signatures Without Random Oracles
- Identity-based partially blind signature in the standard model for electronic cash
- Security arguments for digital signatures and blind signatures
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(7)- A universally composable non-interactive aggregate cash system
- scientific article; zbMATH DE number 2102673 (Why is no real title available?)
- Compact E-Cash and Simulatable VRFs Revisited
- Offline e-cash system with finite circulation period based on an elliptic curve
- scientific article; zbMATH DE number 1504791 (Why is no real title available?)
- scientific article; zbMATH DE number 6159466 (Why is no real title available?)
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
This page was built for publication: The electronic cash system based on non-interactive zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804880)