Coding Constructions for Blacklisting Problems without Computational Assumptions
Authors:
- 16 December 1999
- book chapter
- Published by Springer Nature
- p. 609-623
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- How To Broadcast A Secret2001
- Efficient Communication-Storage Tradeoffs for Multicast Encryption1999
- Generalized Beimel-Chor schemes for broadcast encryption and interactive key distributionTheoretical Computer Science, 1998
- Iolus1997
- Bounded distance+1 soft-decision Reed-Solomon decodingIEEE Transactions on Information Theory, 1996
- A secure, robust watermark for multimedia1996
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut boundInventiones Mathematicae, 1995
- Tracing Traitors1994
- Families of finite sets in which no set is covered by the union ofr othersIsrael Journal of Mathematics, 1985
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952