Spending offline divisible coins with combining capability

Eikoh Chida, Yosuke Kasai, Masahiro Mambo, Hiroki Shizuya

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In the purchase with electronic money customers are sometimes required to spend multiple electronic coins at a time. In case of physical coins a customer simply grabs multiple coins and hands them out to a merchant. Likewise, the customer spends multiple electronic coins just by giving all coins to the merchant. However, we can expect one step further in the electronic coins. There is room to create a combined coin from multiple coins. If the combining leads to an efficient spending, the customer as well as the merchant and the bank can get benefit of the reduction of cost. There is a proposal by Chaum for the combining operation in the online cash, but no method has been proposed for offline coins up to now. Thus we seek a way to spend offline electronic coins in a combined form without assistance of an issuing bank. The combining reduces either computational complexity associated with the spending or communication complexity between the customer and the merchant. We propose a method to achieve combining capability in the Eng-Okamoto offline divisible electronic cash, and show that (2n − 2)|p| − (n − 1)|q| bits of the message length can be reduced in the combining of n coins under the parameter of moduli p and q satisfying q|p−1. If preliminary computation is allowed, the verification cost is also slightly reduced. Significantly, even after combining coins, the bank can identify overspenders.

    Original languageEnglish
    Title of host publicationProgress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings
    EditorsPalash Sarkar, Alfred Menezes
    PublisherSpringer-Verlag
    Pages339-353
    Number of pages15
    ISBN (Print)9783540362319
    Publication statusPublished - 2002 Jan 1
    Event3rd International Conference on Cryptology in India, INDOCRYPT 2002 - Hyderabad, India
    Duration: 2002 Dec 162002 Dec 18

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2551
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other3rd International Conference on Cryptology in India, INDOCRYPT 2002
    Country/TerritoryIndia
    CityHyderabad
    Period02/12/1602/12/18

    Keywords

    • Anonymity
    • Combined coin
    • Combining capability
    • Efficiency
    • Offline divisible coins
    • Overspending prevention

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Spending offline divisible coins with combining capability'. Together they form a unique fingerprint.

    Cite this