Interactive bi-proof systems and undeniable signature schemes

Authors:
Atsushi Fujioka;Tatsuaki Okamoto;Kazuo Ohta
Affiliations:
NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan;NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan;NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 11
Cited 5

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Zero knowledge proofs of identity

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Minimum-knowledge interactive proofs for decision problems

SIAM Journal on Computing
Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfect zero-knowledge in constant rounds

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Zero-knowledge undeniable signatures (extended abstract)

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Undeniable Signatures

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Random self-reducibility and zero knowledge interactive proofs of possession of information

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

How to Construct Fail-Stop Confirmer Signature Schemes

ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Undeniable Confirmer Signature

ISW '99 Proceedings of the Second International Workshop on Information Security
Provably secure pairing-based convertible undeniable signature with short signature length

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Information privacy?!

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

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).