2006 IEEE International Conference on Communications 2006
DOI: 10.1109/icc.2006.255111
|View full text |Cite
|
Sign up to set email alerts
|

Public Key Based Cryptoschemes for Data Concealment in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
93
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 130 publications
(97 citation statements)
references
References 10 publications
0
93
0
Order By: Relevance
“…These schemes enhance secrecy resilience of WSNs against individual sensor attacks, since compromising a single or a set of sensor nodes won't reveal the decryption key that only the BS knows. An attracting feature of [10] is the introduction of data integrity in end-to-end encrypted WSNs through Merkle hash trees of Message Authentication Codes (MACs). However, both schemes raise power consumption concerns, since computation requirements for public key encryption is still considered high for WSNs [12].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…These schemes enhance secrecy resilience of WSNs against individual sensor attacks, since compromising a single or a set of sensor nodes won't reveal the decryption key that only the BS knows. An attracting feature of [10] is the introduction of data integrity in end-to-end encrypted WSNs through Merkle hash trees of Message Authentication Codes (MACs). However, both schemes raise power consumption concerns, since computation requirements for public key encryption is still considered high for WSNs [12].…”
Section: Related Workmentioning
confidence: 99%
“…In end-to-end encryption schemes [1], [4], [10], [15], intermediate aggregators apply some aggregation functions on encrypted data which they can't decrypt. This is because these intermediate aggregators don't have access to the keys that are only shared between data originators (usually leaf sensor nodes) and the BS.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on the above analysis, we found that, to achieve a security level (complexity) of (4,8,12), (5,9,15), (6,11,14) and (7,12,15) correspondingly. Figure 3 shows the level of security to be achieved with required size of the keys in our approach and in D-H scheme.…”
mentioning
confidence: 99%
“…This mapping function should be deterministic such that the same plaintext always maps to the same EC point and has the following property [90]:…”
Section: Another Possible Choice Is the Elliptic Curve El-gamal (Ec-ementioning
confidence: 99%