R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Dynamic Group Key Distribution Using MDS Codes - Xu (Correct)
....and decoding of a proper error control code have much (at least one order) lower computation complexity than encryption and decryption. Thus computation complexity of key distribution can be significantly reduced. The similar idea of using error control codes to achieve privacy was employed in [18, 14, 3]. The major di#erence between these schemes and ours is that our scheme allows dynamic group membership changes with very low storage complexity, while the other schemes only work for a predefined static group. The security strength of this scheme will be evaluated, as well as its communication, ....
R. Blom, "An Optimal Class of Symmetric Key Generation Systems ", Advances in Cryptology, EUROCRYPT'84, LNCS 209, 335338, 1984.
Entropy Measures and Unconditional Security in Cryptography - Cachin (1997) (13 citations) (Correct)
....open gap between lower and upper bounds for the size of a share in the general case. Key Distribution for Dynamic Conferences A key distribution scheme (KDS) for dynamic conferences is a method by which initially a dealer distributes private individual pieces of information to a set of users P [Blo85, BSH 93, Sti96] Later, any qualified conference of users, contained in the key structure A 2 , is able to compute a common key without further interaction, i.e. each user needs only his private piece of information and the identities of the other conference members. The key of each ....
Rolf Blom, An optimal class of symmetric key generation systems, Advances in Cryptology: Proceedings of EUROCRYPT 84 (Thomas Beth, Norbert Cot, and Ingemar Ingemarsson, eds.), Lecture Notes in Computer Science, vol. 209, Springer-Verlag, 1985, pp. 335--338.
A Cryptanalysis of the High-bandwidth Digital.. - Crosby, Goldberg, .. (Correct)
....and show that they are all insecure. In other words, we can prove, given just the interface, that every possible implementation that follows this interface is insecure. 2 Related Work Blom described a scheme very similar to HDCP as an alternative to the emerging publickey schemes of the time[7, 8]. He realized immediately the danger of colluding users, and tried to maximize the number of traitors required to compromise the scheme while minimizing the storage requirements placed on the system s users. We should note that since HDCP is closely related to Blom s protocol, it achieves the same ....
Rolf Blom. An optimal class of symmetric key generation systems. In T. Beth, N. Cot, and I. Ingemarsson, editors, Proc. EUROCRYPT 84, pages 335--338. Springer-Verlag, 1985.
Linear Broadcast Encryption Schemes - Padró, Gracia, Martín, Morillo (2001) (Correct)
....just one single broadcast can be securely made by such schemes. This is due to the fact that the broadcast message can provide to a user in a privileged subset some information about the secret information of the other users in this subset. Key predistribution schemes were introduced by Blom [4] and have been also considered in [5 7,10 12,14 17,19 24,26,27] The rst broadcast encryption schemes were proposed by Berkovits [3] and Fiat and Naor [11] Afterwards, several authors have studied these schemes [1,2,5,8,9,13,16,18,26,27] A good survey on these subjects can be found in [26] ....
R. Blom. An optimal class of symmetric key generation systems. Advances in Cryptology{EUROCRYPT '84, Lecture Notes in Computer Science 209 (1985) 335-338.
Improving the Trade-Off Between Storage and.. - Gracia.. (2001) (Correct)
....just one single broadcast can be securely made by such schemes. This is due to the fact that the broadcast message can provide to a user in a privileged subset some information about the secret information of the other users in this subset. Key predistribution schemes were introduced by Blom [3] and have been also considered in [4, 5, 8, 9, 11, 14, 15, 16] The rst broadcast encryption schemes were proposed by Berkovits [2] and Fiat and Naor [8] Afterwards, several authors have studied these schemes [1, 4, 6, 7, 9, 10, 12, 14, 15] A good survey on these subjects can be found in [14] ....
R. Blom. An optimal class of symmetric key generation systems. Advances in Cryptology{EUROCRYPT '84, Lecture Notes in Computer Science 209 (1985) 335-338.
On Key Storage In Secure Networks - Dyer, Fenner, Frieze (1995) (22 citations) (Correct)
....of systems of this type for secure communication in a large network. Supported by NATO grant RG0088 89 y Supported by NSF grant CCR 8900112 and NATO grant RG0088 89 1 1 Introduction The problem of secure communication in a network with multiple users has been considered by Blom [2, 3], Mitchell and Piper [8] Li Gong and Wheeler [7] and other authors. These papers consider a solution in which a key distribution centre (KDC) must, in principle, issue a unique cryptographic key to each of the pairs of users in a network whenever they choose to begin communication. Suppose N = ....
....implementation will involve the storage of about 1 2 n 2 keys. In modern computer networks, it is in fact very likely that n will be rather large, and current trends seem likely to increase the number of users attached to such networks. In [8] Mitchell and Piper, inspired by a proposal of Blom [2, 3], considered a scheme in which the KDC stores some global set K of keys (jKj = k) and issues to each user i (i = 1; 2; n) a subset S i K of these keys. We will assume these keys are numbered arbitrarily 1; 2; k. There is a directory, which need not be secure, which lists the ....
R. Blom, \An optimal class of symmetric key generation systems", in Advances in Cryptology: Proceedings of Eurocrypt 84, Lecture Notes in Computer Science 209, Springer-Verlag, Berlin, 1984, pp 335-338.
An Efficient Random Key Pre-distribution Scheme - Mahalingam Ramkumar Department (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984.
A DRM Based on Renewable Broadcast Encryption - Mahalingam Ramkumar And (2005) (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984.
Key Distribution Mechanisms for Wireless Sensor Networks: a.. - Camtepe, Yener (2005) (Correct)
No context found.
Blom, R. 1985. An optimal class of symmetric key generation systems. In Eurocrypt 84.
I-HARPS: An Efficient Key Pre-distribution Scheme - Ramkumar (2005) (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984.
Constructing Disjoint Paths for Secure Communication - Bagchi, Chaudhary, Goodrich.. (2003) (Correct)
No context found.
R. Blom. An optimal class of symmetric key generation systems. In Proc. of EUROCRYPT '84, pages 335--338, 1984.
Constructing Disjoint Paths for Secure Communication - Bagchi, Chaudhary, Goodrich.. (2003) (Correct)
No context found.
R. Blom. An optimal class of symmetric key generation systems. In Proc. of EUROCRYPT '84, pages 335--338, 1984.
Deterministic Key Predistribution Schemes - For Distributed Sensor (Correct)
No context found.
R. Blom. An Optimal Class of Symmetric Key Generation Systems, In Advances in Cryptology - Eurocrypt '84, pages 335-338, 1985. Lecture Notes in Computer Science Volume 209.
Distributed Symmetric Key Management - For Mobile Ad (2004) (Correct)
No context found.
R. Blom. "An Optimal Class of Symmetric Key Generation System", in Advances in Cryptology - Eurocrypt'84, LNCS vol. 209, p. 335338, 1985.
Combinatorial Design of Key Distribution Mechanisms for.. - Camtepe, Yener (2004) (Correct)
No context found.
R. Blom, "An optimal class of symmetric key generation systems," EUROCRYPT 84, 1985.
A System for Digital Rights Management Using - Key Predistribution Mahalingam (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984.
Proceedings of the 2004 IEEE - Workshop On Information (Correct)
No context found.
R. Blom, "An optimal class of symmetric key generation systems, " in Lecture Notes in Computer Science, (Berlin), pp. 335-- 338, Springer-Verlag, 1984.
Computation Efficient Multicast Key Distribution - Xu (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems", Advances in Cryptology, EUROCRYPT'84, LNCS 209, 335-338, 1984.
Security of Random Key Pre-distribution Schemes - With Limited Tamper (2004) (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984.
A τ-Restricted Key Agreement Scheme - Blundo, D'Arco, Gaggia (1999) (Correct)
No context found.
Blom, R. (1984) An optimal class of symmetric key generation systems. Lecture Notes in Computer Science, 209, 335--338.
A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks - Du, al. (2003) (30 citations) (Correct)
No context found.
R. Blom. An optimal class of symmetric key generation systems. Advances in Cryptology: Proceedings of EUROCRYPT 84 (Thomas Beth, Norbert Cot, and Ingemar Ingemarsson, eds.), Lecture Notes in Computer Science, Springer-Verlag, 209:335--338, 1985.
Computation Efficient Multicast Key Distribution - Xu (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems ", Advances in Cryptology, EUROCRYPT'84, LNCS 209, 335-338, 1984.
An Interleaved Hop-by-Hop Authentication Scheme for.. - Zhu, Setia, Jajodia.. (2004) (9 citations) (Correct)
No context found.
R. Blom. An Optimal Class of Symmetric Key Generation Systems. Advances in Cryptology, EUROCRYPT'84, LNCS 209, 335338, 1984.
Constructing Disjoint Paths for Secure Communication - Bagchi, Chaudhary, Goodrich.. (2003) (Correct)
No context found.
R. Blom. An optimal class of symmetric key generation systems. In Proc. of EUROCRYPT '84, pages 335--338, 1984.
Pre-Loaded Key Based Multicast and Broadcast - Authentication In Mobile (Correct)
No context found.
R. Blom, "An Optimal Class of Symmetric Key Generation Systems," Advances in Cryptology: Proc. of Eurocrypt 84, Lecture Notes in Computer Science, 209, Springer-Verlag, Berlin, pp. 335-338, 1984.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC