Symmetric concealed data aggregation techniques in wireless sensor networks using Privacy Homomorphism: A review

International Journal of Electronics and Telecommunications

“…Use of Bilinear Pairings in loss-free aggregation is proposed by [7][8][9][10]. Cryptographic aggregation using Symmetric Keys are described [11][12][13][14] to decrease the computational overhead associated with ECC. In a few schemes, Filter based techniques are used to prevent the adversarial attacks [15][16][17].…”

“…The CH already knows D(1) specified by (10). Then, it calculates w(1) using (12) in the time slot DATS (Data Aggregation Time Slot). Now w(1) is the augmented aggregate of C(1) where g(1) acts as the signature of the CH.…”

“…These values satisfy the constraints of ACRS. Now the augmented aggregate w( 1) is calculated at CH using (12) as, w(1) = 894326823584 Then, CH sends this w(1) to the BS. On receiving w(1), the BS calculates g(1)cal using the Equation ( 16) as, g(1)cal = mod{w(1), h(1)}= mod{894326823584, 103}= 102 Here, g(1)cal = g (1).…”

Erroneous message discovery with data acquisition and secret communication in cellular networks

“…We speculate that certain sensitivity knots were picked influentially as fact acquisition along with the knots among couple of continues fact generators are named promoting knots as they promote message. In order to expose erroneous message inoculated by fact acquisition during fact acquisition, as a result nearby knots of the fact acquisition(named observing knots) too operate fact acquisition and also operate MACs for the acquisition message to provide their team to check the message afterwards [2]. DAV equally gives message privacy as messages were promoted among fact acquisitions.…”

“…(1) First team is created by the present as well as promoted fact generators. (2). N teams were created by the observing knots of the present fact acquisition, Finally (3).…”