How to Make a Mint: The Cryptography of Anonymous Electronic Cash
@article{Law1997HowTM, title={How to Make a Mint: The Cryptography of Anonymous Electronic Cash}, author={Laurie Law and Susan Sabett and Jerome A. Solinas}, journal={The American University law review}, year={1997}, volume={46}, pages={6} }
With the onset of the Information Age, our nation is becoming increasingly dependent on network communications. Computer-based technology is impacting significantly our ability to access, store, and distribute information. Among the most important uses of this technology is electronic commerce: performing financial transactions via electronic information exchanged over telecommunications lines. A key requirement for electronic commerce is the development of secure and efficient electronic…Â
61 Citations
A new untraceable off-line electronic cash system
- Computer ScienceElectron. Commer. Res. Appl.
- 2011
On Protocols for Information Security Services
- Computer Science
- 2011
Investigations have been made to protect information by developing some ISS protocols, including blind Signature Schemes, a key management protocol, which stores one-way hash of the password at the server, instead of storing plaintext version of password, and a unique asymmetric cryptosystem for encrypting large messages.
E-Cash Payment Protocols
- Computer Science
- 2012
The payment protocols for digital cash are shown and how a digital cash system can be formed is discussed by presenting a few of the present days digital cash systems in details and a comparison is provided to see which one of them fulfils the properties for digitalcash and the required security level.
Digital Currency Generation Using Hash Function and Digital Signature (DigCur)
- Computer ScienceAl-Nahrain Journal of Science
- 2019
The proposed method aims to produce a digital cryptocurrency to be as alternative to the traditional physical currencies and it will be called as DigCur and according to some tests the proposed method can be considered a good method to take advantage of it instead of other cash applications.
Transferable E-Cash Without Observer
- Computer Science
- 2009
This work has proposed a scheme for implementing transferable e-cash that does not require the involvement of any observer during spending and is built around the restrictive blinding and digital signature scheme.
Pythia: Towards Anonymity in Authentication
- Computer ScienceSEC
- 2001
PyTHIA is presented, a mechanism, which is based on the use of Message Digest Algorithms and the intermediation of Trusted Third Parties in order to provide anonymity to e-commerce users who have to authenticate themselves inorder to access services or buy goods form service providers and merchants respectively.
A Fair Payment System with Online Anonymous Transfer
- Computer Science
- 2006
A set of desirable properties for ECash systems are described and it is proved that the designed and implemented system meets all of these properties under the Strong RSA assumption and the Decisional Diffie-Hellman assumption in the random oracle model.
Anonymity Control in E-Cash Systems
- Computer ScienceFinancial Cryptography
- 1997
Electronic cash, and other cryptographic payment systems, offer a level of user anonymity during a purchase, in order to emulate electronically the properties of physical cash exchange. However, it…
Electronic Cash
- Computer ScienceEncyclopedia of Cryptography and Security
- 2005
This chapter provides an overview of the state-of-the-art techniques for designing electronic cash systems, without going into great technical detail.
Distributed architectures for electronic cash schemes: a survey
- Computer ScienceInt. J. Parallel Emergent Distributed Syst.
- 2009
This paper identifies and analyse the different distributed architectural styles underlying existing e-cash schemes and discusses the strengths and limitations of these architectures with respect to fundamental system distribution criteria, and makes some recommendations for designing effective distributed e- cash systems from an architectural perspective.