New constructions for provably-secure time-bound hierarchical key assignment schemes

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Alfredo De Santis Università di Salerno, Fisciano (SA), Italy
Anna Lisa Ferrara Università di Salerno, Fisciano (SA), Italy
Barbara Masucci Università di Salerno, Fisciano (SA), Italy
Published in:
· Proceeding
SACMAT '07 Proceedings of the 12th ACM symposium on Access control models and technologies
Pages 133 - 138
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-745-2 doi>10.1145/1266840.1266861
New constructions for provably-secure time-bound hierarchical key assignment schemes Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 2
· Downloads (cumulative): 214
· Citation Count: 7


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder