An Efficient Off-line Electronic Cash System Based On The Representation Problem.December 1993
- Author:
- Stefan A. Brands
Abstract
No abstract available.
Cited By
- Batten L and Yi X (2019). Off-line digital cash schemes providing untraceability, anonymity and change, Electronic Commerce Research, 19:1, (81-110), Online publication date: 1-Mar-2019.
- Wang H, He D, Sun Y, Kumar N and Choo K (2018). PAT, Future Generation Computer Systems, 79:P1, (262-270), Online publication date: 1-Feb-2018.
- Koblitz N and Menezes A (2016). Cryptocash, cryptocurrencies, and cryptocontracts, Designs, Codes and Cryptography, 78:1, (87-102), Online publication date: 1-Jan-2016.
- Baldimtsi F, Kiayias A, Zacharias T and Zhang B Indistinguishable Proofs of Work or Knowledge Proceedings, Part II, of the 22nd International Conference on Advances in Cryptology --- ASIACRYPT 2016 - Volume 10032, (902-933)
- Wang Y and Tanaka K (2016). Generic transformations for existentially unforgeable signature schemes in the bounded leakage model, Security and Communication Networks, 9:12, (1829-1842), Online publication date: 1-Aug-2016.
Rupp A, Baldimtsi F, Hinterwälder G and Paar C (2015). Cryptographic Theory Meets Practice, ACM Transactions on Information and System Security, 17:3, (1-31), Online publication date: 27-Mar-2015.- Huaqun Wang , Bo Qin , Qianhong Wu , Li Xu and Domingo-Ferrer J (2015). TPP: Traceable Privacy-Preserving Communication and Precise Reward for Vehicle-to-Grid Networks in Smart Grids, IEEE Transactions on Information Forensics and Security, 10:11, (2340-2351), Online publication date: 1-Nov-2015.
- Chen X, Li J, Ma J, Lou W and Wong D (2014). New and efficient conditional e-payment systems with transferability, Future Generation Computer Systems, 37:C, (252-258), Online publication date: 1-Jul-2014.
- Tiwari K and Gupta P Biometrics based observer free transferable E-cash Proceedings of the 2nd ACM workshop on Information hiding and multimedia security, (63-70)
- Lian B, Chen G and Li J (2014). Provably secure E-cash system with practical and efficient complete tracing, International Journal of Information Security, 13:3, (271-289), Online publication date: 1-Jun-2014.
- Kuchta V and Manulis M Rerandomizable Threshold Blind Signatures Revised Selected Papers of the 6th International Conference on Trusted Systems - Volume 9473, (70-89)
- Camenisch J and Groß T (2012). Efficient Attributes for Anonymous Credentials, ACM Transactions on Information and System Security, 15:1, (1-30), Online publication date: 1-Mar-2012.
- Bacelar Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S and Zanella Béguelin S Full proof cryptography Proceedings of the 2012 ACM conference on Computer and communications security, (488-500)
- Wen Y and Zhang F (2011). Delegatable secret handshake scheme, Journal of Systems and Software, 84:12, (2284-2292), Online publication date: 1-Dec-2011.
- Qiu W, Gong Z, Liu B, Long Y and Chen K (2011). Restrictive partially blind signature for resource-constrained information systems, Knowledge and Information Systems, 26:1, (87-103), Online publication date: 1-Jan-2011.
- Furukawa J, Mori K and Sako K An implementation of a mix-net based network voting scheme and its use in a private organization Towards Trustworthy Elections, (141-154)
- Błaśkiewicz P, Kubiak P and Kutyłowski M Two-Head dragon protocol Proceedings of the Second international conference on Trusted Systems, (173-188)
- Au M, Susilo W and Mu Y Proof-of-knowledge of representation of committed value and its applications Proceedings of the 15th Australasian conference on Information security and privacy, (352-369)
- Balan R, Ramasubbu N, Prakobphol K, Christin N and Hong J mFerio Proceedings of the 7th international conference on Mobile systems, applications, and services, (291-304)
- Ateniese G, Camenisch J, Joye M and Tsudik G (2009). Remarks on "Analysis of one popular group signature scheme" in Asiacrypt 2006, International Journal of Applied Cryptography, 1:4, (320-322), Online publication date: 1-Aug-2009.
- Boneh D, Freeman D, Katz J and Waters B Signing a Linear Subspace Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09, (68-87)
- Hu X and Huang S (2008). Analysis of ID-based restrictive partially blind signatures and applications, Journal of Systems and Software, 81:11, (1951-1954), Online publication date: 1-Nov-2008.
- Blanton M Online subscriptions with anonymous access Proceedings of the 2008 ACM symposium on Information, computer and communications security, (217-227)
- Camenisch J, Groß T and Heydt-Benjamin T Rethinking accountable privacy supporting services Proceedings of the 4th ACM workshop on Digital identity management, (1-8)
- Canard S, Malville E and Traoré J Identity federation and privacy Proceedings of the 4th ACM workshop on Digital identity management, (25-32)
- Galbraith S and Verheul E An analysis of the vector decomposition problem Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography, (308-327)
- Belenkiy M, Chase M, Kohlweiss M and Lysyanskaya A P-signatures and noninteractive anonymous credentials Proceedings of the 5th conference on Theory of cryptography, (356-374)
- Hofheinz D and Kiltz E Programmable Hash Functions and Their Applications Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology, (21-38)
- Chen X, Zhang F and Liu S (2007). ID-based restrictive partially blind signatures and applications, Journal of Systems and Software, 80:2, (164-171), Online publication date: 1-Feb-2007.
- Luo Z, Cai X, Pang J and Deng Y Analyzing an Electronic Cash Protocol Using Applied Pi Calculus Proceedings of the 5th international conference on Applied Cryptography and Network Security, (87-103)
- Furukawa J and Imai H An efficient aggregate shuffle argument scheme Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security, (260-274)
- Nguyen L Privacy-protecting coupon system revisited Proceedings of the 10th international conference on Financial Cryptography and Data Security, (266-280)
- Chen X, Zhang F, Mu Y and Susilo W Efficient provably secure restrictive partially blind signatures from bilinear pairings Proceedings of the 10th international conference on Financial Cryptography and Data Security, (251-265)
- Teranishi I and Sako K k-times anonymous authentication with a constant proving cost Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography, (525-542)
- Bao H, Cao Z and Lu R (2005). Proxy signature scheme using self-certified public keys, Applied Mathematics and Computation, 169:2, (1380-1389), Online publication date: 1-Oct-2005.
- Wang S, Hong F and Cui G A fair e-cash payment scheme based on credit Proceedings of the 7th international conference on Electronic commerce, (622-626)
- Nguyen L and Safavi-Naini R Dynamic k-times anonymous authentication Proceedings of the Third international conference on Applied Cryptography and Network Security, (318-333)
- Wei V Tracing-by-linking group signatures Proceedings of the 8th international conference on Information Security, (149-163)
- Chen L, Enzmann M, Sadeghi A, Schneider M and Steiner M A privacy-protecting coupon system Proceedings of the 9th international conference on Financial Cryptography and Data Security, (93-108)
- Naor M and Reingold O (2004). Number-theoretic constructions of efficient pseudo-random functions, Journal of the ACM, 51:2, (231-262), Online publication date: 1-Mar-2004.
- Das A Payment agents Payment technologies for E-commerce, (149-170)
- Kwon E, Cho Y and Chae K Refundable electronic cash for mobile commerce Proceedings of the 2nd international conference on Human.society@internet, (644-649)
- Furukawa J, Miyauchi H, Mori K, Obana S and Sako K An implementation of a universally verifiable electronic voting scheme based on shuffling Proceedings of the 6th international conference on Financial cryptography, (16-30)
- Song D Practical forward secure group signature schemes Proceedings of the 8th ACM conference on Computer and Communications Security, (225-234)
- Maurer U and Wolf S (2000). The Diffie–Hellman Protocol, Designs, Codes and Cryptography, 19:2-3, (147-171), Online publication date: 1-Mar-2000.
- Steiner M, Tsudik G and Waidner M (2000). Key Agreement in Dynamic Peer Groups, IEEE Transactions on Parallel and Distributed Systems, 11:8, (769-780), Online publication date: 1-Aug-2000.
- Pointcheval D and Stern J (2000). Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, 13:3, (361-396), Online publication date: 1-Jan-2000.
- Shoup V Using hash functions as a hedge against chosen ciphertext attack Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (275-288)
- Canetti R and Goldwasser S An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack Proceedings of the 17th international conference on Theory and application of cryptographic techniques, (90-106)
- Dwork C and Naor M (1998). An Efficient Existentially Unforgeable Signature Scheme and Its Applications, Journal of Cryptology, 11:3, (187-208), Online publication date: 1-Jun-1998.
- Naor M and Nissim K Certificate revocation and certificate update Proceedings of the 7th conference on USENIX Security Symposium - Volume 7, (17-17)
- Sakurai K and Shizuya H (1998). A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems, Journal of Cryptology, 11:1, (29-43), Online publication date: 1-Jan-1998.
- Naor M, Ostrovsky R, Venkatesan R and Yung M (1998). Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation, Journal of Cryptology, 11:2, (87-108), Online publication date: 1-Mar-1998.
- Pointcheval D and Stern J New blind signatures equivalent to factorization (extended abstract) Proceedings of the 4th ACM conference on Computer and communications security, (92-99)
- Deng R, Han Y, Jeng A and Ngair T A new on-line cash check scheme Proceedings of the 4th ACM conference on Computer and communications security, (111-116)
- Kelsey J and Schneier B Conditional purchase orders Proceedings of the 4th ACM conference on Computer and communications security, (117-124)
- Camenisch J Efficient and generalized group signatures Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques, (465-479)
- Brands S Rapid demonstration of linear relations connected by boolean operators Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques, (318-333)
- Steiner M, Tsudik G and Waidner M Diffie-Hellman key distribution extended to group communication Proceedings of the 3rd ACM conference on Computer and communications security, (31-37)
- Jakobsson M and Yung M Revokable and versatile electronic money (extended abstract) Proceedings of the 3rd ACM conference on Computer and communications security, (76-87)
- Camenisch J, Piveteau J and Stadler M An efficient fair payment system Proceedings of the 3rd ACM conference on Computer and communications security, (88-94)
- Gobioff H, Smith S, Tygar J and Yee B Smart cards in hostile environments Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2, (3-3)
- Stadler M Publicly verifiable secret sharing Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques, (190-199)
- Jakobsson M Ripping coins for a fair exchange Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques, (220-230)
- Brickell E, Gemmell P and Kravitz D Trustee-based tracing extensions to anonymous cash and the making of anonymous change Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, (457-466)
- Sakurai K and Shizuya H Relationships among the computational powers of breaking discrete log cryptosystems Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques, (341-355)
- Ferguson N Single term off-line coins Workshop on the theory and application of cryptographic techniques on Advances in cryptology, (318-328)
Recommendations
Fair electronic cash based on double signatures
AbstractIn order to decrease crimes such as money laundering, blackmailing etc. in electronic cash systems, fair electronic cash has been a major focus of academic research in electronic commence. When a bank finds some dubious cash or owner, the trusted ...
A Fair and Transferable Off-line Electronic Cash System with Multiple Banks
ICEBE '07: Proceedings of the IEEE International Conference on e-Business EngineeringIn this paper, a fair and transferable off-line electronic cash system (FTOLC) with multiple banks based on group blind signature is proposed. To the best of our knowledge, it is the first electronic cash scheme that issuing banks' anonymity, customers' ...
An Electronic Cash System Based on Group Blind Signatures
One important requirement of electronic cash systems is the anonymity of customers. Unconditional anonymity is also very well suited to support criminals in blackmailing. Maitland and Boyd proposed at ICICS 2001 an offline electronic cash system based ...