Moni Naor, Avishai Wool  Home/Search
Context Related
Links: ACM DBLP | wisdom.weizmann.ac.il/~naor...qss.ps.gz iacr.org/1996/008.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cryptosoft.com/html/secpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty intersection. Quorum systems have been used for a number of applications in the area of distributed systems. We propose a separation between access servers which are protected and trustworthy, but may be outdated, and the data servers which may all be compromised. The main paradigm is that only the servers in a complete... (Update)
Context of citations to this paper: More
...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)...
.... [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...
Cited by: More
Using Byzantine Quorum Systems to Manage Confidential Data - Subbiah, Ahamad, Blough (2004) (Correct)
Scalable and Dynamic Quorum Systems - Naor, Wieder (2003) (Correct)
Magic Functions - Dwork, Naor, Reingold, Stockmeyer (1999) (Correct)
Similar documents (at the sentence level):
78.6%: Access Control and Signatures via Quorum Secret Sharing - Naor, Wool (1995) (Correct)
Active bibliography (related documents): More All
1.0: Access Control and Signatures via Quorum Secret Sharing.. - Naor, Wool (1995) (Correct)
0.4: Optimal Byzantine Quorum Systems - Malkhi, Reiter, Wool (1997) (Correct)
0.4: The Load and Availability of Byzantine Quorum Systems - Malkhi, Reiter, Wool (1997) (Correct)
Similar documents based on text: More All
0.6: The Load, Capacity and Availability of Quorum Systems - Naor, Wool (1998) (Correct)
0.6: The Load, Capacity and Availability of Quorum Systems (Extended .. - Naor, Wool (1994) (Correct)
0.5: Probabilistic Byzantine Quorum Systems - Malkhi, Reiter, Wool, Wright (1998) (Correct)
Related documents from co-citation: More All
9: algorithm for mutual exclusion in decentralized systems (context) - Maekawa - 1985
8: The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data - Cheung, Ammar et al. - 1990
8: An Efficient and FaultTolerant Solution for Distributed Mutual Exclusion (context) - Agrawal, Abbadi - 1991
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/article/naor98access.html More
@article{ naor98access,
author = "M. Naor and A. Wool",
title = "Access Control and Signatures via Quorum Secret Sharing",
journal = "IEEE Transactions on Parallel and Distributed Systems",
volume = "9",
number = "9",
pages = "909--??",
year = "1998",
url = "citeseer.ist.psu.edu/article/naor98access.html" }
Citations (may not include all citations):645 How to share a secret (context) - Shamir - 1979 ACM DBLP
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988 ACM DBLP
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986 ACM DBLP
189 A majority consensus approach to concurrency control for mul.. (context) - Thomas - 1979 ACM DBLP
174 Safeguarding cryptographic keys (context) - Blakley - 1979
141 Consistency in partitioned networks (context) - Davidson, Garcia-Molina et al. - 1985 DBLP
126 algorithm for mutual exclusion in decentralized systems (context) - Maekawa - 1985
111 How to assign votes in a distributed system (context) - Garcia-Molina, Barbara - 1985 ACM DBLP
102 Dynamic voting algorithms for maintaining the consistency of.. (context) - Jajodia, Mutchler - 1990 ACM DBLP
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996 ACM
93 Generalized secret sharing and monotone functions (context) - Benaloh, Leichter - 1988 ACM DBLP
92 The grid protocol: A high performance scheme for maintaining.. - Cheung, Ammar et al. - 1992 DBLP
91 Secret sharing schemes realizing general access structure (context) - Ito, Saito et al. - 1987
75 Shared generation of authenticators and signatures (context) - Desmedt, Frankel - 1991
73 Algorithms for Mutual Exclusion (context) - Raynal - 1986 ACM
72 How to share a function securely (context) - De Santis, Desmedt et al. - 1994 ACM DBLP
72 Hierarchical quorum consensus: A new algorithm for managing .. (context) - Kumar - 1991 DBLP
69 On span programs (context) - Karchmer, Wigderson - 1993 DBLP
57 Electronic Colloquium on Computational Complexity (context) - Goldreich, cryptography et al. - 1995
51 An efficient and fault-tolerant solution for distributed mut.. (context) - Agrawal, El-Abbadi - 1991 ACM DBLP
50 Distributed match-making (context) - Mullender, Vit'anyi - 1988 DBLP
49 the classification of ideal secret sharing schemes (context) - Brickell, Davenport - 1990
48 How to make replicated data secure - Herlihy, Tygar - 1988 ACM DBLP
47 Fail-stop protocols: An approach to designing secure protoco.. - Gong, Syverson - 1995
44 Short monotone formulae for the majority function (context) - Valiant - 1984 DBLP
43 Increasing availability and security of an authentication se.. - Gong - 1993 DBLP
39 How to securely replicate services (context) - Reiter, Birman - 1994 ACM DBLP
36 An introduction to shared secret and/or shared control schem.. (context) - Simmons - 1992
35 An overview of clock synchronization (context) - Simons, Welch et al. - 1990 ACM DBLP
33 the information rate of secret sharing schemes - Blundo, De Santis et al. - 1992
30 Secret sharing made short (context) - Krawczyk - 1994 ACM DBLP
29 Coverings and colorings of hypergraphs (context) - Lov'asz - 1973
28 Information and Computation (context) - Peleg, Wool et al. - 1995 DBLP
26 Two remarks concerning the Goldwasser-Micali-Rivest signatur.. - Goldreich - 1987 ACM DBLP
26 An efficient existentially unforgeable signature scheme and .. - Dwork, Naor - 1994 ACM DBLP
24 What good are models and what models are good (context) - Schneider - 1993
21 Replication Methods for Abstract Data Types - Herlihy - 1984 ACM
21 Crumbling walls: A class of practical and efficient quorum s.. (context) - Peleg, Wool - 1997 DBLP
17 capacity and availability of quorum systems (context) - Naor, Wool - 1998
16 A theory of coteries: Mutual exclusion in distributed system.. (context) - Ibaraki, Kameda - 1993 DBLP
15 A simple method for generating and sharing pseudo-random fun.. (context) - Micali, Sidney - 1995
15 Distributed selective dissemination of information - Yan, Garcia-Molina - 1994 ACM DBLP
12 Universally ideal secret sharing schemes - Beimel, Chor - 1992
11 Enhancing Concurrency and Availability for Database Systems (context) - Fu - 1990 ACM
9 Quorum-based secure multi-party computation (context) - Beaver, Wool - 1998 DBLP
4 The availability of crumbling wall quorum systems (context) - Peleg, Wool - 1997 ACM DBLP
4 Kerberos: An authentication service for open networks (context) - Steiner, Neuman et al. - 1988
1 Charact'erisation des 'el'ements ipsoduaux du treillis distr.. (context) - Monjardet - 1972
1 The fundamental theorem of voting schemes (context) - Loeb - 1996 ACM
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (Correct)
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