M. Naor and A. Wool, "Access control and signature via quorum secret sharing," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 909--922, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of Section 4 was influenced by grid like constructions for benign failures (e.g. CAA90] and we borrow our definitions of domination and load from [GB85] and [NW94] respectively. Quorum systems have been previously employed in the implementation of security mechanisms. Naor and Wool [NW96] described methods to construct an access control service using quorums. Their constructions use cryptographic techniques to ensure that out of date (but correct) servers cannot grant access to unauthorized users. Agrawal and El Abbadi [AE90] and Mukkamala [Muk94] considered the confidentiality of ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proceedings of the 3rd ACM Conference on Computer and Communications Security, pages 157--168, March 1996.

....provides high degree of reliability in mobility management of ad hoc networks. The other advantages of quorum systems in mobility management include location and service provider independent numbering [10] 11] load balancing among location servers [10] 11] and provision of system security [13][14]. Many quorum system construction schemes have been proposed in applications of data replication and distributed computation [10] 12] 15] 19] However, in these constructions, the minimum size of the quorum intersection is by design equal to one, therefore applicability of these schemes to our ....

....distinct treatments, 4 Although it is possible to use partial quorums to store and retrieve location information, in this paper, we assume that a mobile host must access an entire quorum upon location updates and queries. This is justified because of security considerations. See references [13] [14], and [24] for security and availability considerations in quorum systems. ii) each treatment appears in r 0 blocks, iii) every pair of treatments appears together in 0 blocks. Lemma: There is a one to one correspondence between a UQS with the parameters (n; q; k; m; r) to a BIB design ....

M. Naor and A. Wool, "Access Control and Signatures via Quorum Secret Sharing," 3rd ACM Conf. on Comp. and Comm., pp. 157-168, March 1996.

.... any other quorum in C) 18, 23] The concept of a coterie has applications in diverse areas, such as mutual exclusion in distributed systems [13, 18, 23] data replication protocols [14] name servers [26] selective dissemination of information [37] and distributed access control and signatures [28]. For example, to achieve mutual exclusion in a distributed system, let the elements in U represent the sites in the distributed system. A task is allowed to enter a critical section only if it can get permissions from all the members of a quorum Q 2 C, where each site is allowed to issue at most ....

M. Naor and A. Wool, Access control and signatures via quorum secret sharing, IEEE Trans. Parallel and Distributed Syst., 9 (1998) 909-922.

....of Section 5.1 was influenced by grid like constructions for benign failures (e.g. CAA90] and we borrow our definitions of domination and load from [GB85] and [NW94] respectively. Quorum systems have been previously employed in the implementation of security mechanisms. Naor and Wool [NW96] described methods to construct an access control service using quorums. Their constructions use cryptographic techniques to ensure that out of date (but correct) servers cannot grant access to unauthorized users. Agrawal and El Abbadi [AE90] and Mukkamala [Muk94] considered the confidentiality of ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proceedings of the 3rd ACM Conference on Computer and Communications Security, pages 157--168, March 1996.

....17, 13, 9, 4, 35] In particular, our grid construction of Section 4 was influenced by grid like constructions for benign failures (e.g. 9] and we borrow our definition of load from [35] Quorum systems have been previously employed in the implementation of security mechanisms. Naor and Wool [36] described methods to construct an access control service using quorums. Their constructions use cryptographic techniques to ensure that out of date (but correct) servers cannot grant access to unauthorized users. Agrawal and El Abbadi [3] and Mukkamala [34] considered the confidentiality of ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proceedings of the 3rd ACM Conference on Computer and Communications Security, pages 157--168, March 1996.

....17, 13, 9, 4, 30] In particular, our grid construction of Section 4 was influenced by grid like constructions for benign failures (e.g. 9] and we borrow our definition of load from [30] Quorum systems have been previously employed in the implementation of security mechanisms. Naor and Wool [31] described methods to construct an access control service using quorums. Their constructions use cryptographic techniques to ensure that out of date (but correct) servers cannot grant access to unauthorized users. Agrawal and El Abbadi [3] and Mukkamala [29] considered the confidentiality of ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proceedings of the 3rd ACM Conference on Computer and Communications Security, pages 157--168, March 1996.

No context found.

Moni Naor and Avishai Wool. Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems, 9(9):909--922, 1998.

....i U and #i, j S i S j #. Each set S i is referred to as a quorum set or simply as a quorum. Quorum systems have been used in the study of distributed control and management problems such as mutual exclusion (c.f [4] 23] data replication protocols (c. f [4] and secure access control ([17]) In many applications of quorum systems the underlying universe is associated with a network of processors, and a quorum is employed by accessing each of its elements. For example, in a typical implementation of mutual exclusion using quorum systems, processors request access to the critical ....

Moni Naor and Avishai Wool. Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems, 9(9):909--922, 1998.

....focus here on schemes with single round commit phase and single round reveal phase. For more general (i.e. interactive) de nitions of commitment schemes see e.g. 26, 27] Although there are quite a few researchers that were concerned with problems of this nature during the last decade (e.g. [4, 5, 6, 14, 28]) 34 c i = C(p i ; r i ) r i is the (independent) string of random bits used in creating the commitment c i . B then sends c to A. 2. Given the commitments vector c, the adversary A selects a legal subset of the commitments: I = fi 1 ; i k g f1; 2; mg. A then sends I ....

M. Naor and A. Wool, Access control and signatures via quorum secret sharing, IEEE Trans. on Parallel and Distributed Systems 9 (

....The following solution solves the problem chooser server coalition, provided the size of the coalition is less than 2k n. 3 A quorum system is a collection of subsets of some ground set such that any two subsets intersect. They have been considered for cryptographic purposes previously, e.g. [22]. The sender de nes in advance n(n 1) strings f i;j g 1 i;j n;i6=j for every ordered pair of servers, and gives server S i the 2(n 1) strings f i;j ; j;i j i 6= jg. The chooser sends to server S i the set S of k servers which she is querying. The server rst veri es that S i 2 S and that it ....

M. Naor and A. Wool, Access Control and Signatures via Quorum Secret Sharing, IEEE Transactions on Parallel and Distributed Systems 9(9), 1998, pp. 909-922.

.... not addressed in this paper is when the adversary is given the random bits used to generate the ciphertext (in addition to the plaintext) The following problem, phrased here in terms of a CD ROM, is a concrete instance in which this kind of attack is relevant (the version presented here is due to [59], and is a variant of a problem posed by O. Goldreich) A CD ROM is generated containing the encryptions of 100 images (generally, n images) A user, having a copy of the CD ROM, chooses any subset, say of size 50, of the images, and purchases the decryption information for the selected images. ....

M. Naor and A. Wool, Access Control and Signatures via Quorum Secret Sharing Proc. Third ACM Conference on Computer and Communications Security, 1996, pp. 157-168. 53

.... in the study of distributed control and management problems such as data replication protocols (cf. DGS85, Her84, Ami95, Kei94] name servers (cf. MV88] mutual exclusion (cf. Ray86] selective dissemination of information (cf. YG94] and distributed access control and signatures (cf. NW96] A protocol template based on quorum systems works as follows. In order to perform some action (update the database, say) the user selects a quorum and accesses all of its elements. The intersection property then guarantees that the user will have a consistent view of the current state of the ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proc. 3rd ACM Conf. Comp. and Comm. Security, pages 157--168, New Delhi, India, 1996. Also available as Theory of Cryptography Library record 96-08, http: //theory.lcs.mit.edu/¸tcryptol/1996.html.

.... not addressed in this paper is when the adversary is given the random bits used to generate the ciphertext (in addition to the plaintext) The following problem, phrased here in terms of a CD ROM, is a concrete instance in which this kind of attack is relevant (the version presented here is due to [58], and is a variant of a problem posed by O. Goldreich) A CD ROM is generated containing the encryptions of 100 images (generally, n images) A user, having a copy of the CD ROM, chooses any subset, say of size 50, of the images, and purchases the decryption information for the selected images. ....

M. Naor and A. Wool, Access Control and Signatures via Quorum Secret Sharing Proc. Third ACM Conference on Computer and Communications Security, 1996, pp. 157--168.

.... systems have been used in the study of distributed control and management problems such as data replication protocols (cf. 11, 17, 3, 23] name servers (cf. 28] mutual exclusion (cf. 36] selective dissemination of information (cf. 39] and distributed access control and signatures (cf. [30]) A protocol template based on quorum systems works as follows. In order to perform some action (update the database, say) the user selects a quorum and accesses all its elements. The intersection property then guarantees that the user will have a consistent view of the current state of the ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proc. 3rd ACM Conf. Comp. and Comm. Security, pages 157--168, New Delhi, India, Mar. 1996.

....treatment of the problem is given in [4] Most of this work was for a trusted party which generates a key on the fly , i.e. where consistency of the key is not required. While this model may be more relevant to unicast it is less applicable when more than two parties are involved. Naor and Wool [39] considered a different scenario for protecting databases, and when adapted to our scenario their solution is one where the servers are trusted never to reveal their secret keys, but some of them might not have received updates regarding the permissions of users (which is a weaker assumption than ....

Naor M. and Wool A., "Access Control and Signatures via Quorum Secret Sharing ", 3rd ACM Conf. of Computer and Communication Security, 1996, 157--168.

....with different availability and load properties. All the schemes we present are extremely efficient, with blowup factors of at most 2 and linear time complexities both for the share generation and secret reconstruction operations. The proofs in this section are deferred to the full paper (see also [35]) 6.1 The Paths System 6.1.1 The System The Paths system [33] is based on paths in the following grid. Definition 6.1 Let G(d) be the planar grid with vertex set f(v1 ; v2) 0 v1 d 1; 0 v2 dg and edge set consisting of all edges joining neighboring vertices except those joining vertices ....

M. Naor and A. Wool. Access control and signatures via quorum secret sharing. Technical Report CS95-19, The Weizmann Institute of Science, Rehovot, Israel, 1995.

No context found.

M. Naor and A. Wool, "Access control and signature via quorum secret sharing," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 909--922, 1998.

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