Sciweavers

12 search results - page 1 / 3
» Constructing Key Assignment Schemes from Chain Partitions
Sort
View
DBSEC
2010
137views Database» more  DBSEC 2010»
13 years 7 months ago
Constructing Key Assignment Schemes from Chain Partitions
Abstract. In considering a problem in access control for scalable multimedia formats, we have developed new methods for constructing a key assignment scheme. Our first contribution...
Jason Crampton, Rosli Daud, Keith M. Martin
TIT
2008
79views more  TIT 2008»
13 years 5 months ago
Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption
We develop a couple of new methods to reduce transmission overheads in broadcast encryption. The methods are based on the idea of assigning one key per each partition using one-way...
Jung Hee Cheon, Nam-Su Jho, Myung-Hwan Kim, Eun Su...
INFOCOM
1998
IEEE
13 years 9 months ago
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
Philip A. Whiting, Sem C. Borst
CN
2004
163views more  CN 2004»
13 years 5 months ago
Highly reliable trust establishment scheme in ad hoc networks
Securing ad hoc networks in a fully self-organized way is effective and light-weight, but fails to accomplish trust initialization in many trust deficient scenarios. To overcome t...
Kui Ren, Tieyan Li, Zhiguo Wan, Feng Bao, Robert H...
JOC
2006
69views more  JOC 2006»
13 years 5 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung