Jian Ren

Michigan State University, East Lansing, Michigan, United States

Are you Jian Ren?

Claim your profile

Publications (59)26.35 Total impact

  • Jian Ren, Lein Harn
    [Show abstract] [Hide abstract]
    ABSTRACT: Anonymous authentication enables any user to be authenticated without being identified. (t,n)-threshold ring signatures, introduced by Bresson et. al., are ring signature schemes that allow a group of t members to jointly sign a message anonymously in a ring of n members. Threshold ring signature schemes provide a nice tradeoff between anonymity and creditability since it allows multiple ring members to sign a message jointly. The complexity in both signature generation and signature verification of the threshold ring signature scheme proposed by Bresson et. al. is mathcal{O}(n^2). They also proposed an efficient threshold ring signature scheme based on an (n,t)-complete fair partition, with complexity mathcal{O}(n log n). In this paper, a new efficient (t,n)-threshold ring signature scheme is proposed. This scheme is constructed through a system of t linear equations and n variables, where t is generally a fixed number that is much smaller than n. The proposed threshold ring signature scheme can provide unconditional signer ambiguity, threshold unforgeability and provable security in the random oracle model. The complexity of signature generation and signature verification of the proposed threshold ring signature scheme are mathcal{O}(t log^2_2t) and mathcal{O}(n), respectively. Furthermore, the length of the threshold ring signature is the same as the regular ring signature introduced by Rivest et. al., which is 2n+2, while the length of the threshold ring signature scheme proposed by Bresson et. al. is 3n-t+3.
    IEEE Transactions on Wireless Communications 01/2013; 12(3):1018-1025. · 2.42 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers architecture design of mobile access coordinated wireless sensor networks (MC-WSN) for reliable and efficient information exchange. In sensor networks with mobile access points (SENMA), the mobile access points collect information directly from individual sensors as they traverse the network, such that no routing is needed in data transmission. While being energy efficient, a major limitation with SENMA is the large delay in data collection, making it undesirable for timesensitive applications. In the proposed MC-WSN architecture, the sensor network is coordinated by powerful mobile access points (MA), such that the number of hops from each sensor to the MA is minimized and limited to a prespecified number through active network deployment and network topology design. Unlike in SENMA, where the data collection delay depends on the physical speed of the MA, in MC-WSN, the delay depends on the number of hops and the electromagnetic wave speed, and is independent of the physical speed of the MA. This innovative architecture is energy efficient, resilient, fast reacting and can actively prolong the lifetime of sensor networks. Our simulations show that the proposed MC-WSN can achieve higher energy-efficiency and orders of magnitude lower delay over SENMA, especially for large-scale networks.
    Communications (ICC), 2013 IEEE International Conference on; 01/2013
  • T. Jiang, Tongtong Li, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless networks are challenged in efficiency and security. This article is devoted to the fundamental study of cognitive communications in wireless networks after analyzing the limitations in today??s cognitive radios. The research scope includes architecture design, resource management, anti-interference/interception system design through multi-layer diversity, routing anonymity, and security analysis.
    IEEE Wireless Communications 01/2012; 19(4):82-88. · 3.74 Impact Factor
  • Source
    Yun Li, Jian Li, Jian Ren, Jie Wu
    [Show abstract] [Hide abstract]
    ABSTRACT: Message authentication is one of the most effective ways to thwart unauthorized and corrupted traffic from being forwarded in wireless sensor networks (WSNs). To provide this service, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial: when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. In this paper, we propose a scalable authentication scheme based on elliptic curve cryptography (ECC). While enabling intermediate node authentication, our proposed scheme allows any node to transmit an unlimited number of messages without suffering the threshold problem. In addition, our scheme can also provide message source privacy. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based approach in terms of communication and computational overhead under comparable security levels while providing message source privacy.
    Proceedings - IEEE INFOCOM 01/2012;
  • Source
    Lei Zhang, Jian Ren, Tongtong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: In this correspondence, we provide a general jamming model, through which all the existing models can be summarized and extended to the time-varying case under one unified framework. We analyze the time varying jamming power spectral density, and propose a new jamming classification scheme by introducing the concepts of time-varying jamming coherence time and time-frequency jamming coherence bandwidth. Specific methods on power spectrum estimation are provided for time-varying jamming that is stationary or locally stationary.
    IEEE Transactions on Signal Processing 01/2012; 60(7):3902-3907. · 2.81 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: While linear network coding can improve the throughput significantly in network environment with little additional computational overhead, it is fragile to communication errors and node compromising attacks. To combat the errors in network coding, both error-detection and error-correction based schemes have been proposed. In this paper, we provide a novel methodology to characterize linear network coding through error-control coding. Our main idea is to represent each linear network coding with an error-control coding. We provide comprehensive theoretical analysis on the relationships between linear network coding and error-control coding in both unicast and multicast scenarios. We find that these two codes are essentially identical in algebraic aspects. Our research provides a new approach to understand network coding schemes and also a novel methodology to develop network coding schemes that can combat communication errors and also node compromising attacks.
    Global Communications Conference (GLOBECOM), 2012 IEEE; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Along with the advent of reconfigurable radios, hostile jamming is no longer limited to military applications, but has become a serious threat for civilian wireless communications, where OFDM has been identified as one of the most efficient transmission technologies. In this paper, we consider reliable transmission of OFDM systems under multi-tone jamming. We propose to enhance the jamming resistance of OFDM through symbol level precoding. Our approach is to find the optimal precoder and decoder that can minimize the MSE between the transmitted and the estimated symbols, subject to a given transmit power constraint. Closed-form solutions are derived, and further demonstrated through simulation examples. It is observed that adding controlled redundancy at symbol level is an effective way to mitigate hostile jamming in OFDM systems.
    Global Communications Conference (GLOBECOM), 2012 IEEE; 01/2012
  • Di Tang, Tongtong Li, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: SEAR is a novel secure and energy aware routing protocol proposed to address the energy balance and routing security through a balanced energy consumption and probabilistic random walking. Recently, a quantitative security measurement scheme for source-location privacy based on source-location disclosure index (SDI) and source-location space index (SSI) has been proposed. In this paper, we first derive a numerical formula to quantitatively estimate the routing efficiency through the number of routing hops for a given routing security level. We then consider the reverse problem: For a given routing cost factor, how to determine the maximum security level for a message to be transmitted. Our simulation results demonstrate that the theoretical results provide a very tight estimation of the actual routing hops for various security parameters. Finally, we prove that the SEAR scheme can provide provable security under the quantitative security measurement criteria.
    Communications (ICC), 2012 IEEE International Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Secure and efficient communication between human being and managed devices is critical for Smart Grid and Smart Home. This article considers the architecture and design of a secure access gateway (SAG) for home area networks. The SAG serves as the interface between the remote users and the managed devices, such that real-time secure monitoring and control of the devices can be achieved through a Smart Phone. We try to address the security and capacity challenges using multilayer techniques. Security enhancement is ensured through network layer protocol development, as well as inherently secure physical layer transceiver design. Capacity improvement is achieved using dynamic resource management. Remote monitoring and control of home/office devices through a Smart Phone is coming closer to us more than ever before.
    IEEE Wireless Communications 01/2012; 19(3):66-73. · 3.74 Impact Factor
  • Source
    L. Lightfoot, Yun Li, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: In wireless sensor networks (WSNs), providing source-location privacy through secure routing is one of the most prosperous techniques. In this paper, we propose a routing technique to provide adequate source-location privacy with low energy consumption. We introduce this technique as the Sink Toroidal Region (STaR) routing. With this technique, the source node randomly selects an intermediate node within a designed STaR area located around the SINK node. The STaR area is large enough to make it unpractical for an adversary to monitor the entire region. Furthermore, this routing protocol ensures that the intermediate node is neither too close, nor too far from the SINK node in relations to the entire network. While ensuring source location privacy, our simulation results show that the proposed scheme is very efficient and can be used for practical applications.
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers channel and power allocation for cognitive radio (CR) networks. We assume that the total available spectrum is divided into several bands, each consisting of a group of channels. A centralized base station, enabled by spectrum sensing, is assumed to have the knowledge of all vacant channels, which will be assigned to various CRs according to their requests. The objective of resource allocation is to maximize the sum data rate of all CRs. Since the activities of primary users may cause heavy traffic in some bands while leaving other bands idle, load balancing is first performed to equalize the traffic. A multi-level subset sum algorithm as well as a simpler greedy algorithm is proposed to achieve excellent load balancing performance. After that, an algorithm incorporated with constant-power water filling is proposed to maximize the sum data rate. Simulation results are presented to illustrate the effectiveness of the proposed algorithms.
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers cooperative sensing in cognitive net- works under Spectrum Sensing Data Falsification attack (SSDF) in which malicious users can intentionally send false sensing information. One effective method to deal with the SSDF attack is the q-out-of-m scheme, where the sensing decision is based on q sensing reports out of m polled nodes. The major limitation with the q-out-of-m scheme is its high computational complexity due to exhaustive search. In this paper, we prove that for a fixed percentage of malicious users, the detection accuracy increases almost exponentially as the network size increases. Motivated by this observation, as well as the linear relationship between the scheme parameters and the network size, we propose a simple but accurate approach that significantly reduces the complexity of the q- out-of-m scheme. The proposed approach can easily be applied to the large scale networks, which can be much more reliable under malicious attacks. Index Terms—cognitive radio, cooperative sensing, malicious attack, data fusion.
    Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 22-27, 2011, Prague Congress Center, Prague, Czech Republic; 01/2011
  • Source
    Wenbo Qiao, Jian Li, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: Network coding is being viewed to have the potential for significant throughput improvement in network environment. However, these expected benefits are very fragile to malicious attacks, including message block content corruption and node compromise attacks. To solve these problems, both pollution detection and pollution correction based schemes have been proposed. These schemes are only effective in some limited scenarios. In this paper, we propose a new scheme that combines the benefits of the existing error-detection and error-correction (EDEC) schemes. The proposed scheme is similar in structure to the existing error-control based schemes. However, by appropriately modifying the rate of the underlying error-control scheme, we can improve the network throughput and robustness significantly. Our scheme can detect the malicious attacks by computing whether the syndromes are all zeros. By collecting all the non-zero syndromes, the malicious attacks within the error-decoding capacity of the underlying linear network coding can be removed and the original message can be recovered. Our theoretical analysis and simulation results demonstrate that the proposed EDEC scheme can improve the overall network performance dramatically with only a very moderate increase of the computational overhead.
    Proceedings of the Global Communications Conference, GLOBECOM 2011, 5-9 December 2011, Houston, Texas, USA; 01/2011
  • Source
    Lein Harn, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: Public-key digital certificate has been widely used in public-key infrastructure (PKI) to provide user public key authentication. However, the public-key digital certificate itself cannot be used as a security factor to authenticate user. In this paper, we propose the concept of generalized digital certificate (GDC) that can be used to provide user authentication and key agreement. A GDC contains user's public information, such as the information of user's digital driver's license, the information of a digital birth certificate, etc., and a digital signature of the public information signed by a trusted certificate authority (CA). However, the GDC does not contain any user's public key. Since the user does not have any private and public key pair, key management in using GDC is much simpler than using public-key digital certificate. The digital signature of the GDC is used as a secret token of each user that will never be revealed to any verifier. Instead, the owner proves to the verifier that he has the knowledge of the signature by responding to the verifier's challenge. Based on this concept, we propose both discrete logarithm (DL)-based and integer factoring (IF)-based protocols that can achieve user authentication and secret key establishment.
    IEEE Transactions on Wireless Communications 01/2011; 10:2372-2379. · 2.42 Impact Factor
  • Jian Ren, Di Tang
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) have been widely used in various applications for continuous event monitoring and detection. The WSNs communication is generally event-driven. While confidentiality of the message content can be ensured through content encryption, it is much more difficult to adequately protect the source-location information of the event. For WSNs, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSNs. On the other hand, exposure of the source-location can jeopardize the successful deployment of WSNs. In this paper, we propose a scheme to provide both source-location privacy and routing efficiency through routing to an intermediate node selected from a hierarchical connected dominating set (CDS) of the network. The CDS represents the backbone of the network and the nodes in the CDS are located in different regions of the network. As a result, choosing nodes from the CDS can ensure the intermediate node to be away from the actual message source node. The selection of the intermediate node can effectively prevent the adversary from performing routing trace back attack to identify the message source node. In addition, this design guarantees a high message delivery ratio and a high message delivery efficiency.
    Proceedings of the Global Communications Conference, GLOBECOM 2011, 5-9 December 2011, Houston, Texas, USA; 01/2011
  • Yun Li, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) have the potential to be widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized interception and detection. Privacy is becoming one of the major issues that jeopardize the successful deployment of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSNs, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms and large scale broadcasting-based protocols are not suitable for WSNs. In this paper, we propose source-location privacy schemes through routing to randomly selected intermediate node(s) before the message is transmitted to the SINK node. We first describe routing through a single a single randomly selected intermediate node away from the source node. Our analysis shows that this scheme can provide great local source-location privacy. We also present routing through multiple randomly selected intermediate nodes based on angle and quadrant to further improve the global source location privacy. While providing source-location privacy for WSNs, our simulation results also demonstrate that the proposed schemes are very efficient in energy consumption, and have very low transmission latency and high message delivery ratio. Our protocols can be used for many practical applications.
    INFOCOM, 2010 Proceedings IEEE; 04/2010
  • Source
    Jian Ren, Jie Wu
    [Show abstract] [Hide abstract]
    ABSTRACT: Anonymous communications aim to preserve communications privacy within the shared public network environment. It can provide security well beyond content privacy and integrity. The scientific studies of anonymous communications are largely originated from Chaum’s two seminal approaches: mixnet and DC-net. In this paper, we present an overview of the research in this field. We start with the basic definitions of anonymous communications. We then describe the cryptographic primitives, the network protocols, and some of the representative anonymous communication systems. We also describe verifiable mixnets and their applications to electronic voting. Finally, we briefly cite some other anonymous systems.
    Computer Communications. 01/2010;
  • Source
    Di Tang, Tingting Jiang, Jian Ren
    [Show abstract] [Hide abstract]
    ABSTRACT: Lifetime optimization and security are two important design issues for multi-hop wireless sensor networks with non-replenishable energy resources. In this research, we propose a novel secure and energy aware (SEAR) routing protocol to address these two issues concurrently through balanced energy consumption and probabilistic random walking. SEAR is designed with two configurable parameters, energy balance control (EBC) and security level. EBC is used to enforce energy balance and increase the lifetime. Security level is designed to determine the probabilistic distribution of the random walking that provides routing security. The security level can be defined by the message source on a message level, or on a system level. Theoretical analysis and OPNET simulation results show that the proposed SEAR can provide excellent balance between routing efficiency and energy consumption while preventing routing traceback attacks.
    Proceedings of the Global Communications Conference, 2010. GLOBECOM 2010, 6-10 December 2010, Miami, Florida, USA; 01/2010
  • Source
    Jian Ren, Yun Li, Tongtong Li
    EURASIP J. Wireless Comm. and Networking. 01/2010; 2010.
  • Lei Zhang, Jian Ren, Tongtong Li
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers spectrally efficient anti-jamming system design based on message-driven frequency hopping (MDFH). Unlike conventional FH where the hopping frequencies are determined by a preselected pseudonoise (PN) sequence, in MDFH, part of the message acts as the PN sequence for carrier frequency selection. It is observed that MDFH has high spectral efficiency and is particularly robust under strong jamming. However, disguised jamming from sources of similar power strength can cause performance losses. To overcome this drawback, in this paper, we propose an anti-jamming MDFH (AJ-MDFH) system. The main idea is to transmit a secure ID sequence along with the information stream. The ID sequence is generated through a cryptographic algorithm using the shared secret between the transmitter and the receiver. It is then exploited by the receiver for effective signal detection and extraction. It is shown that AJ-MDFH can effectively reduce the performance degradation caused by disguised jamming. Moreover, AJ-MDFH can be extended to a multi-carrier scheme for higher spectral efficiency and/or more robust jamming resistance. Simulation example is provided to demonstrate the performance of the proposed approaches.
    Wireless Algorithms, Systems, and Applications, 5th International Conference, WASA 2010, Beijing, China, August 15-17, 2010. Proceedings; 01/2010