The Structure and complexity of interactive zero-knowledge proofs
N. Alexandris; M. Burmester; V. Chrissikopoulos
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας (1989)
- Volume: 30, Issue: 30, page 1-20
- ISSN: 0072-7466
Access Full Article
top
How to cite
topN. Alexandris, M. Burmester, and V. Chrissikopoulos. "The Structure and complexity of interactive zero-knowledge proofs." Δελτίο της Ελληνικής Μαθηματικής Εταιρίας 30.30 (1989): 1-20. <http://eudml.org/doc/238606>.
@article{N1989,
author = {N. Alexandris, M. Burmester, V. Chrissikopoulos},
journal = {Δελτίο της Ελληνικής Μαθηματικής Εταιρίας},
keywords = {zero-knowledge proofs; lower bound},
language = {eng},
number = {30},
pages = {1-20},
title = {The Structure and complexity of interactive zero-knowledge proofs},
url = {http://eudml.org/doc/238606},
volume = {30},
year = {1989},
}
TY - JOUR
AU - N. Alexandris
AU - M. Burmester
AU - V. Chrissikopoulos
TI - The Structure and complexity of interactive zero-knowledge proofs
JO - Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
PY - 1989
VL - 30
IS - 30
SP - 1
EP - 20
LA - eng
KW - zero-knowledge proofs; lower bound
UR - http://eudml.org/doc/238606
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.