You have full text access to this Open Access content

Security and Communication Networks

Cover image for Vol. 6 Issue 9

September 2013

Volume 6, Issue 9

Pages i–iv, 1053–1175

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. You have full text access to this Open Access content
      Issue Information (pages i–iv)

      Version of Record online: 16 JUL 2013 | DOI: 10.1002/sec.661

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. You have full text access to this Open Access content
      Chaotic modulation-based spread spectrum communication using complex dynamics of chaotic DC–DC current mode controlled boost converter (pages 1053–1063)

      Manish Kumar Thukral and Karma Sonam Sherpa

      Version of Record online: 10 DEC 2012 | DOI: 10.1002/sec.665

      Thumbnail image of graphical abstract

      In the presented work, a methodology to use chaotic DC–DC converters in spread spectrum communication is proposed. With the use of discrete time modeling of DC–DC boost converter, an Adaline-based noncoherent receiver is designed. The spread spectrum communication model developed. The model is tested with various types of practical message signals and shown to be robust even in low channel noise.

    2. You have full text access to this Open Access content
      A new intrusion detection method based on SVM with minimum within-class scatter (pages 1064–1074)

      Wenjuan An and Mangui Liang

      Version of Record online: 18 DEC 2012 | DOI: 10.1002/sec.666

      Thumbnail image of graphical abstract

      In this paper, a new classification algorithm, which combines the minimum within-class scatter in Fisher discriminant analysis with traditional support vector machine, is to find an optimal separating hyperplane such that the margin is maximized, whereas the within-class scatter is kept as small as possible. Experimental results show that this new algorithm has better discriminatory power than support vector machine and kernel Fisher discriminant analysis, and it has higher true detection rate and lower false positive rate for intrusion detection systems.

    3. You have full text access to this Open Access content
      Tor traffic analysis using Hidden Markov Models (pages 1075–1086)

      Sami Zhioua

      Version of Record online: 12 OCT 2012 | DOI: 10.1002/sec.669

      Thumbnail image of graphical abstract

      Tor is the most popular tool providing anonymity online. The paper studies a common threat model where an attacker in the same LAN as the victim tries to defeat the anonymity of Tor. Using Hidden Markov Models, we show that a local attacker can identify the hops forming circuits initiated by the Tor client victim with an acceptable probability of 50 %.

    4. You have full text access to this Open Access content
      Incident prioritisation using analytic hierarchy process (AHP): Risk Index Model (RIM) (pages 1087–1116)

      Nor Badrul Anuar, Maria Papadaki, Steven Furnell and Nathan Clarke

      Version of Record online: 10 DEC 2012 | DOI: 10.1002/sec.673

      Thumbnail image of graphical abstract

      This paper proposes an incident prioritisation model, the Risk Index Model, which is based on risk assessment and the analytic hierarchy process. For incidents to be prioritised, the model uses indicators, such as criticality, maintainability, dependability, severity and similarity, as decision factors to calculate incidents' risk index. The model also adopts different strategies to enhance the prioritisation process.

    5. You have full text access to this Open Access content
      A reversible watermark scheme for 2D vector map based on reversible contrast mapping (pages 1117–1125)

      Peng Fei, Chen Li and Long Min

      Version of Record online: 10 DEC 2012 | DOI: 10.1002/sec.680

      Thumbnail image of graphical abstract

      A reversible watermark scheme for two-dimensional vector map based on reversible contrast mapping is proposed in this paper. The data of the two-dimensional vector maps are first preprocessed to reduce distortion. Then, the encrypted watermark is embedded into the relative coordinates by using the reversible contrast mapping. Experimental results and analysis show that it can achieve high payload, good reversibility, and invisibility. It has great potential in the application of map data authentication and secure communication.

    6. You have full text access to this Open Access content
      Peer cluster: a maximum flow-based trust mechanism in P2P file sharing networks (pages 1126–1142)

      Xinxin Fan, Mingchu Li, Hui Zhao, Xiaodong Chen, Zhenzhou Guo, Dong Jiao and Weifeng Sun

      Version of Record online: 15 FEB 2013 | DOI: 10.1002/sec.682

      Thumbnail image of graphical abstract

      The maximum flow based trust mechanism can make normal peers cluster together to isolate those different types of malicious peers (IMPs, CMPs, and DMPs). Request peers firstly select those peers that are in cluster as service providers; in this way, the malicious peers are constrained to carry out transaction even if they have high reputation values. Recall and precision, two widely used statistical classifications, are introduced by design to obtain rational amount of original peers in cluster.

    7. You have full text access to this Open Access content
      Free global ID against collusion attack on multi-authority attribute-based encryption (pages 1143–1152)

      Ang Gao and Zengzhi Li

      Version of Record online: 15 FEB 2013 | DOI: 10.1002/sec.683

      Thumbnail image of graphical abstract

      This paper constructs two systems of attribute-based encryption without presenting user's global ID. In our first system, a trusted central authority assists each attribute authority to independently run a security check for users' requests. In our second system, discrete Fourier transform and inverse discrete Fourier transform are used to share and recover secret key, respectively. Finally, proposed scheme not only improves user's privacy while defending against collusion attack but also is more efficient than existing schemes.

    8. You have full text access to this Open Access content
      Outlier detection in reputation management system for P2P networks using rough set theory (pages 1153–1160)

      Chithra Selvaraj and Sheila Anand

      Version of Record online: 14 FEB 2013 | DOI: 10.1002/sec.685

      Thumbnail image of graphical abstract

      Reputation trust management systems in peer-to-peer networks trust a peer on the basis of the recommendations about the peer received from all other peers in the form of scores. Malicious peers may give wrong reputation scores and also collude with other peers to make themselves or others appear trustworthy. In this paper, rough set theory, a mathematical tool, is used to detect and eliminate outlier scores in trust computation. The performance of the system has been tested, and the results have shown that the trust computation without outliers would be more accurate in evaluating the trustworthiness of a peer.

    9. You have full text access to this Open Access content
      Mobile user authentication system in cloud environment (pages 1161–1168)

      Her-Tyan Yeh, Bing-Chang Chen and Yi-Cong Wu

      Version of Record online: 29 NOV 2012 | DOI: 10.1002/sec.688

      Thumbnail image of graphical abstract

      Through the frame of this research, it can protect our cell phones from being lost and embezzled and can prevent the account and passwords from being attacked by Internet fishing. It can also solve the problem of users forgetting accounts and passwords, and reduce the operational burden of cell phones. Besides, it is capable of preventing the Cloud servers from incurring many malicious registrations and logins, keeping them working efficiently.

    10. You have full text access to this Open Access content
      A finite equivalence of multisecret sharing based on Lagrange interpolating polynomial (pages 1169–1175)

      Hui Zhao, Jonathan Z. Sun, Fengying Wang and Lei Zhao

      Version of Record online: 24 JAN 2013 | DOI: 10.1002/sec.694

      Thumbnail image of graphical abstract

      In this paper, we give an abstraction of multi-secret sharing based on Lagrange interpolating polynomial that is accessible to a fully mechanized analysis. We also present an encoding from the equational theory into a convergent rewriting system, which is suitable for the automated protocol verifier ProVerif. Finally, we verify a practical verifiable multi-secret sharing scheme based on YCH in ProVerif.

SEARCH

SEARCH BY CITATION