Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

GENERALIZATION OF KEY DISTRIBUTION PATTERNS FOR EVERY n-PAIR OF USERS

  • Shin, Seon-Ho (Department of Mathematics, Soongsil University) ;
  • Bate, Julia C. (Department of Mathematics, Royal Holloway, University of London)
  • Published : 2008.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we discuss about a generalization of the Key Distribution Pattern which was proposed by C. Mitchell and F. Piper[6]. It is allowing secure communication between every n-pair of users($n\leq2$) in a large network for reducing storage requirements. We further suggest a generalization of K. Quinn's bounds in [9] for the number of subkeys in such general Key Distribution Patterns.

Keywords