Short discreet proofs

Authors:
Joan Boyar;René Peralta
Affiliations:
Department of Mathematics and Computer Science, Odense University, Denmark;Japan Advanced Institute of Science and Technology, School of Information Science, Ishikawa, Japan
Venue:
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Year:
1996

Citing 10
Cited 3

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge simulation of Boolean circuits

Proceedings on Advances in cryptology---CRYPTO '86
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A discrete logarithm implementation of perfect zero-knowledge blobs

Journal of Cryptology
Noninteractive zero-knowledge

SIAM Journal on Computing
Subquadratic zero-knowledge

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Secret sharing and perfect zero knowledge

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A Simple and Secure Way to Show the Validity of Your Public Key

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiple non-interactive zero knowledge proofs based on a single random string

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Group Signature Scheme with Improved Efficiency

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. The proofs are non-interactive provided that the quadratic residuosity bit commitment scheme is available to the Prover and Verifier. For typical applications, the proofs are short enough to fit on a floppy disk.