A practical anonymous payment scheme for electronic commerce
Computers & Mathematics with ApplicationsPublished 1 December 2003
Wen-Shenq Juang
Citations14
SJR quartileQ1
SJR score0.95
SNIP1.31
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
By means of this proposed scheme, the size of a bank's database is dramatically reduced and the issue of e-coins for an anonymous account is controlled by several issuers, who represent a bank and who can be chosen by the customer or assigned by the system.
Abstract
We propose a practical anonymous payment scheme with anonymous accounts. By means of our proposed scheme, the size of a bank's database is dramatically reduced. Also, the issue of e-coins for an anonymous account is controlled by several issuers, who represent a bank and who can be chosen by the customer or assigned by the system, on the current available issuers list according to the internet conditions. Our scheme does not require the assistance of a mutually entrusted third party.
Keywords
Computer Science
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,142 Citations1983Ronald L. Rivest, Adi Shamir +1 more
Communications of the ACMA method for obtaining digital signatures and public-key cryptosystems
13,083 Citations1978Ronald L. Rivest, Adi Shamir +1 more
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
Choice Reviews OnlineHandbook of applied cryptography
10,469 Citations1997Menezes, Alfred J., Oorschot, Paul C. van +1 more
Communications of the ACMUntraceable electronic mail, return addresses, and digital pseudonyms
4,260 Citations1981David Chaum
A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system.
Blind Signatures for Untraceable Payments
3,197 Citations1983David Chaum
Automation of the way the authors pay for goods and services is already underway, as can be seen by the variety and growth of electronic banking services available to consumers.
Lecture notes in computer scienceNon-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
2,352 Citations2007Torben Pryds Pedersen
It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons.
Journal of CryptologyThe dining cryptographers problem: Unconditional sender and recipient untraceability
1,403 Citations1988David Chaum
The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively, and can be adapted to address efficiently a wide variety of practical considerations.
IEEE Transactions on Information TheoryAn improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
1,186 Citations1978S.C. Pohlig, Martin E. Hellman
An improved algorithm is derived which requires O =(\log^{2} p) complexity if p - 1 has only small prime factors and such values of p must be avoided in the cryptosystem.
Lecture notes in computer scienceUntraceable Electronic Cash
1,109 Citations1990David Chaum, Amos Fiat +1 more
An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
A practical scheme for non-interactive verifiable secret sharing
1,078 Citations1987Paul Feldman
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing, which provides asynchronous networks with a constant-round simulation of simultaneous broadcast networks whenever even a bare majority of processors are good.
Lecture notes in computer scienceOne Way Hash Functions and DES
872 Citations1990Ralph C. Merkle
This work shows three one-way hash functions which are secure if DES is a good random block cipher.
Lecture notes in computer scienceA practical secret voting scheme for large scale elections
825 Citations1993Atsushi Fujioka, Tatsuaki Okamoto +1 more
This paper proposes a practical secret voting scheme for large scale elections that ensures the privacy of the voters even if both the administrator and the counter conspire, and realizes voting fairness, i.e., no one can know even intermediate result of the voting.
Lecture notes in computer scienceA Threshold Cryptosystem without a Trusted Party
757 Citations2007Torben Pryds Pedersen
In a threshold cryptosystem n members share the necret key of an organization such that k members must cooperate in order to decipher a given uphertext, it is shown how to implement a scheme without having a trusted party, which selects the secret key and distributes it to the members.
Lecture notes in computer scienceSecure Distributed Key Generation for Discrete-Log Based Cryptosystems
521 Citations1999Rosario Gennaro, Stanisław Jarecki +2 more
Lecture notes in computer scienceUniversal Electronic Cash
306 Citations2007Tatsuaki Okamoto, Kazuo Ohta
The main advantage of the new system is that the customer can subdivide his cash balance into many pieces in any way he pleases until the total value of all subdivided piece equals C.
Lecture notes in computer scienceBlind signatures based on the discrete logarithm problem
231 Citations1995Jan Camenisch, Jean-Marc Piveteau +1 more
Two new blind signature schemes based on the discrete logarithm problem are presented, useful in protocols that guarantee the anonymity of the participants.
ComputerThe state of the art in electronic payment systems
229 Citations1997N. Asokan, P. Janson +2 more
An overview of electronic payment systems is provided, focusing on issues related to security, which can actually provide better security than traditional means of payments, in addition to flexibility.
Lecture notes in computer scienceTransferred Cash Grows in Size
150 Citations2007David Chaum, Torben Pryds Pedersen
It is shown that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred, and it is argued that an unlimited powerful user can always recognize his money later.
ACM Transactions on Computer SystemsA digital multisignature scheme using bijective public-key cryptosystems
146 Citations1988Tatsuaki Okamoto
Lecture notes in computer scienceSingle-term divisible electronic coins
83 Citations1995Tony Eng, Tatsuaki Okamoto
This paper presents the construction of more efficient “divisible” off-line electronic coin schemes that are “single-term”, and examines some coin systems based on the “disposable authentication” paradigm, and shows that a specific type of “Disposable authenticated” coin system can be extended to handle divisible coins using the authors' techniques.
A Secure and Practical Electronic Voting Scheme for Real World Environments
54 Citations1997Wen-Shenq Juang, Chin‐Laung Lei
Computer CommunicationsAnonymous channel and authentication in wireless communications
48 Citations1999Wen-Shenq Juang, Chin‐Laung Lei +1 more
By providing anonymous channel service in wireless communications, many interesting applications, such as electronic elections, anonymous group discussions, with user identification confidential can be easily realized.
Computers & SecurityA collision-free secret ballot protocol for computerized general elections
32 Citations1996Wen-Shenq Juang, Chin‐Laung Lei
This paper presents a collision-free secret ballot protocol based on the uniquely blind signature technique that can be used to hold large-scale general elections because it ensures independence among voters without the need for any global computation.
Computer CommunicationsPartially blind threshold signatures based on discrete logarithm
27 Citations1999Wen-Shenq Juang, Chin‐Laung Lei
The proposed group-oriented partially blind (t, n) threshold signature scheme can greatly simplify the voting processes when several elections are to be held in a short period of time by embedding information about each election in a partially blind threshold signature.
Lecture notes in computer sciencePerspectives on financial cryptography
18 Citations1997Ronald L. Rivest
I present some debatable propositions about financial systems and financial cryptography that may contradict each other.
Lecture notes in computer scienceBlind threshold signatures based on discrete logarithm
16 Citations1996Wen-Shenq Juang, Chin‐Laung Lei
Two group-oriented (t, n) blind threshold signature schemes based on the discrete logarithm problem are proposed, each signer can select his own private key and the group public key is determined by all the members.
Applied Mathematics and ComputationA practical anonymous multi-authority e-cash scheme
15 Citations2003Wen-Shenq Juang, Horng–Twu Liaw
A practical multi-authority e-cash scheme that satisfies anonymity, security and verifiability, and the issue of e-coins is controlled by several issuers is proposed.
International Journal of Electronic CommerceAn Efficient Blind Signature Scheme for Information Hiding
14 Citations2001Wei-Kuei Chen Chun-I Fan
An efficient blind signature scheme under which information can be hidden in the signature and uncovered later for security purposes is presented, which consists of just two hashing operations.
Data Archiving and Networked Services (DANS)Single term off-line coins
10 Citations1993Niels Ferguson