New constructions for provably-secure time-bound hierarchical key assignment schemes
New constructions for provably-secure time-bound hierarchical key assignment schemes
213-230
Santis, Alfredo De
817ed445-60f0-4f63-aafb-866b932010b8
Ferrara, Anna Lisa
adbca2ba-5d6e-4888-975c-69b8f8fa461e
Masucci, Barbara
ec9fd4b1-4c60-4385-9cd9-9400c0bd8df2
2008
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
(2008)
New constructions for provably-secure time-bound hierarchical key assignment schemes.
Theoretical Computer Science, 407 (1-3), .
This record has no associated files available for download.
More information
Published date: 2008
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 272524
URI: http://eprints.soton.ac.uk/id/eprint/272524
PURE UUID: 05882b7c-11f0-4f43-8d92-39f7c6a17b25
Catalogue record
Date deposited: 24 Jun 2011 17:47
Last modified: 09 Jan 2022 01:10
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