A digital cash protocol based on additive zero knowledge

Authors:
Amitabh Saxena;Ben Soh;Dimitri Zantidis
Affiliations:
Dept. of Computer Science and Computer Engineering, La Trobe University, Bundoora, VIC, Australia;Dept. of Computer Science and Computer Engineering, La Trobe University, Bundoora, VIC, Australia;Dept. of Computer Science and Computer Engineering, La Trobe University, Bundoora, VIC, Australia
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 11
Cited 3

Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs

CRYPTO '89 Proceedings on Advances in cryptology
Noninteractive zero-knowledge

SIAM Journal on Computing
Money in electronic commerce: digital cash, electronic fund transfer, and Ecash

Communications of the ACM
An observation on associative one-way functions in complexity theory

Information Processing Letters
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM Journal on Computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Digital Payment Systems with Passive Anonymity-Revoking Trustees

ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
If P != NP Then Some Strongly Noninvertible Functions Are Invertible

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Authenticating Mobile Agent Platforms Using Signature Chaining Without Trusted Third Parties

EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service

Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions

Theoretical Computer Science
Improved conditional e-payments

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for one-way functions in complexity theory

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce the concept of Additive Non-Interactive Zero Knowledge (NIZK). We extend the notion of NIZK proofs to include the prover's identity as part of the theorem being proved. An additive proof allows a verifier to construct a new proof of knowledge using the information from an old proof. Intuitively, an additive proof is a proof of knowledge of knowledge. As an application of this concept, we propose a digital cash scheme with transferable coins.