summaryrefslogtreecommitdiff
path: root/comparison/literature.bib
diff options
context:
space:
mode:
Diffstat (limited to 'comparison/literature.bib')
-rw-r--r--comparison/literature.bib26
1 files changed, 26 insertions, 0 deletions
diff --git a/comparison/literature.bib b/comparison/literature.bib
index dd74588..76e7d8b 100644
--- a/comparison/literature.bib
+++ b/comparison/literature.bib
@@ -137,3 +137,29 @@ doi="10.1007/978-3-319-28166-7_14",
url="https://doi.org/10.1007/978-3-319-28166-7_14"
}
+
+
+
+@Inbook{okamoto1995efficient,
+author="Okamoto, Tatsuaki",
+editor="Coppersmith, Don",
+title="An Efficient Divisible Electronic Cash Scheme",
+bookTitle="Advances in Cryptology --- CRYPT0' 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27--31, 1995 Proceedings",
+year="1995",
+publisher="Springer Berlin Heidelberg",
+address="Berlin, Heidelberg",
+pages="438--451",
+abstract="Recently, several ``divisible'' untraceable off-line electronic cash schemes have been presented [8, 11, 19, 20]. This paper presents the first practical ``divisible'' untraceable1 off-line cash scheme that is ``single-term''2 in which every procedure can be executed in the order of log N, where N is the precision of divisibility, i.e., N = (the total coin value)/(minimum divisible unit value). Therefore, our ``divisible'' off-line cash scheme is more efficient and practical than the previous schemes. For example, when N = 217 (e.g., the total value is about {\$} 1000, and the minimum divisible unit is 1 cent), our scheme requires only about 1 Kbyte of data be transfered from a customer to a shop for one payment and about 20 modular exponentiations for one payment, while all previous divisible cash schemes require more than several Kbytes of transfered data and more than 200 modular exponentiations for one payment.",
+isbn="978-3-540-44750-4",
+doi="10.1007/3-540-44750-4_35",
+url="https://doi.org/10.1007/3-540-44750-4_35"
+}
+
+@techreport{brands1993efficient,
+ author = {Brands, Stefan A.},
+ title = {An Efficient Off-line Electronic Cash System Based On The Representation Problem.},
+ year = {1993},
+ source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Aercim_cwi%3Aercim.cwi%2F%2FCS-R9323},
+ publisher = {CWI (Centre for Mathematics and Computer Science)},
+ address = {Amsterdam, The Netherlands, The Netherlands},
+}