(Enter summary)
Abstract: We consider the k-payment problem: given a total budget
of N units, the problem is to represent this budget as a set
of coins, so that any k exact payments of total value at most
N can be made using k disjoint subsets of the coins. The
goal is to minimize the number of coins for any given N and k,
while allowing the actual payments to be made on-line, namely
without the need to know all payment requests in advance. The
problem is motivated by the electronic cash model, where each
coin is a... (Update)
Context of citations to this paper: More
.... to divisibility: In contrast to a divisible coin, an exact payment protocol using multiple single term coins was analyzed in [FPST97] That result complements the protocol presented here, in the sense that [FPST97] is more efficient for small divisibility precisions (N )...
Cited by: More
Easy Come - Easy Go Divisible Cash - Chan, Frankel, Tsiounis (1998)
(Correct)
Similar documents (at the sentence level):
36.7%: Exact Analysis of Exact Change - Frankel, Patt-Shamir, al. (1997)
(Correct)
Active bibliography (related documents): More All
0.2: What This Country Needs is an 18c Piece - Shallit (2002)
(Correct)
0.2: A Polynomial-time Algorithm for the Change-Making Problem - Pearson (1994)
(Correct)
0.1: Simulation and Verification of Atomicity.. - Katsaros.. (2005)
(Correct)
Similar documents based on text: More All
0.4: Anonymity Control in E-Cash Systems - Davida, Frankel, Tsiounis, Yung (1997)
(Correct)
0.4: Fair Off-Line e-Cash made easy - Frankel, Tsiounis, Yung (1998)
(Correct)
0.4: Coins and Cones - Kozlov, Vu
(Correct)
BibTeX entry: (Update)
Y. Frankel, B. Patt-Shamir, and Y. Tsiounis. Exact analysis of exact change. In Proceedings of the 5th Israeli Symposium on the Theory of Computing Systems (ISTCS), Ran-Gatan, Israel, June 17--19 1997. Available at http://www.ccs.neu.edu/home/yiannis/pubs.html http://citeseer.ist.psu.edu/frankel97exact.html More
@inproceedings{ frankel97exact,
author = "Pat Frankel",
title = "Exact Analysis of Exact Change",
booktitle = "Israel Symposium on Theory of Computing Systems",
pages = "107-118",
year = "1997",
url = "citeseer.ist.psu.edu/frankel97exact.html" }
Citations (may not include all citations):
255
Untraceable electronic cash (context) - Chaum, Fiat et al. - 1990
239
Blind signatures for untraceable payments (context) - Chaum - 1983
229
Knapsack Problems: Algorithms and Computer Implementations (context) - Martello, Toth - 1990
78
Untraceable off-line cash in wallets with observers
- Brands - 1993
75
Universal electronic cash (context) - Okamoto, Ohta - 1992
28
An efficient divisible electronic cash scheme (context) - Okamoto - 1995
24
Cambridge University Press (context) - van Lint, Wilson et al. - 1992
24
Cryptographic smart cards
- Naccache, M'Rahi - 1996
13
Efficient Electronic Cash: New Notions and Techniques (context) - Tsiounis - 1997
4
Optimal bounds for the changemaking problem
- Kozen, Zaks - 1994
3
Construction of distributed loop networks (context) - Hsu, Jia - 1994
3
Associate bases in the postage stamp problem (context) - Selmer - 1992
3
the postage stamp problem with 3 denominations (context) - Selmer - 1985
2
On optimal greedy change making (context) - Verma, Xu - 1994
Documents on the same site (http://www.counterpane.com/biblio/year-1997.html): More
How to Convert Any Digital Signature Scheme Into a Group.. - Petersen (1997)
(Correct)
Replication Is Not Needed: Single Database.. - Kushilevitz, Ostrovsky (1997)
(Correct)
Efficient Cryptographic Protocols based on Noisy Channels - Crepeau (1997)
(Correct)
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