Talk:Anonymous internet banking

From Wikipedia, the free encyclopedia

You have new messages (last change).

This page should only list the cryptographical protocols and concepts used and explaination should be done in the articles for the protocols and concepts.

I think it's fine the way it is, describing the protocols. Regarding the introduction, originally I came to this page from other pages relating to cryptography, cyberpunk, p2p, censorship, so it wasn't obvious there was no introduction. I'm sure many people also arrive to this page like this, so I don't think an introduction needs to be written.

Well, no, that's just wrong. Sorry. This is wikipedia, and every article in it should stand alone, otherwise the article is deficient; therefore, it does in fact need an intro. Furthermore, this article doesn't tell us anything about anonymous money at all, it just describes how anonymous transactions could occur within a cyrptographic method that already has its own committed article somewhere, although I can't remember the title. If you can expand this article, please do. If the article cannot be expanded, perhaps it should be merged into the article for this type of cryptography. And please sign your posts.Shaggorama 21:49, 5 February 2006 (UTC)

this needs more of an introduction. who uses it? why would they use it? which aspects of the transfer are anonymous? (the money sender certainly knows who they intend to receive the money, except through a pseudonym?) etc. It just jumps right into the technical description, which is useless without understanding the basics.

What is the problem this is meant to solve? My first thought would be someone who wanted to donate money to someone else without that donation being traceable by a third party. — Omegatron 02:51, September 12, 2005 (UTC)

It may be nonsense: only the bank has the ability to calculate cube roots is patent nonsense. -- RHaworth 14:53, 26 February 2006 (UTC)

Why is this nonsense? Surely this is just an instance of the RSA problem? Or are you making a different point? Barnaby dawson 21:37, 26 February 2006 (UTC)

[Nevermind.] -- KyleP 23:28, 21 September 2006 (UTC)

It's nonsense because if bank has the ability to calculate cube roots, so do all the bad guys. The way to make it work would be to have bank remember numbers it gives away (together with their roots) so that it does not need to do the actual calculations. But it does not fit the scheme presented in this article.

It is not the case that "if the bank has the ability to calculate cube roots, so do all the bad guys" in a practical sense (assuming the RSA problem is hard). Barnaby dawson 08:09, 2 October 2006 (UTC)

I see a problem with the example given for the underlying mathematics. The article says "Calculating the cube of something is easy: eg 53(mod 35) = 125(mod 35) = 125 − (3 * 35) = 20 But finding the cube root is tough: try to find x given x^3 (mod 35) = 3" There is no integer x such that x^3 (mod 35) = 3. 3 is not a cube root modulo 35 (or modulo 7). -- 2006-09-19 03:22 UTC

The example does not work, because RSA requires that e and (p-1)(q-1) have not factors in common. But here 3 divides 6 (= 7-1). A better example would be using 55 instead of 35, but that solves only one of many problems in this article. 67.84.116.166 00:43, 22 September 2006 (UTC)
In fact, the whole article is very confusing and should better be rewritten. 67.84.116.166 00:57, 22 September 2006 (UTC)
If you can see other mistakes in the article please mention what they are. Barnaby dawson 14:47, 22 September 2006 (UTC)
The concept is strange. It simply descibes a physical analogue to RSA, but not the idea behind anonymous fund transfers. Try this analogue: If Alice pays Bob by giving him a check, then the Bank learns about Alice and Bobs business relation when Bob deposits the check. If however, Alice simply withdraws money from the Bank, hands it to Bob and Bob then deposits the money again at the bank then the bank does not learn about the transaction. Hence the transaction is anonymous.
The section describing the mathematics, basically describes one possible protocol for anonymous transactions using RSA and blind signatures. There is no need for repeating the mathematics behind RSA and blind signatures, becuase wikipedia has some nice articles already. However, the protocol is just one example. Depending the goals of the protocol this may or may not be sufficient. For example the protocol described in the article requires that the bank is online, when the transaction between the two parties are made. Other cryptographic protocols work even if the bank is offline during the transaction. 67.84.116.166 21:05, 22 September 2006 (UTC)
Retrieved from "http://en.wikipedia.org../../../a/n/o/Talk%7EAnonymous_internet_banking_31ab.html"