A universally composable non-interactive aggregate cash system
From MaRDI portal
Publication:6135420
Recommendations
Cites work
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- A framework for practical universally composable zero-knowledge protocols
- Bitcoin as a transaction ledger: a composable treatment
- Bounded-concurrent secure two-party computation without setup assumptions
- Byzantine agreement with a rational adversary
- Fair and robust multi-party computation using a global transaction ledger
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Non-interactive Mimblewimble transactions, revisited
- On Signatures of Knowledge
- On the size of pairing-based non-interactive arguments
- Quisquis: a new design for anonymous cryptocurrencies
- RingCT 3.0 for blockchain confidential transaction: shorter size and stronger security
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Zether: towards privacy in a smart contract world
This page was built for publication: A universally composable non-interactive aggregate cash system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135420)