## Coding Constructions for Blacklisting Problems Without Computational Assumptions (1999)

Citations: | 36 - 0 self |

### BibTeX

@MISC{Kumar99codingconstructions,

author = {Ravi Kumar and Sridhar Rajagopalan and Amit Sahai},

title = {Coding Constructions for Blacklisting Problems Without Computational Assumptions},

year = {1999}

}

### OpenURL

### Abstract

. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2 n users so that all but some specified coalition of k excluded users can understand the contents of the message. Using error-correcting codes, and avoiding any computational assumptions in our constructions, we construct natural schemes that completely avoid any dependence on n in the transmission overhead. Specifically, we construct: (i) (for illustrative purposes,) a randomized scheme where the server's storage is exponential (in n), but the transmission overhead is O(k), and each user's storage is O(kn); (ii) a scheme based on polynomials where the transmission overhead is O(kn) and each user's storage is O(kn); and (iii) a scheme using algebraic-geometric codes where the transmission overhead is O(k 2 ) and each user is required to store O(kn) keys. In the process of proving these results, we show how to construct very good cover-free set systems and co...

### Citations

713 |
A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations
- Chernoff
- 1952
(Show Context)
Citation Context ...system is not (k� 1=2)-cover free is at most exp(;t). Proof. Without loss of generality, let k 2. Fix sets S� S1�S2�:::�Sk 2S. For any x 2 Uj for some j, wehave Hence, E h S \ [ Si By Chernoff bounds =-=[7]-=-, Pr S \ [ Si > jSj h Pr x=2 [ i Si = 1 ; 1 2k i 2 = 1 ; 1 ; 1 2k exp 2 1 16 k k ! 2 � 9 16 : jSj jSj ! 7 16 jSj: =exp m 256k : By the union bound, the probabilitythat this occurs for any choice of S�... |

338 |
Algebraic Function Fields and Codes
- Stichtenoth
- 1993
(Show Context)
Citation Context ...tivates the use of algebraic-geometric codes (or AG codes), which are based on algebraic curves over finite fields [17]. We now give a definition of AG codes, also known as geometric Goppa codes (see =-=[21, 20]-=-). Let K=Fq be an algebraic function field of one variable with field of constants Fq and genus g. We denote the places of degree one of K by P(K). Suppose jP(K)j n +1.For <nand Q a place of degree on... |

250 | Broadcast encryption
- Fiat, Naor
- 1994
(Show Context)
Citation Context ... and only the designated recipients would be able to decrypt it. The two major works on blacklisting problems that have appeared in the literature have been the relatively early work of Fiat and Naor =-=[13]-=- and the more recent work of Wallner et. al. [27], which have each led to several derivative works. In the framework laid out above, both these works take a similar approach: They take a universe of a... |

250 | Iolus: A framework for scalable secure multicasting - Mittra |

245 | Key management for multicast: Issues and architectures
- Wallner, Harder, et al.
- 1998
(Show Context)
Citation Context ... to decrypt it. The two major works on blacklisting problems that have appeared in the literature have been the relatively early work of Fiat and Naor [13] and the more recent work of Wallner et. al. =-=[27]-=-, which have each led to several derivative works. In the framework laid out above, both these works take a similar approach: They take a universe of an exponential (in n) number of decryption devices... |

197 | Multicast security: a taxonomy and some efficient constructions
- Canetti, Garay, et al.
- 1999
(Show Context)
Citation Context ... advance. To deal with this structural problem of needing so many decryption keys, for the special case of private-key based broadcast, [13], and to some extent work following [27] by Canetti et. al. =-=[4]-=-, make clever use of pseudo-random generators to efficiently access many pseudo-random private keys using only a few random ones. To achieve constructions with feasible storage that do not require com... |

146 | Tracing traitors
- Chor, Fiat, et al.
- 1994
(Show Context)
Citation Context ...his watermarked media is repeatedly leaked by someone, the identity of the offender is obtained from the watermark and blacklisted. For details on watermarking and similarly motivated techniques, see =-=[8, 6, 11, 10]-=-. We also note that the set system we construct from algebraic-geometric codes can be used to improve some aspects of the unconditional Tracing Traitors construction in [6]. Organization. Section 2 di... |

134 | A secure, robust watermark for multimedia
- Cox, Kilian, et al.
- 1996
(Show Context)
Citation Context ...his watermarked media is repeatedly leaked by someone, the identity of the offender is obtained from the watermark and blacklisted. For details on watermarking and similarly motivated techniques, see =-=[8, 6, 11, 10]-=-. We also note that the set system we construct from algebraic-geometric codes can be used to improve some aspects of the unconditional Tracing Traitors construction in [6]. Organization. Section 2 di... |

129 | Families of finite sets in which no set is covered by the union oftwo others
- Erdös, Frankl, et al.
- 1982
(Show Context)
Citation Context ...e implements our noisy channel by building an interesting family of sets, which we call a (k� )-cover-free family. This is a natural generalization of a family introduced by Erdös, Frankl, and Furedi =-=[12]-=-: A (k� )-cover-free family S = fS1�S2�:::�SNg is one where the union of any k sets covers less than an fraction of the elements in any other. A suitably chosen random construction can be used to desi... |

91 |
and Henning Stichtenoth. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlădut bound
- Garcia
- 1995
(Show Context)
Citation Context ...rem, Property 2. The AG code C( Q� P1�:::�Pn) is an [n� k� d]q-linear code for d n; and k ; g +1. Reed-Solomon codes are straightforward to construct. There are a few AG codes in existence today (see =-=[26, 18, 16]-=-). We choose for sake of clarity (as did [20]) to focus on the family of codes given by the explicit and fairly simply Garcia-Stichtenoth function fields [16]. More details are given in Section 6.s2.3... |

81 | A Review of Watermarking and the Importance of Perceptual Modeling”, SPIE Conf. on Human Vision and Electronic Imaging II, 3016(1997), pp.92-99. 14 In general, the physical design context presents a rich environment for constraintbased watermarking. For e - Cox, Miller |

72 |
How to Broadcast a Secret
- Berkovits
- 1991
(Show Context)
Citation Context ...hat all users receive its messages. Thus one can consider the problem of transmitting a message only to some small specified subset of the users, and indeed this has been considered in the literature =-=[1]-=-. For the case of a broadcast channel shared by numerous users, we argue that an equally, if not more, interesting problem is the complement of the above problem: how to transmit a message over a broa... |

67 | Efficient communication-storage tradeoffs for multicast encryp-tion
- Canetti, Malkin, et al.
- 1999
(Show Context)
Citation Context ...netti et. al. [4] show how to use pseudo-random generators to reduce by a constant factor the transmission overhead, but still require an exponential number of total keys. Canetti, Malkin, and Nissim =-=[5]-=- explore further trade-offs possible between the transmission overhead, user keys, and server keys possible by varying the scheme of [27]. Their constructions do not achieve feasible server storage, a... |

52 |
Codes on algebraic curves
- Goppa
- 1981
(Show Context)
Citation Context ...pplications, Reed-Solomon codes are quite restrictive since they require n q. This motivates the use of algebraic-geometric codes (or AG codes), which are based on algebraic curves over finite fields =-=[17]-=-. We now give a definition of AG codes, also known as geometric Goppa codes (see [21, 20]). Let K=Fq be an algebraic function field of one variable with field of constants Fq and genus g. We denote th... |

30 |
Bounded distance +1 soft-decision Reed-Solomon decoding
- Berlekamp
- 1996
(Show Context)
Citation Context ... discussed, robustness can be achieved. If the channel also corrupts data, one can use a code with both erasure and error-correcting capabilities. This is possible for example with Reed-Solomon codes =-=[2]-=-. We omit the details of how these parameters should be chosen to achieve different levels of robustness in this extended abstract. 4 A randomized construction We now describe a randomized constructio... |

25 | Trung, “Some new results on key distribution patterns and broadcast encryption
- Stinson, van
- 1998
(Show Context)
Citation Context ...er compared to the size of the message and the transmission overhead, but they require the message size be O(N =2 n ). Without such restrictions but still in the one-time model, Stinson and van Trung =-=[22]-=- give a scheme with transmission overhead approximately worse than [13] but with user key size better than the unconditional [13]. Stinson and Wei [23] improve this further, yielding a scheme which st... |

25 |
Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Zink
- 1982
(Show Context)
Citation Context ...rem, Property 2. The AG code C( Q� P1�:::�Pn) is an [n� k� d]q-linear code for d n; and k ; g +1. Reed-Solomon codes are straightforward to construct. There are a few AG codes in existence today (see =-=[26, 18, 16]-=-). We choose for sake of clarity (as did [20]) to focus on the family of codes given by the explicit and fairly simply Garcia-Stichtenoth function fields [16]. More details are given in Section 6.s2.3... |

23 | Key Preassigned Traceability Schemes for Broadcast Encryption - Stinson, Wei - 1999 |

21 | Constructions of near-optimal extractors using pseudo-random generators - Trevisan - 1999 |

19 |
Linear codes and modular curves
- Vladuts, Manin
- 1985
(Show Context)
Citation Context ...rem, Property 2. The AG code C( Q� P1�:::�Pn) is an [n� k� d]q-linear code for d n; and k ; g +1. Reed-Solomon codes are straightforward to construct. There are a few AG codes in existence today (see =-=[26, 18, 16]-=-). We choose for sake of clarity (as did [20]) to focus on the family of codes given by the explicit and fairly simply Garcia-Stichtenoth function fields [16]. More details are given in Section 6.s2.3... |

13 | Decoding algebraic-geometric codes beyond the errorcorrection bound
- SHOKROLLAHI, WASSERMAN
- 1998
(Show Context)
Citation Context ...tivates the use of algebraic-geometric codes (or AG codes), which are based on algebraic curves over finite fields [17]. We now give a definition of AG codes, also known as geometric Goppa codes (see =-=[21, 20]-=-). Let K=Fq be an algebraic function field of one variable with field of constants Fq and genus g. We denote the places of degree one of K by P(K). Suppose jP(K)j n +1.For <nand Q a place of degree on... |

9 | Generalized Beimel–Chor schemes for broadcast encryption and interactive key distribution
- Blundo, Mattos, et al.
- 1998
(Show Context)
Citation Context ...e notion of an unconditionally secure one-time broadcast encryption scheme, where the broadcasting can only be done once and all security guarantees must be unconditional. Blundo, Mattos, and Stinson =-=[3]-=-sare able to essentially give lower bounds and upper bounds of O(1) for both the key size per user compared to the size of the message and the transmission overhead, but they require the message size ... |

7 | An application of ramp schemes to broadcast encryption
- Stinson, Wei
- 1999
(Show Context)
Citation Context ...ill in the one-time model, Stinson and van Trung [22] give a scheme with transmission overhead approximately worse than [13] but with user key size better than the unconditional [13]. Stinson and Wei =-=[23]-=- improve this further, yielding a scheme which still requires an exponential number of keys, but transmission overhead roughly O(k 2 n). These papers on the one-time variant of blacklisting use some s... |

2 |
Digitalsignets: Self-enforcing protection of digital information
- Dwork, Lotspiech, et al.
- 1996
(Show Context)
Citation Context ...his watermarked media is repeatedly leaked by someone, the identity of the offender is obtained from the watermark and blacklisted. For details on watermarking and similarly motivated techniques, see =-=[8, 6, 11, 10]-=-. We also note that the set system we construct from algebraic-geometric codes can be used to improve some aspects of the unconditional Tracing Traitors construction in [6]. Organization. Section 2 di... |

1 |
Copyright? Protection? The Mathematics of Coding, Extraction
- Dwork
- 1996
(Show Context)
Citation Context |

1 | 1394 Specifications. Available from customer.service@ieee.org - IEEE |