The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Information Processing Letters
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
Broadcast anti-jamming systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Explicit constructions of perfect hash families from algebraic curves over finite fields
Journal of Combinatorial Theory Series A
Designs, Graphs, Codes, and Their Links
Designs, Graphs, Codes, and Their Links
Verifying and Recasting Secret Ballots in Computer Networks
New Results and New Trends in Computer Science
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Anonymous Membership Broadcast Schemes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A set system (X, F) with X = {x1, . . . , xm) and F = {B1, . . . , Bn}, where Bi 驴 X, is called an (n, m) cover-free set system (or CF set system) if for any 1 驴 i, j, k 驴 n and j 驴 k, |Bi| = 2 |Bj 驴 Bk|+ 1. In this paper, we show that CF set systems can be used to construct anonymous membership broadcast schemes (or AMB schemes), allowing a center to broadcast a secret identity among a set of users in a such way that the users can verify whether or not the broadcast message contains their valid identity. Our goal is to construct (n, m) CF set systems in which for given m the value n is as large as possible. We give two constructions for CF set systems, the first one from error-correcting codes and the other from combinatorial designs. We link CF set systems to the concept of cover-free family studied by Erd枚s et al in early 80's to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application.