An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Key storage in secure networks
Discrete Applied Mathematics
Secret-key agreement without public-key
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Linear Key Predistribution Schemes
Designs, Codes and Cryptography
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
ACM Transactions on Information and System Security (TISSEC)
Tree-based key predistribution for wireless sensor networks
Wireless Networks
| Hi-index | 0.00 |
We revisit a key agreement scheme presented by Leighton and Micali [11], generalize the scheme, and present a new framework of tree-based key distribution pattern (TKDP). We presents a method of constructing TKDPs from cover-free families. We show the existence of TKDPs by probabilistic method. We can reduce the upper bounds on the minimum number of rows of ($t,w, \mathcal{T}$)-TKDPs, which are obtained from probabilistic methods, asymptotically by a factor of w as compared to Leighton and Micali's schemes by choosing optimal trees $\mathcal{T}$ instead of chains.