Home
Short Resume
Publications
On the Web
Teaching
Bookmarks

 

Papers in Journals

bullet 
M. Cafaro, R. Civino, and B. Masucci,
On the Equivalence of Two Security Notions for Hierarchical Key Assignment Schemes
in the Unconditional Setting,
IEEE Transactions on Dependable and Secure Computing, to appear
(DOI: 10.1109/TDSC.2014.2355841)
 
bullet 
G. Ateniese, A. De Santis, A. L. Ferrara, and B. Masucci,
A Note on Time-Bound Hierarchical Key Assignment Schemes,
Information Processing Letters, Vol. 113, No. 5-6, pp. 151-155, 2013.
 
bullet 
G. Ateniese, A. De Santis, A. L. Ferrara, and B. Masucci,
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes,
Journal of Cryptology, Vol. 25, No. 2, pp. 243-270, 2012.
 
bullet 

 

A. De Santis, A. L. Ferrara, and B. Masucci,
Efficient Provably-Secure Hierarchical Key Assignment Schemes

Theoretical Computer Science, Vol. 412(41), pp. 5684-5699, 2011.
 
bullet 

 

P. D'Arco, A. De Santis, A. L. Ferrara, and B. Masucci,
Variations on a Theme by Akl and Taylor: Security and Tradeoffs,
Theoretical Computer Science, Vol. 411, pp. 213-227, 2010.
 
bullet 

 

A. De Santis, A. L. Ferrara, and B. Masucci,
New Constructions for Provably-Secure Time-Bound Hierarchical Key
Assignment Schemes,

Theoretical Computer Science, Vol. 407, No. 1-3, pp. 213-230, November 2008.
 
bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
An Attack on a Payment Scheme,
Information Sciences,
Vol. 178, No. 5, pp. 1418-1421, March 2008.
 
bullet 
A. De Santis and B. Masucci,
New Results on Non-Perfect Sharing of Multiple Secrets,
The Journal of Systems and Software, Vol. 80, No. 2, pp. 216-223, February 2007.
 
bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
Enforcing the Security of a Time-Bound Hierarchical Key Assignment Scheme,
Information Sciences,Vol. 176, No. 12, pp. 1684-1694, June 2006.
 
bullet 
B. Masucci,
Sharing Multiple Secrets: Models, Schemes, and Analysis,
Designs, Codes, and Cryptography, Vol. 39, No. 1, pp. 89-111, April 2006.
 
bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
Unconditionally Secure Key Assignment Schemes,
Discrete Applied Mathematics, Vol. 154, No. 2 , pp. 234-252, February 2006.
 
bullet 
S. Cimato, A. De Santis, A. L. Ferrara, and B. Masucci,
Ideal Contrast Visual Cryptography Schemes with Reversing,
Information Processing Letters,
Vol. 93, No. 4, pp. 199-206, February 2005.
 
bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
Cryptographic Key Assignment Schemes for Any Access Control Policy,
Information Processing Letters, Vol. 92, No. 4, pp. 199-205, November 2004.
 
bullet 
C. Blundo, S. Martin, B. Masucci, and C. Padrņ,
A Linear Algebraic Approach to Metering Schemes,
Designs, Codes, and Cryptography,
Vol. 33, pp. 241-260, 2004.
 
bullet 
A. De Santis and B. Masucci,
Anonymous Membership Broadcast Schemes,
Designs, Codes, and Cryptography,  Vol. 32, No. 1, pp. 135-151, 2004.
 
bullet 
C. Blundo, S. Cimato, and B. Masucci,
A Note on Optimal Metering Schemes,
Information Processing Letters, Vol. 84 No. 6, pp. 319-326, November 2002.
 
bullet 
C. Blundo, B. Masucci, D.R. Stinson and R. Wei,
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes,
Designs, Codes, and Cryptography, Vol. 26, pp. 97-110, 2002.
 
bullet 
C. Blundo, A. De Bonis, and B. Masucci,
Bounds and Constructions for Metering Schemes,
Communications in Information and Systems, Vol. 2, No. 1, pp. 1-28, June 2002.
 
bullet 
B. Masucci and D. R. Stinson,
Efficient Metering Schemes with Pricing,
IEEE Transactions on Information Theory, Vol. 47, No. 7,  pp. 2835-2844, November 2001.
 
bullet 
A. De Santis and B. Masucci,
On Secret Set Schemes,
Information Processing Letters, Vol. 74, Issue 5-6,  pp. 243-251, June 2000.
 
bullet 
A. De Santis and B. Masucci,
Multiple Ramp Schemes,
IEEE Transactions on Information Theory, Vol. 45, No. 5, pp. 1720-1728, July 1999.
 
bullet 
C. Blundo and B. Masucci,
A Note on the Randomness in Dynamic Threshold Schemes,
Journal of Computer Security, Vol. 7, No. 1, pp. 73-85, 1999.
 
bullet 
C. Blundo and B. Masucci,
Randomness in Multi-Secret Sharing Schemes,
Journal of Universal Computer Science, Vol. 5, No. 7, pp. 367-389, 1999.
 
bullet 
A. De Santis and B. Masucci,
A Lower Bound on the Encoding Length in Lossy Transmission,
Information Sciences, No. 116, pp. 129-146, June 1999.

 

Papers in Proceedings

bullet 
A. Castiglione, A. De Santis, and B. Masucci,
Hierarchical and Shared Key Assignment,
in Proc. of the 17th IEEE International Conference on Network-Based Information Systems - NBIS 2014, Salerno, Italy, September 10 - 12, 2014.

 
bullet 
P. D'Arco, A. De Santis, A. L. Ferrara, and B. Masucci,
Security and Tradeoffs of the Akl-Taylor Scheme and its Variants,
in Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science - MFCS 2009,
Novy Smokovec, High Tatras, Slovak Republic, August 24 - 28, 2009, R. Kralovic and D. Niwinski (Eds.), Lecture Notes in Computer Science, Vol. 5734, pp. 247-257, Springer Verlag, 2009.
 
bullet 

 

A. De Santis, A. L. Ferrara, and B. Masucci,
Efficient Provably-Secure Hierarchical Key Assignment Schemes,
in Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science - MFCS 2007, Cesky Krumlov, Czech Republic,  August 27 - 31, 2007, L. Kucera and A. Kucera (Eds.), Lecture Notes in Computer Science, Vol. 4708, pp. 371-382, Springer Verlag, 2007.
Extended version in Cryptology ePrint Archive, Report 2006/479

 
bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes,
in Proc. of the 12th ACM Symposium on Access Control Models and Technologies - SACMAT 2007, Sophia Antipolis, France, June 20 - 22 2007, pp. 133-138.
Extended version in Cryptology ePrint Archive, Report 2006/483

 
bullet 
 
G. Ateniese, A. De Santis, A. L. Ferrara, and B. Masucci,
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes,
in Proc. of the 14th ACM Conference on Computer and Communications Security - CCS 2006, Alexandria, Virginia, USA, November 2006, pp. 288-297.
Extended version in Cryptology ePrint Archive, Report 2006/225
 
bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy,
in Proc. of the International Workshop on Coding and Cryptography - WCC 2005, Bergen, Norway, March 14 - 18  2005, O. Ytrehus (Ed.), Lecture Notes in Computer Science, Vol. 3969, pp. 202-217, Springer Verlag, 2006.
 
bullet 
S. Cimato, C. Galdi, R. Giordano, B. Masucci, and G. Tomasco,
Design and Implementation of an Inline Certified E-mail Service,
in Proc. of The Fourth International Conference on Cryptology and Network Security - CANS 2005, Xiamen, China, December 14 - 16, 2005, Y. Desmedt, H. Wang, Y. Mu, Y. Li (Eds.), Lecture Notes in Computer Science, Vol. 3810, pp. 186-199, Springer Verlag, 2005.
 
bullet 
A. L. Ferrara and B. Masucci,
An Information-Theoretic Approach to the Access Control Problem,
in Proc. of The Eighth Italian Conference on Theoretical Computer Science - ICTCS 2003, University Center Bertinoro, Italy, October 13 - 15, 2003, Lecture Notes in Computer Science,  Vol. 2841, pp. 342-354, Springer Verlag, 2003.

bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
Unconditionally Secure Hierarchical Key Assignment Schemes,
in Proc. of the International Workshop on Coding and Cryptography - WCC 2003, Veirsalles, France, March 24 - 28, 2003.

bullet 
A. De Santis and B. Masucci,
On Information Dispersal Algorithms,
in Proc. of 2002 IEEE International Symposium on Information Theory - ISIT 2002, Lausanne, Switzerland, June 30 - July 5, 2002.
 
bullet 
C. Blundo, S. Martin, B. Masucci, and C. Padrņ,
New Bounds on the Communication Complexity of Metering Schemes,
in Proc. of 2002 IEEE International Symposium on Information Theory - ISIT 2002, Lausanne, Switzerland, June 30 - July 5, 2002.
 
bullet 
B. Masucci and D. R. Stinson,
Metering Schemes for General Access Structures,
in Proc. of 6th European Symposium on Research in Computer Security - ESORICS 2000, Toulouse, France, October 4 - 6, 2000, F. Cuppens, Y. Deswarte, D. Gollmann, M.Waidner (Eds.), Lecture Notes in Computer Science,  Vol. 1895, pp. 72-87, Springer Verlag, 2000.
 
bullet 
C. Blundo, A. De Bonis, and B. Masucci,
Metering Schemes with Pricing,
in Proc. of 14th International Symposium on DIStributed Computing - DISC 2000, Toledo, Spain, October 4 - 6, 2000, M. Herlihy (Ed.), Lecture Notes in Computer Science, Vol. 1914, pp. 194-208, Springer Verlag, 2000.
 
bullet 
C. Blundo, A. De Bonis, B. Masucci, and D. R. Stinson,
Dynamic Multi-Threshold Metering Schemes,
in Proc. of Seventh Annual Workshop on Selected Areas in Cryptography - SAC 2000, Waterloo, Canada, Aug 14 - 15, 2000, D. R. Stinson, S. Tavares (Eds.), Lecture Notes in Computer Science, Vol. 2012, pp. 130-144, Springer Verlag, 2001.
 
bullet 
A. De Bonis and B. Masucci,
An Information Theoretical Approach to Metering Schemes,
in Proc. of 2000 IEEE International Symposium on Information Theory - ISIT 2000, Sorrento, Italy, June 25 - 30, 2000.
 
 

Preprints

bullet 
A. Castiglione, A. De Santis, and B. Masucci,
Key Indistinguishability vs. Strong Key Indistinguishability for Hierarchical Key Assignment Schemes
IACR Cryptology ePrint Archive, Report 752, 2014

 

Chapters in Books

bullet 
A. De Santis, A. L. Ferrara, and B. Masucci,
Visual Cryptography Schemes with Reversing,
in "Visual Cryptography and Secret Image Sharing", CRC Press, Boca Raton, USA, August 2011.
 
bullet 
S. Cimato, C. Blundo, and B. Masucci,
Secure Web Metering,
in "Network Security", Scott C.-H. Huang, David MacCallum, Ding-Zhu Du (editors), Springer Verlag New York Inc. , USA, October 2008.
 
   
   
   
   
     

Last Modified: 16-10-14