Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{DeSantis:1994:KCQ,
author = "Alfredo {De Santis} and Giovanni Di Crescenzo and
Guiseppe Persiano",
title = "The knowledge complexity of quadratic residuosity
languages",
journal = j-THEOR-COMP-SCI,
volume = "132",
number = "1--2",
pages = "291--317",
day = "26",
month = sep,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:25 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=132&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=132&issue=1-2&aid=1595",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6150M (Protocols); C4240
(Programming and algorithm theory); C5640 (Protocols);
C6130S (Data security)",
corpsource = "Dipartimento di Inf. ed Applicazioni, Salerno Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; cryptography; interactive
perfect zero-knowledge proofs; knowledge complexity;
noninteractive perfect zero-knowledge proofs; perfect
zero-knowledge proofs; protocol; protocols; quadratic
residuosity languages",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}