Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Ehdaie, Mohammad
    et al.
    Alexiou, Nikolaos
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Attari, Mahmoud Ahmadian
    Aref, Mohammad Reza
    Papadimitratos, Panos
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Key splitting: making random key distribution schemes resistant against node capture2015In: Security and Communication Networks, ISSN 1939-0114, E-ISSN 1939-0122, Vol. 8, no 3, p. 431-445Article in journal (Refereed)
    Abstract [en]

    A large number of random key pre-distribution (RKD) schemes have been proposed in the literature to secure wireless sensor network applications, relying on symmetric key cryptography. However, sensor nodes are exposed to physical compromise by adversaries, who target the symmetric keys stored at each node. With the stolen keys in their possession, the adversaries are then able to compromise communication links between benign nodes. Here, the big challenge arises: how to increase resilience of RKD schemes for wireless sensor networks to node capture, while maintaining the flexibility and low-cost features of RKD? We propose the idea of key splitting to address this problem, without the need of any special-purpose hardware. Our key splitting scheme neither increases per-node storage nor introduces additional computation and communication overheads. Nevertheless, it can achieve better connectivity. More importantly, it significantly increases resilience to node compromise, when the adversary does not have overwhelming computational power.

  • 2. Skorin-Kapov, Nina
    et al.
    Jirattigalachote, Amonrat
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    An integer linear programming formulation for power equalization placement to limit jamming attack propagation in transparent optical networks2014In: Security and Communication Networks, ISSN 1939-0114, E-ISSN 1939-0122, Vol. 7, no 12, p. 2463-2468Article in journal (Refereed)
    Abstract [en]

    Transparent optical networks can be highly vulnerable to various physical-layer attacks, such as high-power jamming, which can cause widespread service disruption and even service denial. The propagation of such attacks can be thwarted with wavelength-selective attenuators, referred to as power equalizers, installed at the network nodes. However, employing all nodes with power equalization functionality can lead to substantial costs. In previous work, we proposed a heuristic approach for sparse power equalization placement to limit jamming attack propagation cost-effectively. The approach provides suboptimal solutions quickly; however, it does not guarantee optimality. Because placement of such power equalization is a long-term planning problem affecting the capital expenditures of the network operator, solution quality is more critical than execution time. Thus, in this paper, we propose an integer linear programming formulation for the problem to guarantee optimality in terms of the number of power equalizers placed. Evaluation results show that our proposed integer linear programming formulation is able to solve moderately sized problems in reasonable time. These results also support the efficiency of our previously proposed heuristic by confirming its ability to find optimal solutions for the cases tested.

1 - 2 of 2
CiteExportLink to result list
Permanent 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