Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An effective privacy-preserving data coding in peer-to-peer network
KTH, School of Electrical Engineering and Computer Science (EECS), Software and Computer systems, SCS.
2018 (English)In: International Journal of Computer Networks & Communications, ISSN 0975-2293, E-ISSN 0974-9322, Vol. 10, no 3, p. 55-74Article in journal (Refereed) Published
Abstract [en]

Coding Opportunistically (COPE) is a simple but very effective data coding mechanism in the wireless network. However, COPE leaves risks for attackers easily getting the private information saved in the packets, when they move through the network to their destination nodes. Hence, a lightweight cryptographic approach, namely SCOPE, was proposed to consolidate COPE against the honest-but-curious and malicious attacks. Honest-but-curious attack serves adversaries who accurately obey the protocol but try to learn as much private information as possible for their curiosity. Additionally, this kind of attack is not destructive consequently. However, it may leave the backdoor for the more dangerous attacks carrying catastrophes to the system. Malicious attack tries to learn not only the private information but also modifies the packet on harmful purposes. To cope with this issue, in this work, a lightweight cryptographic approach improves COPE, namely SCOPE, that is defensive to the both attacks. The private information in the COPE packet are encrypted by Elliptic Curve Cryptography (ECC), and an additional information is inserted into SCOPE packets served for the authentication process using the lightweight hash Elliptic Curve Digital Signature Algorithm (ECDSA). We then prove our new protocol is still guaranteed to be a secure method of data coding, and to be light to effectively operate in the peer-to-peer wireless network.

Place, publisher, year, edition, pages
Academy and Industry Research Collaboration Center (AIRCC) , 2018. Vol. 10, no 3, p. 55-74
Keywords [en]
Elliptic Curve Cryptography (ECC), Elliptic Curve Digital Signature Algorithm (ECDSA), Homomorphic encryption, Honest-But-Curious Attack, Malicious attac, Network coding, Peer-to-Peer
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-247404DOI: 10.5121/IJCNC.2018.10305Scopus ID: 2-s2.0-85062328652OAI: oai:DiVA.org:kth-247404DiVA, id: diva2:1313307
Note

QC20190502

Available from: 2019-05-03 Created: 2019-05-03 Last updated: 2019-05-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Bahri, Leila

Search in DiVA

By author/editor
Bahri, Leila
By organisation
Software and Computer systems, SCS
In the same journal
International Journal of Computer Networks & Communications
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 3 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf