TY - GEN
T1 - Matrix based key agreement algorithms for sensor networks
AU - Parakh, Abhishek
AU - Kak, Subhash
PY - 2011
Y1 - 2011
N2 - Communication between nodes in a sensor network is often secured by the use of symmetric keys installed on them before deployment. A more efficient method is to install sensors with a small amount of secret information that can be used to generate a pairwise common key when required. We propose new key agreement algorithms based on matrix factorization that requires a maximum of m multiplications to generate a key, where M ≤ N is a system parameter and N is the total number of nodes in the network.
AB - Communication between nodes in a sensor network is often secured by the use of symmetric keys installed on them before deployment. A more efficient method is to install sensors with a small amount of secret information that can be used to generate a pairwise common key when required. We propose new key agreement algorithms based on matrix factorization that requires a maximum of m multiplications to generate a key, where M ≤ N is a system parameter and N is the total number of nodes in the network.
UR - http://www.scopus.com/inward/record.url?scp=84858957250&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84858957250&partnerID=8YFLogxK
U2 - 10.1109/ANTS.2011.6163684
DO - 10.1109/ANTS.2011.6163684
M3 - Conference contribution
AN - SCOPUS:84858957250
SN - 9781467300933
T3 - International Symposium on Advanced Networks and Telecommunication Systems, ANTS
BT - ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems
T2 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems, ANTS 2011
Y2 - 18 December 2011 through 21 December 2011
ER -