Exact analysis of exact change: The k-payment problem

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 4, 2000, Pages 436-453

  Patt Shamir, Boaz ^a   Tsiounis, Yiannis ^b   Frankel, Yair ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b InternetCash Corp   (United States)

^c ECashcom   (United States)

Author keywords

Change making; Coin allocation; Electronic cash; Exact change; k payment problem

Indexed keywords

EID: 0042420432     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197318118     Document Type: Article

References (14)

1. S. BRANDS, Untraceable off-line cash in wallets with observers, in Advances in Cryptology: CRYPTO. '93, Lecture Notes in Comput. Sci. 773, Springer-Verlag, Berlin, 1994, pp. 302-318.
2. D. CHAUM, Blind signatures for untraceable payments, in Advances in Cryptology: CRYPTO. '82, Plenum Press, New York, 1983, pp. 199-203.
3. D. CHAUM, A. FIAT, AND M. NAOR, Untraceable electronic cash, in Advances in Cryptology: CRYPTO. '88, Springer-Verlag, Berlin, 1990, pp. 319-327.
4. D. F. HSU AND X.-D. JIA, External problems in the construction of distributed loop networks, SIAM J. Disc. Math., 7 (1994), pp. 57-71.
5. D. KOZEN AND S. ZAKS, Optimal bounds for the change-making problem, Theoret. Comput. Sci., 123 (1994), pp. 377-388.
6. S. MARTELLO AND P. TOTH, Knapsack Problems: Algorithms and Computer Implementations, Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley and Sons, New York, 1990.
7. D. NACCACHE AND D. M'RAÏHI, Cryptographic smart cards, IEEE Micro., 16 (1996), pp. 14-23.
8. T. OKAMOTO, An efficient divisible electronic cash scheme, in Advances in Cryptology: CRYPTO. '95, Lecture Notes in Comput. Sci. 963, Springer-Verlag, Berlin, 1995, pp. 438-451.
9. D. PEARSON, A Polynomial-Time Algorithm for the Change-Making Problem, Technical report TR94-1493, Cornell University, Ithaca, NY, 1994.
10. E. S. SELMER, On the postage stamp problem with 3 denominations, Math. Scand., 56 (1985), pp. 105-116.
11. E. S. SELMER, Associate bases in the postage stamp problem, J. Number Theory, 42 (1992), pp. 320-336.
12. Y. TSIOUNIS. Efficient Electronic Cash: New Notions and Techniques, Ph.D. thesis, College of Computer Science, Northeastern University, Boston, MA, 1997. See http://www.ccs.neu.edu/home/yiannis for information on availability.
13. J. VAN LINT AND R. WILSON, A Course in Combinatorics, Cambridge University Press, Cambridge, UK, 1992.
14. R. VERMA AND J. XU, On Optimal Greedy Change Making, Technical report UH-CS-94-03, Department of Computer Science, University of Houston, Houston, TX, 1994.