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

__
TR96-012
| 14th December 1995
__

Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson#### Visual Cryptography for General Access Structures

Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano

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 >>>

Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson

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 >>>