Laurie Law, Susan Sabett, Jerry Solinas, "HOW TO MAKE A MINT: THE CRYPTOGRAPHY OF ANONYMOUS ELEC- TRONIC CASH", National Security Agency, Ojfice of Information Security Research and Technology, Cryptology Division, 18 June 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Micropayments Revisited - Micali, Rivest (2002) (10 citations) (Correct)
....1.1 Two Old Micropayment Schemes Let us quickly recall two well known micropayment schemes: 1) Rivest and Shamir s PayWord [16] and (2) Rivest s electronic lottery tickets as micro 2 Payment schemes that emphasize user anonymity are often called electronic coin schemes. See Law et al. [8] for an excellent overview of electronic coin schemes. payments [15] Indeed, our proposed micropayment schemes retain some of their ideas, and x some of their drawbacks. PayWord. Let H be a one way function; that is, a function easy to evaluate but hard to invert. A user computes a H chain ....
Laurie Law, Susan Sabett, and Jerry Solinas. How to make a mint: the cryptography of anonymous electronic cash. National Security Agency, Oce of Information Security Research and Technology, Cryptology Division, June 1996.
Group Blind Digital Signatures: Theory and Applications - Ramzan (1999) (1 citation) (Correct)
....simple version of the protocol primarily to give the main ideas. As a result, there are some minor flaws in it, but standard techniques exist to remedy these flaws. There are several more comprehensive works on electronic cash which discuss this, as well as other well known electronic cash schemes [23, 38]. In the protocol we present, we assume that there is a person Alice who wants to buy a cryptography textbook, which costs 50 from the fictitious online vendor Online Crypto Books. Furthermore, Alice and Online Crypto Books both use the same bank, which we call the Bank. The entire transaction ....
Laurie Law, Susan Sabett, and Jerry Solinas. How to make a mint: the cryptography of anonymous electronic cash. National Security Agency, Office of Information Security Research and Technology, Cryptology Division, June 1996.
Group Blind Digital Signatures: A Scalable Solution to.. - Lysyanskaya, Ramzan (1998) (24 citations) (Correct)
....her bank by having it sign something other than what it was supposed to sign. We can prevent this by requiring that the bank have different secret signing keys to authorize different dollar amounts. For example, one key could correspond to a 5 withdrawal, another to a 10 withdrawal, and so on [15]. There are several other ways to prevent this kind of fraud [21] but we omit them here. 1.5 Advantages of Our Scheme Previous work on electronic cash systems focused on models in which a single bank distributes all the e cash. We, on the other hand, show how to implement an efficient multiple ....
Laurie Law, Susan Sabett, and Jerry Solinas. How to make a mint: the cryptography of anonymous electronic cash. National Security Agency, Office of Information Security Research and Technology, Cryptology Division, June 1996.
Secure Group Browsing - Jain, Jain, Nandi (2003) (Correct)
No context found.
Laurie Law, Susan Sabett, Jerry Solinas, "HOW TO MAKE A MINT: THE CRYPTOGRAPHY OF ANONYMOUS ELEC- TRONIC CASH", National Security Agency, Ojfice of Information Security Research and Technology, Cryptology Division, 18 June 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC