Abstract
This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum’s scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. And we show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes assure signature confirmation and disavowal with the same protocol (or at the same time).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
G. Brassard, D. Chaum, and C. Crépeau, “Minimum Disclosure Proofs of Knowledge”, Journal of Computer and System Sciences, Vol.37, No.2, pp. 156–189 (Oct., 1988).
M. Bellare, S. Micali, and R. Ostrovsky, “Perfect Zero-Knowledge in Constant Rounds”, Proceedings of 22nd annual ACM Symposium on Theory of Computing, pp.482–493 (May, 1990).
D. Chaum, “Zero-Knowledge Undeniable Signatures”, in Advances in Cryptology — EUROCRYPT’ 90, Lecture Notes in Computer Science 473, Springe-Verlag, Berlin, pp.458–464 (1991).
D. Chaum and H. van Antwerpen, “Undeniable Signatures”, in Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.212–216 (1990).
W. Diffie and M. E. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, Vol.IT-22, No.6, pp.644–654 (Nov., 1976).
U. Feige, A. Fiat, and A. Shamir, “Zero Knowledge Proofs of Identity”, Proceedings of 19th annual ACM Symposium on Theory of Computing, pp.210–217 (May, 1987).
Z. Galil, S. Haber, and C. Yung, “Minimum-Knowledge Interactive Proofs for Decision Problems”, SIAM Journal on Computing, Vol.18, No.4, pp.711–739 (Aug., 1989).
O. Goldreich and L. Levin, “A Hard-Core Predicate for all On-Way Functions”, Proceedings of 21st annual ACM Symposium on Theory of Computing, pp.25–32 (May, 1989).
S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proof-Systems”, Proceedings of 17th annual ACM Symposium on Theory of Computing, pp.291–304 (May, 1985).
R. Impagliazzo, L. Levin, and M. Luby, “Pseudo-Random Number Generation from One-Way Functions”, Proceedings of 21st annual ACM Symposium on Theory of Computing, pp.12–24 (May, 1989).
M. Naor, “Bit Commitment Using Pseudo-Randomness”, in Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.128–136 (1990).
M. Tompa and H. Woll, “Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information”, 28th Annual Symposium on Foundations of Computer Science, IEEE, pp.472–482 (Oct., 1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujioka, A., Okamoto, T., Ohta, K. (1991). Interactive Bi-Proof Systems and Undeniable Signature Schemes. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive