New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2008.05.021
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Provably Secure Cryptographic Constructions

2012English

Provably Secure Identity-Based Identification and Signature Schemes From Code Assumptions

PLoS ONE
Multidisciplinary
2017English

Provably Secure Public Key Cryptosystem Based on Chebyshev Polynomials

Journal of Communications
Electronic EngineeringElectrical
2015English

Secure Conference Key Distribution Schemes for Conspiracy Attack

English

Practical and Provably Secure Distance-Bounding

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

A Novel and Provably Secure Authentication and Key Agreement Scheme With User Anonymity for Global Mobility Networks

Security and Communication Networks
Computer NetworksInformation SystemsCommunications
2016English

Provably Secure Steganography With Imperfect Sampling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Decomposition Constructions for Secret-Sharing Schemes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1994English

Provably Secure Obfuscation of Diverse Watermarks for Sequential Circuits

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy