New constructions for provably-secure time-bound hierarchical key assignment schemes
New constructions for provably-secure time-bound hierarchical key assignment schemes
133-138
Santis, Alfredo De
817ed445-60f0-4f63-aafb-866b932010b8
Ferrara, Anna Lisa
adbca2ba-5d6e-4888-975c-69b8f8fa461e
Masucci, Barbara
ec9fd4b1-4c60-4385-9cd9-9400c0bd8df2
2007
Santis, Alfredo De
817ed445-60f0-4f63-aafb-866b932010b8
Ferrara, Anna Lisa
adbca2ba-5d6e-4888-975c-69b8f8fa461e
Masucci, Barbara
ec9fd4b1-4c60-4385-9cd9-9400c0bd8df2
Santis, Alfredo De, Ferrara, Anna Lisa and Masucci, Barbara
(2007)
New constructions for provably-secure time-bound hierarchical key assignment schemes.
SACMAT.
.
Record type:
Conference or Workshop Item
(Paper)
This record has no associated files available for download.
More information
Published date: 2007
Venue - Dates:
SACMAT, 2007-01-01
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 272526
URI: http://eprints.soton.ac.uk/id/eprint/272526
PURE UUID: 009187a7-de71-4b43-91cf-c9d8bf1f2a7b
Catalogue record
Date deposited: 24 Jun 2011 17:50
Last modified: 08 Jan 2022 02:52
Export record
Contributors
Author:
Alfredo De Santis
Author:
Anna Lisa Ferrara
Author:
Barbara Masucci
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics