Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ALFREDO DE SANTIS:
All reports by Author Alfredo De Santis:

TR98-006 | 27th January 1998
Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano

The Graph Clustering Problem has a Perfect Zero-Knowledge Proof


The input to the {\em Graph Clustering Problem}\/
consists of a sequence of integers m_1,...,m_t
and a sequence of \sum_{i=1}^{t}m_i graphs.
The question is whether the equivalence classes,
under the graph isomorphism relation,
of the input graphs have sizes which match the input sequence of integers.
In this note ... more >>>


TR96-012 | 14th December 1995
Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson

Visual Cryptography for General Access Structures

A visual cryptography scheme for a
set \cal P of n participants is a method to encode a secret
image SI into n shadow images called shares, where each participant in
\cal P receives one share. Certain qualified subsets of participants
can ``visually'' recover the secret image, but
other, ... more >>>




ISSN 1433-8092 | Imprint