Skip to main content
Log in

Anonymous Membership Broadcast Schemes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A membership broadcast scheme is a method by which a dealer broadcasts a secret identity among a set of users, in such a way that only a single user is sure that he is the intended recipient. Anonymous membership broadcast schemes have several applications, such as anonymous delegation, cheating prevention, etc. In a w-anonymous membership broadcast scheme any coalition of at most w users, which does not include the user chosen by the dealer, has no information about the identity of the chosen user. Wang and Pieprzyk proposed a combinatorial approach to 1-anonymous membership broadcast schemes. In particular, they proposed a 1-anonymous membership broadcast scheme offering a logarithmic complexity for both communication and storage. However, their result is non-constructive. In this paper, we consider w-anonymous membership broadcast schemes. First, we propose a formal model to describe such schemes and show lower bounds on the communication and randomness complexities of the schemes. Afterwards, we show that w-anonymous membership broadcast schemes can be constructed starting from (w + 1)-wise independent families of permutations. The communication and storage complexities of our schemes are logarithmic in the number of users.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Abadi, Private authentication, In Proceedings of the 2002 Workshop on Privacy Enhancing Technologies, Lecture Notes in Computer Science, Vol. 2482 (2003) pp. 27–40.

    Google Scholar 

  2. J. Camenisch and M. Stadler, Efficient group signatures for large groups, In Proceedings of Advances in Cryptology: Crypto '97, Lecture Notes in Computer Science, Vol. 1294 (1997) pp. 410–424.

    Google Scholar 

  3. P. J. Cameron, Finite permutation groups and finite simple groups, Bull. London Math. Soc., Vol. 13 (1981) pp. 1–22.

    Google Scholar 

  4. D. Chaum, A. Fiat and M. Naor, Untraceable electronic cash. In Proceedings of Advances in Cryptology: Crypto '88, Lecture Notes in Computer Science, Vol. 403 (1990) pp. 319–327.

    Google Scholar 

  5. S. Cimato, P. D'Arco and I. Visconti, Anonymous group communication for mobile networks. In Proceedings of the Italian Conference on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 2841 (2003) pp. 316–328.

    Google Scholar 

  6. A. De Santis and B. Masucci, On secret set schemes, Information Processing Letters, Vol. 74, No. 5–6 June (2000) pp. 243–251.

    Google Scholar 

  7. J. D. Dixon and B. Mortimer, Permutation Groups, Springer, Berlin (1996).

    Google Scholar 

  8. P. Erdös, P. Frankl and Z. Furedi, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics, Vol. 51 (1985) pp. 79–89.

    Google Scholar 

  9. A. Fiat and M. Naor, Broadcast encryption. In Proceedings of Advances in Cryptology: Crypto '93, Lecture Notes in Computer Science, Vol. 773 (1993) pp. 480–490.

    Google Scholar 

  10. C. Jordan, Recherches sur les substitutions, J. de Math. Pure et Appl., Vol. 17 (1872) pp. 345–361.

    Google Scholar 

  11. M. Luby and C. Rackoff, How to construct pseudorandom permutations and pseudorandom functions, SIAM J. Comput., Vol. 17 (1988) pp. 373–386.

    Google Scholar 

  12. R. Molva and G. Tsudik, Secret sets and applications, Information Processing Letters, Vol. 65 (1998) pp. 47–55.

    Google Scholar 

  13. M. Naor and O. Reingold, On the construction of pseudo-random permutations: Luby-rackoff revisited, Journal of Cryptology, Vol. 12 (1999) pp. 29–66.

    Google Scholar 

  14. M. G. Reed, P. F. Syverson and D. M. Goldschlag, Protocols using anonymous connections: Mobile applications. In Proceedings of Security Protocols: 5th International Workshop, Lecture Notes in Computer Science, Vol. 1361 (1997) pp. 13–23.

    Google Scholar 

  15. M. Reiter and A. Rubin, Crowds: Anonymity for web transactions, ACM Transactions on Information and System Security, Vol. 1 (1998) pp. 66–92.

    Google Scholar 

  16. D. J. S. Robinson, A Course in the Theory of Groups, Springer-Verlag, New York, second edition (1996).

    Google Scholar 

  17. A. Salomaa, Verifying and recasting secret ballots in computer networks. In Proceedings of New Results and New Trends in Computer Science, Lecture Notes in Computer Science, Vol. 555 (1991) pp. 283–289.

    Google Scholar 

  18. H. Wang and J. Pieprzyk, A combinatorial approach to anonymous membership broadcast. In Proceedings of COCOON 2002, Lecture Notes in Computer Science, Vol. 2387 (2002) pp. 162–170.

    Google Scholar 

  19. H. J. Zassenhaus, The Theory of Groups, second edition, Chelsea Ed., New York (1949).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Santis, A., Masucci, B. Anonymous Membership Broadcast Schemes. Designs, Codes and Cryptography 32, 135–151 (2004). https://doi.org/10.1023/B:DESI.0000029218.71926.b0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DESI.0000029218.71926.b0

Navigation