Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
From MaRDI portal
Publication:5096802
Recommendations
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 4191110 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 177022 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
- The Knowledge Complexity of Interactive Proof Systems
- Zero-knowledge proofs of identity
Cited in
(9)- scientific article; zbMATH DE number 708807 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- Efficient threshold zero-knowledge with applications to user-centric protocols
- Compact E-Cash and Simulatable VRFs Revisited
- scientific article; zbMATH DE number 1588474 (Why is no real title available?)
- Strictly-black-box zero-knowledge and efficient validation of financial transactions
- The electronic cash system based on non-interactive zero-knowledge proofs
- scientific article; zbMATH DE number 1676661 (Why is no real title available?)
- Secure and efficient off-line digital money (extended abstract)
This page was built for publication: Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096802)