Easy come-easy go divisible cash
From MaRDI portal
(Redirected from Easy come-easy go divisible cash)
Recommendations
Cited in
(42)- A practical anonymous multi-authority e-cash scheme.
- A novel proxy deposit protocol for e-cash systems
- A practical anonymous payment scheme for electronic commerce
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Divisible e-cash from constrained pseudo-random functions
- Scalable Divisible E-cash
- Divisible e-cash made practical
- Signatures and efficient proofs on committed graphs and NP-statements
- scientific article; zbMATH DE number 4191110 (Why is no real title available?)
- Anonymous communication and anonymous cash
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
- Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
- Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
- On the Portability of Generalized Schnorr Proofs
- Lower bounds on term-based divisible cash systems
- Universal electronic cash
- An efficient divisible electronic cash scheme
- Single-term divisible electronic coins
- scientific article; zbMATH DE number 1955803 (Why is no real title available?)
- scientific article; zbMATH DE number 2013350 (Why is no real title available?)
- scientific article; zbMATH DE number 2080176 (Why is no real title available?)
- scientific article; zbMATH DE number 1759332 (Why is no real title available?)
- scientific article; zbMATH DE number 1759333 (Why is no real title available?)
- scientific article; zbMATH DE number 1759358 (Why is no real title available?)
- Divisible e-cash in the standard model
- Auditable, anonymous electronic cash. (Extended abstract)
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Efficient Non-interactive Range Proof
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Divisible E-Cash Systems Can Be Truly Anonymous
- Information Security
- Cut down the tree to achieve constant complexity in divisible e-cash
- Removing the strong RSA assumption from arguments over the integers
- An anonymous mobile payment system based on bilinear pairings
- Fast secure two-party ECDSA signing
- Zero-knowledge arguments for subverted RSA groups
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- Conditional e-payments with transferability
- An improvement of the digital cash protocol of Okamoto and Ohta
- Vector commitments with proofs of smallness: short range proofs and more
- \textsf{Spectra}: interval-agnostic vector range argument for unstructured range assertions
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
This page was built for publication: Easy come-easy go divisible cash
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249666)
