Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Perfectly Secure Key Distribution for Dynamic Conferences

- C. Blundo, A. Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung
- Computer Science
- Inf. Comput.
- 10 October 1998

Abstract In this paper we analyze perfectly secure key distribution schemes for dynamic conferences. In this setting,anymember of a group oftusers can compute a common key using only his private… Expand

Visual Cryptography for General Access Structures

- G. Ateniese, C. Blundo, A. Santis, D. Stinson
- Computer Science
- Inf. Comput.
- 15 September 1996

A visual cryptography scheme for a set P ofnparticipants is a method of encoding a secret imageSIintonshadow images called shares, where each participant in P receives one share. Certain qualified… Expand

Perfectly-Secure Key Distribution for Dynamic Conferences

- C. Blundo, A. Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung
- Computer Science
- CRYPTO
- 16 August 1992

A key distribution scheme for dynamic conferences is a method by which initially an (off-line) trusted server distributes private individual pieces of information to a set of users. Later any group… Expand

Extended capabilities for visual cryptography

- G. Ateniese, C. Blundo, A. Santis, D. Stinson
- Computer Science
- Theor. Comput. Sci.
- 6 January 2001

An extended visual cryptography scheme (EVCS), for an access structure (ΓQual,ΓForb) on a set of n participants, is a technique to encode n images in such a way that when we stack together the… Expand

Robust Non-interactive Zero Knowledge

- A. Santis, G. Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai
- Computer Science
- CRYPTO
- 19 August 2001

Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attention in the last decade and has… Expand

Design of Self-Healing Key Distribution Schemes

- C. Blundo, Paolo D'Arco, A. Santis, M. Listo
- Computer Science, Mathematics
- Des. Codes Cryptogr.
- 1 May 2004

A self-healing key distribution scheme enables dynamic groups of users of an unreliable network to establish group keys for secure communication. In such a scheme, a group manager, at the beginning… Expand

On the Contrast in Visual Cryptography Schemes

- C. Blundo, A. Santis, D. Stinson
- Computer Science, Mathematics
- Journal of Cryptology
- 1 September 1999

Abstract. A visual cryptography scheme is a method to encode a secret image SI into shadow images called shares such that certain qualified subsets of shares enable the ``visual'' recovery of the… Expand

Noninteractive Zero-Knowledge

- M. Blum, A. Santis, S. Micali, G. Persiano
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 December 1991

This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string.Without any assumption, it i...

On the Size of Shares for Secret Sharing Schemes

- R. Capocelli, A. Santis, L. Gargano, U. Vaccaro
- Computer Science
- CRYPTO
- 11 August 1991

A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of partecipants can recover the secret, but any non-qualified subset has absolutely… Expand

Improved Schemes for Visual Cryptography

- C. Blundo, A. D. Bonis, A. Santis
- Mathematics, Computer Science
- Des. Codes Cryptogr.
- 1 December 2001

A (k,n)-threshold visual cryptography scheme ((k,n)-threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the… Expand