Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage
This paper describes an extension of the Brands protocol to incorporate flexibly-divisble k-term Coins via application of Shamir polynomial parameterisation and Feldman-Pedersen zero knowledge (ZK) verification. User anonymity is preserved for up to k sub-Coin Payments per k-term Coin, but revoked f...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2613/ |
| _version_ | 1848790103288184832 |
|---|---|
| author | Goh,, A Ngo,, DCL Yip, , KW |
| author_facet | Goh,, A Ngo,, DCL Yip, , KW |
| author_sort | Goh,, A |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | This paper describes an extension of the Brands protocol to incorporate flexibly-divisble k-term Coins via application of Shamir polynomial parameterisation and Feldman-Pedersen zero knowledge (ZK) verification. User anonymity is preserved for up to k sub-Coin Payments per k-term Coin, but revoked for over-Payments with (k+1) or more sub-Coins. Poly-cash construction using only discrete logarithm (DL) or elliptic curve (EC) operations enables efficient implementation in terms of the latter; which constitutes an advantage over previous divisble Coin formulations based on quadratic residue (QR) binary-trees, integer factorisation (IF) cryptography or hybrid DL/IF. Comparative analysis of Poly-cash and previous protocols illustrates the advantages of the former for operationally realistic Coin sub-denominations. The advantage of Poly-cash in terms computational overhead is particularly significant, and facilitates implementation on lightweight User Purses and Merchant Payment-terminals. Configurable k-divisibility is also an important consideration for real-world applicability with decimal currency denominations, which is not well addressed by the binarised values of QR-tree divisible Coins. |
| first_indexed | 2025-11-14T18:07:17Z |
| format | Article |
| id | mmu-2613 |
| institution | Multimedia University |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:07:17Z |
| publishDate | 2003 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-26132011-08-24T01:18:32Z http://shdl.mmu.edu.my/2613/ Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage Goh,, A Ngo,, DCL Yip, , KW QA75.5-76.95 Electronic computers. Computer science This paper describes an extension of the Brands protocol to incorporate flexibly-divisble k-term Coins via application of Shamir polynomial parameterisation and Feldman-Pedersen zero knowledge (ZK) verification. User anonymity is preserved for up to k sub-Coin Payments per k-term Coin, but revoked for over-Payments with (k+1) or more sub-Coins. Poly-cash construction using only discrete logarithm (DL) or elliptic curve (EC) operations enables efficient implementation in terms of the latter; which constitutes an advantage over previous divisble Coin formulations based on quadratic residue (QR) binary-trees, integer factorisation (IF) cryptography or hybrid DL/IF. Comparative analysis of Poly-cash and previous protocols illustrates the advantages of the former for operationally realistic Coin sub-denominations. The advantage of Poly-cash in terms computational overhead is particularly significant, and facilitates implementation on lightweight User Purses and Merchant Payment-terminals. Configurable k-divisibility is also an important consideration for real-world applicability with decimal currency denominations, which is not well addressed by the binarised values of QR-tree divisible Coins. 2003 Article NonPeerReviewed Goh,, A and Ngo,, DCL and Yip, , KW (2003) Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage. COMMUNICATIONS AND MULTIMEDIA SECURITY, 2828 . pp. 181-193. ISSN 0302-9743 |
| spellingShingle | QA75.5-76.95 Electronic computers. Computer science Goh,, A Ngo,, DCL Yip, , KW Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| title | Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| title_full | Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| title_fullStr | Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| title_full_unstemmed | Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| title_short | Flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| title_sort | flexibly-configurable and computation-efficient digital cash with polynomial-thresholded coinage |
| topic | QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/2613/ |