Alfredo De Santis, Papers Available Online

• Randomness-efficient Non-Interactive Zero-knowledge
  ICALP '97 (with G. Di Crescenzo, and G. Persiano).
  
• Visual Cryptography for General Access Structures
  Information and Computation, to appear (with G. Ateniese, C. Blundo, and D.R. Stinson).
  
• Constructions and Bounds for Visual Cryptography
  ICALP '96 (with G. Ateniese, C. Blundo, and D.R. Stinson).
  
• On the Number of Random Bits in Totally Private Computation
  ICALP '95 (with C. Blundo, G. Persiano, and U. Vaccaro).
  Click here to get the postscript
  
• Zero-Knowledge Arguments and Public-Key Cryptography,
  Information and Computation, vol. 121, n. 1, 1995, pp. 23--40 (with G. Di Crescenzo and G. Persiano).
• Tight Upper and Lower Bounds on the Path Length of Binary Tree,
  SIAM Journal on Computing, 23(1):12--23, 1994 (with G. Persiano).
• On Monotone Formula Closure of SZK
  In Proceedings of the 35th Symposium on Foundations of Computer Science 1994, (FOCS '94), Santa Fe, NM, 20--22 November, 1994, pages 454--465 (with G. Di Crescenzo, G. Persiano, and M. Yung). Click here to get the postscript
• Zero-Knowledge Proofs of Knowledge Without Interaction
  In Proceedings of the 33rd Symposium on Foundations of Computer Science 1992, (FOCS '92), Pittsburgh, PA, 24--27 October 1992, pages 427--437, 1992 (with G. Persiano).
• NonInteractive Zero-Knowledge
  SIAM Journal on Computing, 20(6):1084-1118, 1991 (with M. Blum, S. Micali, and G. Persiano).
• On the Sizes of Shares for Secret Sharing Schemes
  Journal of Cryptology, vol. 6, 157--167, 1993 (with R. M. Capocelli, L. Gargano, and U. Vaccaro).
• New Bounds on the Information Rate of Secret Sharing Schemes,
  IEEE Transactions on Information Theory, vol. 41, n. 2, 549--554, 1995 (with C. Blundo, G. Gaggia, and U. Vaccaro).
• Graph Decompositions and Secret Sharing Schemes,
  Journal of Cryptology, vol. 8, 39--64, 1995, (with C. Blundo, D. R. Stinson, and U. Vaccaro).
• On the Information Rate of Secret Sharing Schemes,
  Theoretical Computer Science, vol. 154, 283--306, 1996,
  (with C. Blundo, L. Gargano, and U. Vaccaro).
• Randomness in Distribution Protocols,
  an extended abstract of this paper appeared in Proc. of the 21 International Colloquium on Automata, Languages, and Programming (ICALP '94), S. Abiteboul and E. Shamir (Eds.), Lectures Notes in Computer Science, vol. 820, pp. 568--579, Springer-Verlag, 1994.
  (with C. Blundo and U. Vaccaro).
• On the Number of Random Bits in Totally Private Computation,
  an extended abstract of this paper appeared in Proc. of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP '95), Z. Fülöp and F. Gecseg (Eds.), Lectures Notes in Computer Science, vol. 944, pp. 171--182, Springer-Verlag, 1995.
  (with C. Blundo, G. Persiano, and U. Vaccaro).
• Fully Dynamic Secret Sharing Schemes,
  Theoretical Computer Science, to appear,
  (with C. Blundo, A. Cresti, and U. Vaccaro).
• Secret Sharing Schemes with Veto Capabilities,
  in: Proceedings of French-Israeli Workshop in Algebraic Coding, G. Cohen, S. Litsyn, A. Lobstein, and G. Zemor, (Eds), Lectures Notes in Computer Science, vol. 781, pp. 82--89, 1994, Springer-Verlag.
  (with C. Blundo, L. Gargano, and U. Vaccaro)
• Perfectly-Secure Conference Key Distribution,
  an extended abstract of this paper appeared in: Advances in Cryptology -- CRYPTO '92, E. Brickell (Ed.), vol. 740, Lectures Notes in Computer Science, pp. 471--486, 1993, Springer-Verlag.
  (with C. Blundo, A. Herzberg, S. Kutten, M. Yung, and U. Vaccaro).
• Size of Shares and Probability of Cheating in Threshold Schemes,
  in: Advances in Cryptology -- EUROCRYPT '93, T. Helleseth (Ed.), Lectures Notes in Computer Science, vol. 765, pp. 118--125, Springer-Verlag, 1994.
  (with M. Carpentieri and U. Vaccaro).