Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies (1994)

by Joan Boyar , Katalin Friedl , Carsten Lund

Venue:	JOURNAL OF CRYPTOLOGY
Citations:	28 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies	user correction - Legacy Corrections
AUTHOR NAME	Joan Boyar	user correction
AUTHOR AFFIL	Computer Science Department; University of Chicago	user correction
AUTHOR NAME	Katalin Friedl	user correction
AUTHOR AFFIL	Computer Science Department; University of Chicago	user correction
AUTHOR NAME	Carsten Lund	user correction
AUTHOR AFFIL	Computer Science Department; University of Chicago	user correction
ABSTRACT	New zero-knowledge proofs are given for some number-theoretic problems. All of the problems are in NP, but the proofs given here are much more efficient than the previously known proofs. In addition, these proofs do not require the prover to be super-polynomial in power. A probabilistic polynomial time prover with the appropriate trap-door knowledge is sufficient. The proofs are perfect or statistical zero-knowledge in all cases except one.	user correction
YEAR	1994	user correction - Legacy Corrections
VENUE	JOURNAL OF CRYPTOLOGY	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	155--172	INFERENCE
VOLUME	4	INFERENCE
CITATIONS	31 found	ParsCit 1.0