Optimal key tree structure for two-user replacement and deletion problems

@article{Wu2013OptimalKT,
  title={Optimal key tree structure for two-user replacement and deletion problems},
  author={Weiwei Wu and Minming Li and Enhong Chen},
  journal={Journal of Combinatorial Optimization},
  year={2013},
  volume={26},
  pages={44-70}
}
We study the optimal tree structure for the key management problem. In the key tree, when two or more leaves are deleted or replaced, the updating cost is defined to be the number of encryptions needed to securely update the remaining keys. The objective is to find the optimal tree structure where the worst case updating cost is minimum. We extend the result of 1-replacement problem in Snoeyink et al. (Proceedings of the twentieth annual IEEE conference on computer communications, pp. 422–431… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

A lower bound for multicast key distribution

  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL