Patent ID: 6546376
Filing Date: 2003-04-08
Classification: G06Q

Abstract:
An electronic payment system comprising:a subscribe computer and a merchant computer communicating via a communication network for performing a commercial transaction having a purchase amount; an electronic payment service center connected to said network and configured to receive a total amount of money with a total unit n from said subscribe computer for said commercial transaction; said subscribe computer farther comprising: a balanced binary tree further comprising: a plurality of nodes Xn, Xâˆ’1, Xnâˆ’2, . . . , X2 and X1 representing respective current amount of money Xk, derived by subtracting said purchase amount from said total amount, with a current unit k wherein k=n, nâˆ’1, nâˆ’2, . . . , 2 and 1; each of the nodes in said balanced binary tree further comprising a position value j=1, 2, 3, . . . nâˆ’1 and n, respectively, wherein j=nâˆ’k+1; a plurality of binary codes (dmdmâˆ’1 . . . d1d0) respectively representing said position values wherein for each of said binary codes (di) i=mâˆ’1, mâˆ’2, . . . , 1 and 0; a plurality of root values derived from the plurality of nodes Xn, Xnâˆ’1, Xnâˆ’2, . . . , X2 and X1 representing said respective current amount of money Xk; a plurality of contrast values calculated from said root values through a one-way hash function at said subscribe computer; and a plurality of second nodes Xâ€²n, Xâ€²nâˆ’1, Xâ€²nâˆ’2, . . . , Xâ€²2 and Xâ€²1 representing respective second current amount of money Xâ€²k wherein k=n, nâˆ’1, nâˆ’2, . . . , 2 and 1 derived at said merchant computer through said one-way hash function; wherein said merchant computer verifies said commercial transaction as successful if said second current amount of money Xâ€²k (wherein k=n, nâˆ’1, nâˆ’2, . . . , 2 and 1) are equal to said contrast values.