One-time-password-authenticated key exchange

To reduce the damage of phishing and spyware attacks, banks, governments, and other security-sensitive industries are deploying one-time password systems, where users have many passwords and use each password only once. If a single password is compromised, it can be only be used to impersonate the user once, limiting the damage caused. However, existing practical approaches to one-time passwords have been susceptible to sophisticated phishing attacks. ---------- We give a formal security treatment of this important practical problem. We consider the use of one-time passwords in the context of password-authenticated key exchange (PAKE), which allows for mutual authentication, session key agreement, and resistance to phishing attacks. We describe a security model for the use of one-time passwords, explicitly considering the compromise of past (and future) one-time passwords, and show a general technique for building a secure one-time-PAKE protocol from any secure PAKE protocol. Our techniques also allow for the secure use of pseudorandomly generated and time-dependent passwords.

Identity management : strengthening one-time password authentication through usability

Usability in HCI (Human-Computer Interaction) is normally understood as the simplicity and clarity with which the interaction with a computer program or a web site is designed. Identity management systems need to provide adequate usability and should have a simple and intuitive interface. The system should not only be designed to satisfy service provider requirements but it has to consider user requirements, otherwise it will lead to inconvenience and poor usability for users when managing their identities. With poor usability and a poor user interface with regard to security, it is highly likely that the system will have poor security. The rapid growth in the number of online services leads to an increasing number of different digital identities each user needs to manage. As a result, many people feel overloaded with credentials, which in turn negatively impacts their ability to manage them securely. Passwords are perhaps the most common type of credential used today. To avoid the tedious task of remembering difficult passwords, users often behave less securely by using low entropy and weak passwords. Weak passwords and bad password habits represent security threats to online services. Some solutions have been developed to eliminate the need for users to create and manage passwords. A typical solution is based on generating one-time passwords, i.e. passwords for single session or transaction usage. Unfortunately, most of these solutions do not satisfy scalability and/or usability requirements, or they are simply insecure. In this thesis, the security and usability aspects of contemporary methods for authentication based on one-time passwords (OTP) are examined and analyzed. In addition, more scalable solutions that provide a good user experience while at the same time preserving strong security are proposed.

Quantum one-time programs

A one-time program is a hypothetical device by which a user may evaluate a circuit on exactly one input of his choice, before the device self-destructs. One-time programs cannot be achieved by software alone, as any software can be copied and re-run. However, it is known that every circuit can be compiled into a one-time program using a very basic hypothetical hardware device called a one-time memory. At first glance it may seem that quantum information, which cannot be copied, might also allow for one-time programs. But it is not hard to see that this intuition is false: one-time programs for classical or quantum circuits based solely on quantum information do not exist, even with computational assumptions. This observation raises the question, "what assumptions are required to achieve one-time programs for quantum circuits?" Our main result is that any quantum circuit can be compiled into a one-time program assuming only the same basic one-time memory devices used for classical circuits. Moreover, these quantum one-time programs achieve statistical universal composability (UC-security) against any malicious user. Our construction employs methods for computation on authenticated quantum data, and we present a new quantum authentication scheme called the trap scheme for this purpose. As a corollary, we establish UC-security of a recent protocol for delegated quantum computation.

Efficient one-time proxy signatures

One-time proxy signatures are one-time signatures for which a primary signer can delegate his or her signing capability to a proxy signer. In this work we propose two one-time proxy signature schemes with different security properties. Unlike other existing one-time proxy signatures that are constructed from public key cryptography, our proposed schemes are based one-way functions without trapdoors and so they inherit the communication and computation efficiency from the traditional one-time signatures. Although from a verifier point of view, signatures generated by the proxy are indistinguishable from those created by the primary signer, a trusted authority can be equipped with an algorithm that allows the authority to settle disputes between the signers. In our constructions, we use a combination of one-time signatures, oblivious transfer protocols and certain combinatorial objects. We characterise these new combinatorial objects and present constructions for them.

Zero knowledge one time digital signature scheme

In many applications, when communicating with a host, we may or may not be concerned about the privacy of the data but are mainly concerned about the integrity of data being transmitted. This paper presents a simple algorithm based on zero knowledge proof by which the receiver can confirm the integrity of data without the sender having to send the digital signature of the message directly. Also, if the same document is sent across by the same user multiple times, this scheme results in different digital signature each time thus making it a practical one-time signature scheme.

The motion and the core structure of a geostrophic vortex - one-time scale inner solution and the motion of the vortex

By means of the matched asymptotic expansion method with one-time scale analysis we have shown that the inviscid geostrophic vortex solution represents our leading solution away from the vortex. Near the vortex there is a viscous core structure, with the length scale O(a). In the core the viscous stresses (or turbulent stresses) are important, the variations of the velocity and the equivalent height are finite and dependent of time. It also has been shown that the leading inner solutions of the core structure are the same for two different time scales of S/(ghoo)1/2 and S/a (ghoo)1/2. Within the accuracy of O(a) the velocity of a geostrophic vortex center is equal to the velocity of the local background flow, where the vortex is located, in the absence of the vortex. Some numerical examples demonstrate the contributions of these results.

Letters on the currency : addressed to Charles Wood, Esq. M.P. (Chairman of the Committee of the House of Commons, now sitting,) ascertaining for the first time, on true principles, the amount of inland and foreign bills of exchange, in circulation for several consecutive years, and out at one time : also, defending country bankers from the charge made against them in the work of S. Jones Loyd, Esq. : and giving unanswerable reasons why the notes of a bank of issue should not be substituted for the circulation of country bankers /

Goldsmiths'-Kress no. 31555.

The sword of the old frontier : a tale of Fort Chartres and Detroit : being a plain account of sundry adventures befalling Chevalier Raoul de Coubert, one time captain in the Hussars of Languedoc, during the year 1763 /

Mode of access: Internet.

"My merry Rockhurst"; being some episodes in the life of Viscount Rockhurst, a friend of King Charles the Second, and at one time constable of His Majesty's tower of London,

Mode of access: Internet.

The mobile phone as a multi OTP device using trusted computing

The rapid growth in the number of online services leads to an increasing number of different digital identities each user needs to manage. As a result, many people feel overloaded with credentials, which in turn negatively impact their ability to manage them securely. Passwords are perhaps the most common type of credential used today. To avoid the tedious task of remembering difficult passwords, users often behave less securely by using low entropy and weak passwords. Weak passwords and bad password habits represent security threats to online services. Some solutions have been developed to eliminate the need for users to create and manage passwords. A typical solution is based on giving the user a hardware token that generates one-time-passwords, i.e. passwords for single session or transaction usage. Unfortunately, most of these solutions do not satisfy scalability and/or usability requirements, or they are simply insecure. In this paper, we propose a scalable OTP solution using mobile phones and based on trusted computing technology that combines enhanced usability with strong security.

Relationship over time between psychological distress and physical activity in colorectal cancer survivors

Purpose Increased physical activity in colorectal cancer patients is related to improved recurrence free and overall survival. Psychological distress after cancer may place patients at risk of reduced physical activity; but paradoxically also act as a motivator for positive lifestyle change. The relationship between psychological distress and physical activity after cancer over time has not been described. Methods A prospective survey of 1966 (57% response) colorectal cancer survivors assessed the psychological distress variables of anxiety, depression, somatisation, cancer threat appraisal as predictors of physical activity five, 12, 24 and 36 months post-diagnosis 978 respondents had valid data for all time points. Results Higher somatisation was associated with greater physical inactivity (Relative risk ratio (RRR) =1.12; 95% CI=[1.1, 1.2]) and insufficient physical activity (RRR=1.05; [0.90, 1.0]). Respondents with a more positive appraisal of their cancer were significantly (p=0.031) less likely to be inactive (RRR=0.95; [0.90, 1.0]) or insufficiently active (RRR=0.96). Fatigued and obese respondents and current smokers were more inactive. Respondents whose somatisation increased between two time periods were less likely to increase their physical activity over the same period (p<0.001). Respondents with higher anxiety at one time period were less likely to have increased their activity at the next assessment (p=0.004). There was no association between depression and physical activity. Conclusions Cancer survivors who experience somatisation and anxiety are at greater risk of physical inactivity. The lack of a clear relationship between higher psychological distress and increasing physical activity argues against distress as a motivator to exercise in these patients.

Multi-factor password-authenticated key exchange

We consider a new form of authenticated key exchange which we call multi-factor password-authenticated key exchange, where session establishment depends on successful authentication of multiple short secrets that are complementary in nature, such as a long-term password and a one-time response, allowing the client and server to be mutually assured of each other's identity without directly disclosing private information to the other party. Multi-factor authentication can provide an enhanced level of assurance in higher-security scenarios such as online banking, virtual private network access, and physical access because a multi-factor protocol is designed to remain secure even if all but one of the factors has been compromised. We introduce a security model for multi-factor password-authenticated key exchange protocols, propose an efficient and secure protocol called MFPAK, and provide a security argument to show that our protocol is secure in this model. Our security model is an extension of the Bellare-Pointcheval-Rogaway security model for password-authenticated key exchange and accommodates an arbitrary number of symmetric and asymmetric authentication factors.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Two-time scales inner solutions and motion of a geostrophic vortex

Based on the authors' previous work, in this paper the systematical analyses on the motion and the inner solutions of a geostrophic vortex have been presented by means of thematched asymptotic expansion method with multiple time scales (S/gh001/2 and α S/gh001/2) and space scales. It has been shown that the leading inner solutions to the core structure in two-time scales analyses are identified with the results in normal one-time scale analyses. The time averages of the first-order solutions on short time variable τ are the same as the first-order solutions obtained in one normal time scale analyses. The geostrophic vortex induces an oscillatory motion in addition to moving with the background flow. The period, amplitude andthe deviation from the mean trajectory depend on the core structure and the initial conditions. The velocity of the motion of vortex center varies periodically and the time average of the velocity on short time variable τ is equal to the value of the local mean velocity.