The Structure and complexity of interactive zero-knowledge proofs
Μαθηματική Επιθεώρηση, Tome 30 (1986), pp. 1-20
Cet article a éte moissonné depuis la source Hellenic Digital Mathematics Library
@article{MR_1986_30_a0,
author = {N. Alexandris and M. Burmester and V. Chrissikopoulos},
title = {The {Structure} and complexity of interactive zero-knowledge proofs},
journal = {M\ensuremath{\alpha}\ensuremath{\theta}\ensuremath{\eta}\ensuremath{\mu}\ensuremath{\alpha}\ensuremath{\tau}\ensuremath{\iota}\ensuremath{\kappa}\ensuremath{\acute\eta} E\ensuremath{\pi}\ensuremath{\iota}\ensuremath{\theta}\ensuremath{\varepsilon}\ensuremath{\acute\omega}\ensuremath{\rho}\ensuremath{\eta}\ensuremath{\sigma}\ensuremath{\eta}},
pages = {1--20},
year = {1986},
volume = {30},
language = {gr},
url = {http://geodesic.mathdoc.fr/item/MR_1986_30_a0/}
}
N. Alexandris; M. Burmester ; V. Chrissikopoulos. The Structure and complexity of interactive zero-knowledge proofs. Μαθηματική Επιθεώρηση, Tome 30 (1986), pp. 1-20. http://geodesic.mathdoc.fr/item/MR_1986_30_a0/