Revocation and update of trust in autonomous delay tolerant networks
| Autor: | Ernest Foo, Seyit Camtepe, Peter Corke, Christopher Djamaludin |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Delay-tolerant networking
Spoofing attack General Computer Science Revocation Computer science business.industry media_common.quotation_subject 020206 networking & telecommunications 02 engineering and technology Computer security computer.software_genre Certificate Credential 020204 information systems 0202 electrical engineering electronic engineering information engineering Key (cryptography) Trust management (information system) business Key management Law computer Reputation media_common Computer network |
| Zdroj: | Computers & Security. 60:15-36 |
| ISSN: | 0167-4048 |
| Popis: | We model a decentralised security credential revocation and replacement scheme.We utilise leverage of common friends trust concepts for trust transferral on keys.We propose a revocation scheme to provide entity confidence and trust transferral.We compare similar schemes on key and certificate removal and replacement metrics.Proposal distributes credentials 35% faster, slowed spoofed credentials by 50%. A Delay Tolerant Network (DTN) is a dynamic, fragmented, and ephemeral network formed by a large number of highly mobile nodes. DTNs are ephemeral networks with highly mobile autonomous nodes. This requires distributed and self-organised approaches to trust management. Revocation and replacement of security credentials under adversarial influence by preserving the trust on the entity is still an open problem. Existing methods are mostly limited to detection and removal of malicious nodes. This paper makes use of the mobility property to provide a distributed, self-organising, and scalable revocation and replacement scheme. The proposed scheme effectively utilises the Leverage of Common Friends (LCF) trust system concepts to revoke compromised security credentials, replace them with new ones, whilst preserving the trust on them. The level of achieved entity confidence is thereby preserved. Security and performance of the proposed scheme is evaluated using an experimental data set in comparison with other schemes based around the LCF concept. Our extensive experimental results show that the proposed scheme distributes replacement credentials up to 35% faster and spreads spoofed credentials of strong collaborating adversaries up to 50% slower without causing any significant increase on the communication and storage overheads, when compared to other LCF based schemes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect