Amos Beimel, Benny Chor  Home/Search
Context Related
| harvard.edu/~beimel/Papers/kds.ps.gz cs.bgu.ac.il/~beimel/Papers...kds.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: harvard.edu/~beimel/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A (g; b) key distribution scheme allows conferences of g users to generate secret keys, such that disjoint coalitions of b users cannot gain any information on the generated key (in the information theoretic sense). In this work, we study the relationships between communication and space efficiency of key distribution schemes. We prove that communication does not help in the context of unrestricted schemes. On the other hand, we show that for restricted schemes, which are secure only when used... (Update)
Context of citations to this paper: More
.... by Burmester and Desmedt [6] Unconditionally secure schemes for conference key agreement have been studied by Beimel and Chor [1, 2] (see also Blundo and Cresti [5] We will call such a scheme an Interactive Key Distribution Scheme (IKDS) An IKDS typically consists...
...We now define unrestricted, non communicating key distribution schemes. Other variations of key distribution schemes can be found in [10] [11]. These key distribution schemes are used in the constructions of our secret sharing schemes. Definition 3: Let b be a positive...
Cited by: More
A τ-Restricted Key Agreement Scheme - Blundo, D'Arco, Gaggia (1999) (Correct)
Linear Broadcast Encryption Schemes - Padró, Gracia, Martín, Morillo (2001) (Correct)
Improving the Trade-Off Between Storage and.. - Gracia.. (2001) (Correct)
Active bibliography (related documents): More All
0.3: On Some Methods for Unconditionally Secure Key Distribution and.. - Stinson (1996) (Correct)
0.3: Secure Frameproof Codes, Key Distribution.. - D. R. Stinson.. (1997) (Correct)
0.3: Perfectly-Secure Key Distribution for Dynamic Conferences - Blundo, De Santis.. (1995) (Correct)
Similar documents based on text: More All
0.2: On Privacy and Partition Arguments - Chor, Ishai (Correct)
0.1: Secret Sharing with Public Reconstruction - Beimel, Chor (1998) (Correct)
0.1: Universally Ideal Secret Sharing Schemes - Beimel, Chor (1994) (Correct)
Related documents from co-citation: More All
8: Space Requirements for Broadcast Encryption (context) - Blundo, Cresti - 1995
8: An Optimal Class of Symmetric Key Generation Systems (context) - Blom - 1985
5: On some methods for unconditionally secure key distribution and broadcast encryp.. - Stinson - 1997
BibTeX entry: (Update)
A. Beimel and B. Chor. Communication in Key Distribution Schemes. IEEE Transactions on Information Theory 42 (1996), 19--28. http://citeseer.ist.psu.edu/beimel96communication.html More
@article{ beimel96communication,
author = "Amos Beimel and Benny Chor",
title = "Communication in Key Distribution Schemes",
journal = "{IEEE} Transactions on Information Theory",
volume = "41",
number = "1",
pages = "19--28",
year = "1996",
url = "citeseer.ist.psu.edu/beimel96communication.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
428 IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
112 Broadcast encryption - Fiat, Naor - 1994
68 Secret key agreement by public discussion from common inform.. - Maurer - 1993
52 Perfectlysecure key distribution for dynamic conferences - Blundo, De Santis et al. - 1993
46 An optimal class of symmetric key generation systems (context) - Blom - 1985
27 the key predistribution systems: a practical solution to the.. (context) - Matsumoto, Imai - 1988
23 A matrix key-distribution scheme - Gong, Wheeler - 1990
15 Discrete Applied Mathematics (context) - Mitchell, Piper et al. - 1988
11 Key distribution system based on identification information (context) - Okamoto, Tanaka - 1989
10 Multiparty secret key exchange using a random deal of cards - Fischer, Wright - 1992
6 Coding Theorems for Discrete Memoryless Systems (context) - Csiszar, Korner - 1986
5 Some constructions for key distribution patterns (context) - Quinn - 1994
1 Information Theory and Reliable Communications (context) - Gallanger - 1968
1 Secure bit exchange using a random deal of cards (context) - Fischer, Paterson et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.deas.harvard.edu/~beimel/pub.html): More
One-way Functions are Essential for Single-Server.. - Beimel, Ishai.. (1999) (Correct)
The Query Complexity of Finding Local Minima in the Lattice - Beimel, Geller, al. (Correct)
On Arithmetic Branching Programs - Beimel, Gál (1998) (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