METHOD AND SYSTEM FOR SYMMETRIC SWARM AUTHENTICATION

摘要

This invention relates a symmetric swarm authentication system and method for a root node to authenticate with n nodes in a spanning tree network of n+1 nodes organized in y levels where the first level consists of the root node. The method comprising: a first phase comprising the root node to: determine a simplex^x code S = {e_i} with codewords of size a and Hamming weight h, where a and h are two positive integers; determine a first one-way function f and a second one-way function g; generate n random binary matrices of size ab, M_i, n keys k_i, one common key K, and a shortcut matrix M, where a and b are positive integers, i refers to the index of the node from 1 to n, and M =⊕ⁿ_i=1M_i; transmit K to all n nodes and (M_i, k_i) to respective node x_i; a second phase of authenticating the plurality of n nodes comprising the root node to: generate a challenge c, where c is a random number with binary length b; transmit the challenge c to the second level nodes; receive responses r_i from the second level nodes; aggregate the responses r_i from the second level nodes to obtain an aggregated response r; verify the aggregated response r with the following expression rⁱ = Mf(K, c)⊕r; and determine the aggregated response is acceptable if and only if the Hamming weight of rⁱ is equal to h.