Deterministic key pre-distribution schemes for mobile ad-hoc networks based on set systems with limited intersection sizes
暂无分享,去创建一个
[1] David A. Mix Barrington,et al. Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.
[2] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[3] David A. Mix Barrington,et al. Representing Boolean functions as polynomials modulo composite numbers , 1994, computational complexity.
[4] Peter Frankl. Constructing Finite Sets With Given Intersections , 1983 .
[5] W. Wallis,et al. Hadamard Matrices and Their Applications , 1978 .
[6] Douglas R. Stinson,et al. A combinatorial approach to key predistribution for distributed sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.
[7] Dawn Xiaodong Song,et al. Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..
[8] Virgil D. Gligor,et al. A key-management scheme for distributed sensor networks , 2002, CCS '02.
[9] Peter Frankl,et al. Set Systems with Restricted Intersections modulo Prime Powers , 2001, J. Comb. Theory, Ser. A.
[10] Samuel Kutin,et al. Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers , 2002, Combinatorics, Probability and Computing.
[11] Béla Bollobás,et al. Random Graphs , 1985 .