Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Crescenzo, Giovanni di"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Neccessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all
NP
relations
Alfredo de Santis
,
Giovanni di Crescenzo
,
Giuseppe Persiano
Lecture Notes in Computer Science
1853
, 2000, pp. 451-462
The graph clustering problem has a perfect zero-knowledge interactive proof
Alfredo de Santis
,
Giovanni di Crescenzo
,
Oded Goldreich
,
Giuseppe Persiano
Information Processing Letters
69
(4), 1999, pp. 201-206
The graph clustering problem has a perfect zero-knowledge proof
Alfredo de Santis
,
Giovanni di Crescenzo
,
Oded Goldreich
,
Giuseppe Persiano
Technical Report (TR98-006), 1998, January
Randomness-efficient non-interactive zero knowledge
Alfredo de Santis
,
Giovanni di Crescenzo
,
Pino Persiano
Lecture Notes in Computer Science
1256
, 1997, pp. 716-726
On monotone formula closure of SZK
Alfredo de Santis
,
Giovanni di Crescenzo
,
Giuseppe Persiano
,
Moti Yung
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 454-465
The knowledge complexity of quadratic residuosity languages
Alfredo de Santis
,
Giovanni di Crescenzo
,
Guiseppe Persiano
Theoretical Computer Science
132
(1-2), 1994, pp. 291-317