Perfectly-Secure Key Distribution for Dynamic Conferences

  title={Perfectly-Secure Key Distribution for Dynamic Conferences},
  author={Carlo Blundo and Alfredo De Santis and Amir Herzberg and Shay Kutten and Ugo Vaccaro and Moti Yung},
In this paper we analyze perfectly secure key distribution schemes for dynamic conferences. In this setting, any member of a group of t users can compute a common key using only his private initial piece of information and the identities of the other t&1 users in the group. Keys are secure against coalitions of up to k users; that is, even if k users pool together their pieces they cannot compute anything about a key of any conference comprised of t other users. First we consider a… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
7 Extracted Citations
25 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 25 references

Interaction in key distribution schemes, in ``Advances in Cryptology CRYPTO 93'

  • A. Beimel, B. Chor
  • Lecture Notes in Computer Science,
  • 1994
Highly Influential
5 Excerpts

Broadcast encryption, in ``Advances in Cryptology CRYPTO 93'

  • A. Fiat, M. Naor
  • Lecture Notes in Computer Science,
  • 1994
2 Excerpts

Similar Papers

Loading similar papers…