{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:27:08Z","timestamp":1761676028377,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642363337"},{"type":"electronic","value":"9783642363344"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36334-4_20","type":"book-chapter","created":{"date-parts":[[2013,1,31]],"date-time":"2013-01-31T00:55:13Z","timestamp":1359593713000},"page":"314-332","source":"Crossref","is-referenced-by-count":6,"title":["Divisible E-Cash in the Standard Model"],"prefix":"10.1007","author":[{"given":"Malika","family":"Izabach\u00e8ne","sequence":"first","affiliation":[]},{"given":"Beno\u00eet","family":"Libert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-85230-8_26","volume-title":"Financial Cryptography and Data Security","author":"M.H. Au","year":"2008","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Practical Anonymous Divisible E-Cash from Bounded Accumulators. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11967668_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"M.H. Au","year":"2006","unstructured":"Au, M.H., Wu, Q., Susilo, W., Mu, Y.: Compact E-Cash from Bounded Accumulator. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 178\u2013195. Springer, Heidelberg (2006)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-78524-8_20","volume-title":"Theory of Cryptography","author":"M. Belenkiy","year":"2008","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: P-signatures and Noninteractive Anonymous Credentials. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 356\u2013374. Springer, Heidelberg (2008)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03356-8_7","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Belenkiy","year":"2009","unstructured":"Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable Proofs and Delegatable Anonymous Credentials. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 108\u2013125. Springer, Heidelberg (2009)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-03298-1_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M. Belenkiy","year":"2009","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: Compact E-Cash and Simulatable VRFs Revisited. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 114\u2013131. Springer, Heidelberg (2009)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-21969-6_13","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"O. Blazy","year":"2011","unstructured":"Blazy, O., Canard, S., Fuchsbauer, G., Gouget, A., Sibert, H., Traor\u00e9, J.: Achieving Optimal Anonymity in Transferable E-Cash with a Judge. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol.\u00a06737, pp. 206\u2013223. Springer, Heidelberg (2011)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71677-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"X. Boyen","year":"2007","unstructured":"Boyen, X., Waters, B.: Full-Domain Subgroup Hiding and Constant-Size Group Signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11426639_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact E-Cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 302\u2013321. Springer, Heidelberg (2005)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11832072_10","volume-title":"Security and Cryptography for Networks","author":"J. Camenisch","year":"2006","unstructured":"Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Balancing Accountability and Privacy Using E-Cash (Extended Abstract). In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 141\u2013155. Springer, Heidelberg (2006)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 481\u2013500. Springer, Heidelberg (2009)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A., Meyerovich, M.: Endorsed E-Cash. In: IEEE Security & Privacy 2007, pp. 101\u2013115 (2007)","DOI":"10.1109\/SP.2007.15"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-72540-4_28","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"S. Canard","year":"2007","unstructured":"Canard, S., Gouget, A.: Divisible E-Cash Systems Can Be Truly Anonymous. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 482\u2013497. Springer, Heidelberg (2007)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-85230-8_19","volume-title":"Financial Cryptography and Data Security","author":"S. Canard","year":"2008","unstructured":"Canard, S., Gouget, A., Traor\u00e9, J.: Improvement of Efficiency in (Unconditional) Anonymous Transferable E-Cash. In: Tsudik, G. (ed.) FC 2008. LNCS, vol.\u00a05143, pp. 202\u2013214. Springer, Heidelberg (2008)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-68914-0_13","volume-title":"Applied Cryptography and Network Security","author":"S. Canard","year":"2008","unstructured":"Canard, S., Gouget, A.: Anonymity in Transferable E-cash. In: Bellovin, S.M., Gennaro, R., Keromytis, A.D., Yung, M. (eds.) ACNS 2008. LNCS, vol.\u00a05037, pp. 207\u2013223. Springer, Heidelberg (2008)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11767480_5","volume-title":"Applied Cryptography and Network Security","author":"S. Canard","year":"2006","unstructured":"Canard, S., Gouget, A., Hufschmitt, E.: A Handy Multi-coupon System. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol.\u00a03989, pp. 66\u201381. Springer, Heidelberg (2006)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-14577-3_9","volume-title":"Financial Cryptography and Data Security","author":"S. Canard","year":"2010","unstructured":"Canard, S., Gouget, A.: Multiple Denominations in E-cash with Compact Transaction Data. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 82\u201397. Springer, Heidelberg (2010)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. In: STOC 1998, pp. 209\u2013218. ACM Press (1998)","DOI":"10.1145\/276698.276741"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"A.H. Chan","year":"1998","unstructured":"Chan, A.H., Frankel, Y., Tsiounis, Y.: Easy Come - Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 561\u2013575. Springer, Heidelberg (1998)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-74143-5_17","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Chase","year":"2007","unstructured":"Chase, M., Lysyanskaya, A.: Simulatable VRFs with Applications to Multi-theorem NIZK. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 303\u2013322. Springer, Heidelberg (2007)"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind Signatures for Untraceable Payments. In: Crypto 1982, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind Signature Systems. In: Crypto 1983, p. 153 (1983)","DOI":"10.1007\/978-1-4684-4730-9_14"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable Electronic Cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 319\u2013327. Springer, Heidelberg (1990)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-47555-9_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Transferred Cash Grows in Size. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 390\u2013407. Springer, Heidelberg (1993)"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0053432","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"S. D\u2019Amiano","year":"1995","unstructured":"D\u2019Amiano, S., Di Crescenzo, G.: Methodology for Digital Money Based on General Cryptographic Tools. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 156\u2013170. Springer, Heidelberg (1995)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36288-6_1","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y.: Efficient Construction of (Distributed) Verifiable Random Functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 1\u201317. Springer, Heidelberg (2002)"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A Verifiable Random Function with Short Proofs and Keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-56939-1_78","volume-title":"Automata, Languages and Programming","author":"M.K. Franklin","year":"1993","unstructured":"Franklin, M.K., Yung, M.: Secure and Efficient Off-Line Digital Money. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 265\u2013276. Springer, Heidelberg (1993)"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-10433-6_15","volume-title":"Cryptology and Network Security","author":"G. Fuchsbauer","year":"2009","unstructured":"Fuchsbauer, G., Pointcheval, D., Vergnaud, D.: Transferable Constant-Size Fair E-Cash. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 226\u2013247. Springer, Heidelberg (2009)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient Non-interactive Proof Systems for Bilinear Groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-72540-4_6","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"S. Jarecki","year":"2007","unstructured":"Jarecki, S.: Efficient Two-Party Secure Computation on Committed Inputs. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 97\u2013114. Springer, Heidelberg (2007)"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-642-10433-6_34","volume-title":"Cryptology and Network Security","author":"B. Libert","year":"2009","unstructured":"Libert, B., Vergnaud, D.: Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 498\u2013517. Springer, Heidelberg (2009)"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.-O., Vadhan, S.: Verifiable Random Functions. In: FOCS 1999, pp. 120\u2013130 (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44456-4_10","volume-title":"Information Security","author":"T. Nakanishi","year":"2000","unstructured":"Nakanishi, T., Sugiyama, Y.: Unlinkable Divisible Electronic Cash. In: Okamoto, E., Pieprzyk, J.P., Seberry, J. (eds.) ISW 2000. LNCS, vol.\u00a01975, pp. 121\u2013134. Springer, Heidelberg (2000)"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-46766-1_27","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T. Okamoto","year":"1992","unstructured":"Okamoto, T., Ohta, K.: Universal Electronic Cash. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 324\u2013337. Springer, Heidelberg (1992)"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-44750-4_35","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"T. Okamoto","year":"1995","unstructured":"Okamoto, T.: An Efficient Divisible Electronic Cash Scheme. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 438\u2013451. Springer, Heidelberg (1995)"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","first-page":"263","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"J.-C. Pailles","year":"1993","unstructured":"Pailles, J.-C.: New Protocols for Electronic Money. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 263\u2013274. Springer, Heidelberg (1993)"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"20_CR40","unstructured":"Tsiounis, Y.: Efficient Electronic Cash: New Notions and Techniques. PhD Thesis, Northeaster University, Boston (1997)"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36334-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T18:58:06Z","timestamp":1745953086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36334-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363337","9783642363344"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36334-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}