Security and Communication Networks

Cover image for Vol. 7 Issue 7

July 2014

Volume 7, Issue 7

Pages i–iii, 1067–1188

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. You have free access to this content
      Issue Information (pages i–iii)

      Version of Record online: 17 JUN 2014 | DOI: 10.1002/sec.889

  2. Research Articles

    1. Top of page
    2. Issue Information
    3. Research Articles
    1. Score level fusion approach in dynamic signature verification based on hybrid wavelet-Fourier transform (pages 1067–1078)

      Wee How Khoh, Thian Song Ong, Ying Han Pang and Andrew Beng Jin Teoh

      Version of Record online: 2 JUL 2013 | DOI: 10.1002/sec.829

      Thumbnail image of graphical abstract

      In this work, a dynamic handwritten signature verification system based on hybrid discrete wavelet transform and discrete Fourier transform is presented. The k-nearest neighbor and support vector machine are applied to fuse multiple features at score level for evaluation purpose. Experiments are conducted on a released version of benchmark SVC2004 database, and the verification results show the proposed method is feasible in practice.

    2. Yet another attack on the chinese remainder theorem-based hierarchical access control scheme (pages 1079–1095)

      Niu Liu, Shaohua Tang and Lingling Xu

      Version of Record online: 5 JUL 2013 | DOI: 10.1002/sec.837

      Thumbnail image of graphical abstract

      In this paper, we describe our attack on the modified version of CRTHACS. We extend the description of the CRTHACS in a more proper form to make it easier for us to look into the problem. We generalize our attack in an algebraic form and apply it to a series of hierarchical cryptographic access control schemes that share the same vulnerability with CRTHACS. We also give the countermeasure to fix this vulnerability.

    3. Avoidance of misbehaving nodes in wireless mesh networks (pages 1096–1114)

      Tal Grinshpoun, Amnon Meisels and Eyal Felstaine

      Version of Record online: 22 JUL 2013 | DOI: 10.1002/sec.841

      Thumbnail image of graphical abstract

      Avoidance of misbehaving nodes (AVOMIN) is a wireless routing algorithm that bypasses nodes suspicious of changing, discarding, or misrouting data packets. When such misbehavior is encountered, AVOMIN starts a process in which a “virtual” cost penalty is iteratively added to suspicious nodes, and a new shortest route is derived until the disrupted path is replaced with one that avoids the misbehaving nodes. The algorithm enables proactive calculation of several alternative routes, which can be used to perform multipath routing.

    4. Parallelizable MAC revisited (pages 1115–1127)

      Wun-She Yap, Sze Ling Yeo, Swee-Huay Heng and Matt Henricksen

      Version of Record online: 10 JUL 2013 | DOI: 10.1002/sec.842

      Thumbnail image of graphical abstract

      Message authentication codes (MACs) are widely used in communication networks for authentication purposes. In EUROCRYPT 2002, Black and Rogaway proposed a parallelizable MAC (PMAC), which is relatively efficient when a parallel environment is possible. This parallelism is achieved via constant multiplications in the underlying finite field. In order to yield a better solution, Rogaway refined PMAC in ASIACRYPT 2004 by using a powering-up construction to generate the constants. This is in contrast to the first design that uses successive words of the gray code to generate the constants. In this paper, we analyze how some unique characteristics of these constants result in weaknesses of the respective PMAC designs against forgery attacks in different ways. Thus, our analysis highlights some pitfalls that designers should be mindful of when designing schemes which exploit such constants

    5. New rational parties relying on reputation (pages 1128–1137)

      Yilei Wang, Zhe Liu and Qiuliang Xu

      Version of Record online: 28 NOV 2013 | DOI: 10.1002/sec.844

      Thumbnail image of graphical abstract

      In this paper, we redefine the utilities considering other parts such as reputation in order to give rational parties incentives to participate in the protocol and finally obtain the correct outputs. The most distinct contribution of this paper is the proposal of rational covert adversaries whose behaviors are combinations of rational parties and covert adversaries. Finally, we prove that, given proper parameters, all parties have incentives to participate in the rational secure computation protocol.

      Corrected by:

      Corrigendum: Corrigendum to “New Rational Parties Relying on Reputation”

      Vol. 9, Issue 7, 697, Version of Record online: 22 MAR 2016

    6. Timed-release oblivious transfer (pages 1138–1149)

      Lingling Xu, Fangguo Zhang and Shaohua Tang

      Version of Record online: 28 AUG 2013 | DOI: 10.1002/sec.845

      Thumbnail image of graphical abstract

      We present a generic construction for timed-release oblivious transfer protocol that permits a sender to restrict when each receiver may open his chosen messages, without learning anything about the receiver's message choices. To achieve this functionality, we import a time server into the protocol that broadcasts a time token periodically and needs neither to interact with the sender nor the receiver. We also present a concrete scheme for the protocol's generic construction.

    7. Filtering location optimization for the reactive packet filtering (pages 1150–1164)

      Ning Lu, Yulong Wang, Sen Su, Fangchun Yang and Rui Han

      Version of Record online: 19 JUL 2013 | DOI: 10.1002/sec.848

      Thumbnail image of graphical abstract

      We formulate the filtering location problem to an integer linear programming problem. We propose an efficient K-means-based heuristic filtering location algorithm. Our work can be viewed as a building block and immediately integrated into the existing defense architecture.

    8. For your phone only: custom protocols for efficient secure function evaluation on mobile devices (pages 1165–1176)

      Henry Carter, Chaitrali Amrutkar, Italo Dacosta and Patrick Traynor

      Version of Record online: 23 JUL 2013 | DOI: 10.1002/sec.851

      Thumbnail image of graphical abstract

      In this work, we develop Efficient Mobile Oblivious Computation, a set of secure function evaluation protocols customized for the mobile platform. Using partially homomorphic cryptosystems, we develop protocols to meet the needs of two popular application types: location-based and social networking. Using these applications as comparison benchmarks, we demonstrate execution time improvements of 99% and network overhead improvements of 96% over the most optimized garbled circuit techniques.

    9. Privacy and integrity preserving skyline queries in tiered sensor networks (pages 1177–1188)

      Jinguo Li, Yaping Lin, Gang Wang, Rui Li and Bo Yin

      Version of Record online: 25 JUL 2013 | DOI: 10.1002/sec.852

      Thumbnail image of graphical abstract

      In this paper, we propose a protocol called SSQ for privacy and integrity preserving skyline queries in two-tiered sensor networks. For privacy preserving, a size-limited bucketing technique is proposed to mix the data in a range, and a prefix membership verification technique based on bloom filters is developed to perform skyline queries on encrypted data items. For integrity preserving, a Merkle hash tree-based technique is investigated to prevent compromised storage nodes from tampering and dropping data.