
Previous Article
On the existence of extended perfect binary codes with trivial symmetry group
 AMC Home
 This Issue

Next Article
A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$
Bounds and constructions for key distribution schemes
1.  BT Chair of Information Security, Department of Computer Science, University College London, London, United Kingdom 
2.  Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands 
3.  Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 
We focus on two approaches. In the first approach, the goal is to minimize the number of keys per participant. An almost complete answer is presented. The second approach is to minimize the total number of keys that are needed in the network. The number of communication paths that are needed to guarantee secure communication becomes a relevant parameter. Our security relies on the random oracle model.
[1] 
Tuvi Etzion, Alexander Vardy. On $q$analogs of Steiner systems and covering designs. Advances in Mathematics of Communications, 2011, 5 (2) : 161176. doi: 10.3934/amc.2011.5.161 
[2] 
Serap Ergün, Sirma Zeynep Alparslan Gök, Tuncay Aydoǧan, Gerhard Wilhelm Weber. Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm. Journal of Industrial & Management Optimization, 2019, 15 (3) : 10851100. doi: 10.3934/jimo.2018086 
[3] 
Andrew J. Majda, Yuan Yuan. Fundamental limitations of Ad hoc linear and quadratic multilevel regression models for physical systems. Discrete & Continuous Dynamical Systems  B, 2012, 17 (4) : 13331363. doi: 10.3934/dcdsb.2012.17.1333 
[4] 
Mirela Domijan, Markus Kirkilionis. Graph theory and qualitative analysis of reaction networks. Networks & Heterogeneous Media, 2008, 3 (2) : 295322. doi: 10.3934/nhm.2008.3.295 
[5] 
M. D. König, Stefano Battiston, M. Napoletano, F. Schweitzer. On algebraic graph theory and the dynamics of innovation networks. Networks & Heterogeneous Media, 2008, 3 (2) : 201219. doi: 10.3934/nhm.2008.3.201 
[6] 
Kazuhiko Kuraya, Hiroyuki Masuyama, Shoji Kasahara. Load distribution performance of supernode based peertopeer communication networks: A nonstationary Markov chain approach. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 593610. doi: 10.3934/naco.2011.1.593 
[7] 
Ruiqiang Guo, Lu Song. Optical chaotic secure algorithm based on space laser communication. Discrete & Continuous Dynamical Systems  S, 2019, 12 (4&5) : 13551369. doi: 10.3934/dcdss.2019093 
[8] 
Mohammad Sadeq Dousti, Rasool Jalili. FORSAKES: A forwardsecure authenticated key exchange protocol based on symmetric keyevolving schemes. Advances in Mathematics of Communications, 2015, 9 (4) : 471514. doi: 10.3934/amc.2015.9.471 
[9] 
Hirotada Honda. On a model of target detection in molecular communication networks. Networks & Heterogeneous Media, 2019, 14 (4) : 633657. doi: 10.3934/nhm.2019025 
[10] 
Joseph D. Skufca, Erik M. Bollt. Communication and Synchronization in Disconnected Networks with Dynamic Topology: Moving Neighborhood Networks. Mathematical Biosciences & Engineering, 2004, 1 (2) : 347359. doi: 10.3934/mbe.2004.1.347 
[11] 
ILin Wang, JuChun Lin. A compaction scheme and generator for distribution networks. Journal of Industrial & Management Optimization, 2016, 12 (1) : 117140. doi: 10.3934/jimo.2016.12.117 
[12] 
Ginestra Bianconi, Riccardo Zecchina. Viable flux distribution in metabolic networks. Networks & Heterogeneous Media, 2008, 3 (2) : 361369. doi: 10.3934/nhm.2008.3.361 
[13] 
Guangzhou Chen, Yue Guo, Yong Zhang. Further results on the existence of supersimple pairwise balanced designs with block sizes 3 and 4. Advances in Mathematics of Communications, 2018, 12 (2) : 351362. doi: 10.3934/amc.2018022 
[14] 
Mario Roy, Mariusz Urbański. Random graph directed Markov systems. Discrete & Continuous Dynamical Systems  A, 2011, 30 (1) : 261298. doi: 10.3934/dcds.2011.30.261 
[15] 
Karthikeyan Rajagopal, Serdar Cicek, Akif Akgul, Sajad Jafari, Anitha Karthikeyan. Chaotic cuttlesh: king of camouage with selfexcited and hidden flows, its fractionalorder form and communication designs with fractional form. Discrete & Continuous Dynamical Systems  B, 2020, 25 (3) : 10011013. doi: 10.3934/dcdsb.2019205 
[16] 
Alessia Marigo. Optimal traffic distribution and priority coefficients for telecommunication networks. Networks & Heterogeneous Media, 2006, 1 (2) : 315336. doi: 10.3934/nhm.2006.1.315 
[17] 
Katayun Barmak, Eva Eggeling, Maria Emelianenko, Yekaterina Epshteyn, David Kinderlehrer, Richard Sharp, Shlomo Ta'asan. An entropy based theory of the grain boundary character distribution. Discrete & Continuous Dynamical Systems  A, 2011, 30 (2) : 427454. doi: 10.3934/dcds.2011.30.427 
[18] 
Barton E. Lee. Consensus and voting on large graphs: An application of graph limit theory. Discrete & Continuous Dynamical Systems  A, 2018, 38 (4) : 17191744. doi: 10.3934/dcds.2018071 
[19] 
ChunXiang Guo, Guo Qiang, Jin MaoZhu, Zhihan Lv. Dynamic systems based on preference graph and distance. Discrete & Continuous Dynamical Systems  S, 2015, 8 (6) : 11391154. doi: 10.3934/dcdss.2015.8.1139 
[20] 
Mario Roy, Mariusz Urbański. Multifractal analysis for conformal graph directed Markov systems. Discrete & Continuous Dynamical Systems  A, 2009, 25 (2) : 627650. doi: 10.3934/dcds.2009.25.627 
2019 Impact Factor: 0.734
Tools
Metrics
Other articles
by authors
[Back to Top]