scientific article; zbMATH DE number 1303150
From MaRDI portal
Publication:4249666
zbMATH Open0929.68063MaRDI QIDQ4249666FDOQ4249666
Authors:
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (39)
- Title not available (Why is that?)
- On the Portability of Generalized Schnorr Proofs
- Title not available (Why is that?)
- Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
- Divisible E-Cash Systems Can Be Truly Anonymous
- Title not available (Why is that?)
- Universal Electronic Cash
- Divisible e-cash in the standard model
- A practical anonymous payment scheme for electronic commerce
- Title not available (Why is that?)
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
- Title not available (Why is that?)
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
- Efficient Non-interactive Range Proof
- Scalable Divisible E-cash
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Title not available (Why is that?)
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- A novel proxy deposit protocol for e-cash systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Zero-knowledge arguments for subverted RSA groups
- An improvement of the digital cash protocol of Okamoto and Ohta
- An anonymous mobile payment system based on bilinear pairings
- Vector commitments with proofs of smallness: short range proofs and more
- Removing the strong RSA assumption from arguments over the integers
- Fast secure two-party ECDSA signing
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Signatures and efficient proofs on committed graphs and NP-statements
- Divisible e-cash made practical
- Conditional e-payments with transferability
- A practical anonymous multi-authority e-cash scheme.
- Title not available (Why is that?)
- Divisible e-cash from constrained pseudo-random functions
- Information Security
- Anonymous communication and anonymous cash
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- Cut down the tree to achieve constant complexity in divisible e-cash
- Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249666)
