T. Eng, T. Okamoto. Single-Term Divisible Electronic Coins Preproceedings of Eurocrypt 94, pp 311325.  Home/Search   Document Not in Database   Summary   Related Articles

....The bank then publicizes h but keeps x secret. The blind signature scheme is somewhat complicated and is presented as part of the protocols of subsection 3.2. Two previous techniques to deal with the problem of providing change anonymously are due to Ohta and Okamoto [OO92] and Eng and Okamoto [EO94] who developed protocols which enable a user to split his or her coins into pieces and give different stores different pieces. The trouble with their solution is that, while the bank may not know who withdrew the coin, the bank will recognize the different pieces as belonging to the same coin. ....

....this extended abstract, we presented a way in which a user might make an anonymous 1 purchase with a 2 coin at a store that has a line of communication to a minting facility. However, if the store does not have this communication capability, the problem remains open. The solutions of [OO92] and [EO94] come close, but the parts of the divisible coin are linkable. We argued in this extended abstract that any off line, unlinkable solution must base the user s anonymity on complexity assumptions. W92] discusses a way it could be done using zero knowledge proofs, but these proofs may not be ....

T. Eng, T. Okamoto. Single-Term Divisible Electronic Coins Preproceedings of Eurocrypt 94, pp 311325.

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