JTJerry L. Trahan

Jerry L. Trahan

*This is an algorithmically generated author record based on publicly available information.

Jerry L. Trahan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • TTP-mtOTP: Trusted Third Party, Ownership Transfer Protocol for Multiple RFID Tags

    by Jerry L. Trahan, Vanya Cherneva

    RFID-tagged items can change owners at different points, for example, when a retail item is purchased or as part of a supply chain. Ownership transfer (OT) is to give the new owner a level of privileged access to the RFID tag by establishing secrets shared by new owner and tag, replacing the access and secrets of the old owner. Some OT protocols employ a trusted third party (TTP) as intermediary between old and new owners to protect the privacy of each from the other. In this paper, we present an OT protocol, TTP-mtOTP, to transfer multiple tags from an old owner to a new owner, using a TTP. In the protocol, the TTP provides information for a tag that belongs to the old owner to be able to recognize that a transfer is authorized and to authenticate the new owner. We establish the old and new owner privacy as well as the resistance of TTP-mtOTP against multiple security attacks. We compare privacy, security, computation, and communication properties of TTP-mtOTP against those of other OT protocols for multiple tags that use a TTP.

  • 2P-mtOTP: A Secure, Two-Party, Ownership Transfer Protocol for Multiple RFID Tags based on Quadratic Residues

    by Vanya Cherneva, Jerry L. Trahan

    Radio Frequency Identification (RFID) improves the efficiency of managing assets in supply chain applications throughout an entire life cycle or while in transport. Transfer of ownership of RFID-tagged items involves replacing information authorizing the old owner with information authorizing the new owner. In this work, we present a two-party, multiple tag, single-owner protocol for ownership transfer: 2P-mtOTP. This two-party protocol depends only on the communication among the two owners and the tags. Further, 2P-mtOTP is robust to attacks on its security, and it preserves the privacy of the owners and tags. We analyze our work in comparison to recent ownership transfer protocols in terms of security, privacy, and efficiency.

  • Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights

    by Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma, Jerry L. Trahan

    We consider the distributed setting of n autonomous mobile robots that operate in Look-Compute-Move cycles and communicate with other robots using a constant number of colored lights (the {\em robots with lights} model). We assume obstructed visibility where collinear robots do not see each other. In addition, we consider a grid-based terrain embedded in the 2-dimensional Euclidean plane. The {\sc Convex Hull Formation} problem is to relocate the $n$ robots (starting at arbitrary, but distinct, initial positions) so that each robot is positioned on a vertex of a convex hull. In this paper, we provide a framework for solving {\sc Convex Hull Formation}. We then provide four asynchronous algorithms under this framework. Key measures of the algorithms' performance include the time taken and the space occupied. The presented algorithms are randomized and their time bounds hold with high probability. The first $O(\max\{n^2,D\})$ -time, $O({n^2})$ -perimeter, and $O({n^3})$ -area algorithm serves to introduce key ideas, where D is the diameter of the initial configuration. The subsequent algorithms, differing in computational requirements, run in $O(\max\{n^{\frac{3}{2}},D\})$ time with a perimeter of $O(n^{\frac{3}{2}})$ and area of $O(n^{3})$ . We also prove lower bounds of $\Omega(n^{\frac{3}{2}})$ for time and perimeter and $\Omega(n^{3})$ for area, for any {\sc Convex Hull Formation} algorithm; i.e., our $O(\max\{n^{\frac{3}{2}},D\})-$ time algorithm is optimal in time, perimeter, and area.


  • On Optimal Doorway Egress by Autonomous Robots

    by Rory Hector, Ramachandran Vaidyanathan, Gokarna Sharma, Jerry Trahan

  • Open Access

    Evaluation of Algorithms for Randomizing Key Item Locations in Game Worlds

    by Caleb H. Johnson, Jerry L. Trahan, Tao Lu, Lu Peng

    In the past few years, game randomizers have become increasingly popular. In general, a game randomizer takes some aspect of a game that is usually static and shuffles it somehow. In particular, in this paper we will discuss the type of randomizer that shuffles the locations of items in a game where certain key items are needed to traverse the game world and access some of these locations. Examples of these types of games include series such as The Legend of Zelda and Metroid. In order to accomplish this shuffling in such a way that the player is able to reach the end of the game, some novel algorithms in graph theory must be utilized, where the game world and its item locations are represented as a graph and each edge on the graph has some rule for which items are required to traverse it. In this paper, we define these algorithms formally and evaluate them with different metrics that can guide a developer’s decision about which algorithm works best for their game.


  • Open Access

    Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case

    by Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan

    We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We assume obstructed visibility where a robot cannot see another robot if a third robot is positioned between them on the straight line segment connecting them. In this paper, we consider the problem of positioning N autonomous robots on a plane so that every robot is visible to all others (this is called the Complete Visibility problem). This problem is fundamental, as it provides a basis to solve many other problems under obstructed visibility. In this paper, we provide the first, asymptotically optimal, O(1) time, O(1) color algorithm for Complete Visibility in the asynchronous setting. This significantly improves on an O(N)-time translation of the existing O(1) time, O(1) color semi-synchronous algorithm to the asynchronous setting. The proposed algorithm is collision-free, i.e., robots do not share positions, and their paths do not cross. We also introduce a new technique for moving robots in an asynchronous setting that may be of independent interest, called Beacon-Directed Curve Positioning.


  • Serial-Dependency Grouping-Proof Protocol for RFID EPC Gen2 Tags

    by Vanya Cherneva, Jerry L. Trahan

    A key communication technology in smart cities and smart buildings for automation is RFID. Proving the simultaneous presence of a group of RFID-tagged objects is a practical need in many application areas within this domain. Some examples of this include vehicle fleets, smart parking, safety in public places (smart cities), security and access control (smart buildings), and asset location (supply chain system, health care industry). Security, privacy, and efficiency are central issues when designing such a grouping-proof protocol. This work is motivated by Sundaresan et al.’s grouping-proof protocol, which applies zero-knowledge techniques. In this paper, we propose a lightweight, offline, serial-dependency grouping-proof protocol. Compared to existing grouping-proof protocols, our scheme improves on efficiency, scalability, security, and communication cost. It resists well-known attacks on grouping-proofs including tag/reader impersonation, tracking, replay, desynchronization, and message integrity.