Anonymous Authentication with Shared Secrets

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.

Deviated linear cyclic pursuit

This paper analyses deviated linear cyclic pursuit in which an agent pursues its leader with an angle of deviation in both the continuous- and discrete-time domains, while admitting heterogeneous gains and deviations for the agents. Sufficient conditions for the stability of such systems, in both the domains, are presented in this paper along with the derivation of the reachable set, which is a set of points where the agents may converge asymptotically. The stability conditions are derived based on Gershgorin's theorem. Simulations validating the theoretical results presented in this paper are provided.

Nonrotating Beams Isospectral to Tapered Rotating Beams

In this paper, we seek to find nonrotating beams that are isospectral to a given tapered rotating beam. Isospectral structures have identical natural frequencies. We assume the mass and stiffness distributions of the tapered rotating beam to be polynomial functions of span. Such polynomial variations of mass and stiffness are typical of helicopter and wind turbine blades. We use the Barcilon-Gottlieb transformation to convert the fourth-order governing equations of the rotating and the nonrotating beams, from the (x, Y) frame of reference to a hypothetical (z, U) frame of reference. If the coefficients of both the equations in the (z, U) frame match with each other, then the nonrotating beam is isospectral to the given rotating beam. The conditions on matching the coefficients lead to a pair of coupled differential equations. Wesolve these coupled differential equations numerically using the fourth-order Runge-Kutta scheme. We also verify that the frequencies (given in the literature) of standard tapered rotating beams are the frequencies (obtained using the finite-element analysis) of the isospectral nonrotating beams. Finally, we present an example of beams having a rectangular cross-section to show the application of our analysis. Since experimental determination of rotating beam frequencies is a difficult task, experiments can be easily conducted on these isospectral nonrotating beams to calculate the frequencies of the rotating beam.