An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
An application of ramp schemes to broadcast encryption
Information Processing Letters
Communications of the ACM
Algebraic-Geometric Codes
Linear Key Predistribution Schemes
Designs, Codes and Cryptography
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Some Bounds and a Construction for Secure Broadcast Encryption
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Linear broadcast encryption schemes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Improving the trade-off between storage and communication in broadcast encryption schemes
Discrete Applied Mathematics
Establishing pairwise keys in distributed sensor networks
ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve
Designs, Codes and Cryptography
Secure Computation from Random Error Correcting Codes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Strongly multiplicative ramp schemes from high degree rational points on curves
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Communication in key distribution schemes
IEEE Transactions on Information Theory
Codes on Garcia-Stichtenoth curves with true distance greater than Feng-Rao distance
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Improvements on parameters of one-point AG codes from Hermitian curves
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Key predistribution schemes (KPSs) and one-time broadcast encryption schemes (OTBESs) are unconditionally secure protocols for key distribution in networks. The efficiency of these schemes has been measured in previous works in terms of their information rate, that is, the ratio between the length of the secret keys and the length of the secret information that must be stored by every user. Several constructions with optimal information rate have been proposed, but in them the secret keys are taken from a finite field with at least as many elements as the number of users in the network. This can be an important drawback in very large networks in which the nodes have limited computational resources as, for instance, wireless sensor networks. Actually, key predistribution schemes have been applied recently in the design of key distribution protocols for such networks. In this paper we present a method to construct key predistribution schemes from linear codes that provide new families of KPSs and OTBESs for an arbitrarily large number of users and with secret keys of constant size. As a consequence of the Gilbert-Varshamov bound, we can prove that our KPSs are asymptotically more efficient than previous constructions, specially if we consider KPSs that are secure against coalitions formed by a constant fraction of the users. We analyze as well the KPSs that are obtained from families of algebraic geometry linear codes that are above the Gilbert-Varshamov bound, as the ones constructed from the curves of Garcia and Stichtenoth. Finally, we discuss how the use of KPSs based on algebraic geometry codes can provide more efficient OTBESs.