TL;DR: In this article, a method for allowing users to securely access a private resource without the need to enter a username, password, or other authentication information, and without downloading special authentication software or data to the user's computer, is provided.
Abstract: In a Web site system in which different private records or other resources are personal to different users, a method is provided for allowing users to securely access a private resource without the need to enter a username, password, or other authentication information, and without the need to download special authentication software or data to the user's computer. Each resource is assigned a private uniform resource locator (URL) which includes a fixed character string and a unique token, and the URLs are conveyed by email (preferably using hyperlinks) to users that are entitled to access such resources. The tokens are generated using a method which distributes the tokens substantially randomly over the range of allowable token values (“token space”). The token space is selected to be sufficiently large relative to the expected number of valid tokens to inhibit the identification of valid tokens through trial and error. When a user attempts to access a private URL (such as to access a private account information page), a token validation program is used to determine whether the token is valid. The method may be used to provide users secure to access private account information on the Web site of merchant. Other practical applications include electronic gift certificate and coupon redemption, gift registries, order confirmation electronic voting, and electronic greeting cards.
TL;DR: This paper describes a method of implementing two factor authentication using mobile phones that guarantees that authenticating to services, such as online banking or ATM machines, is done in a very secure manner.
Abstract: This paper describes a method of implementing two factor authentication using mobile phones. The proposed method guarantees that authenticating to services, such as online banking or ATM machines, is done in a very secure manner. The proposed system involves using a mobile phone as a software token for One Time Password generation. The generated One Time Password is valid for only a short user-defined period of time and is generated by factors that are unique to both, the user and the mobile device itself. Additionally, an SMS-based mechanism is implemented as both a backup mechanism for retrieving the password and as a possible mean of synchronization. The proposed method has been implemented and tested. Initial results show the success of the proposed method.
TL;DR: In this article, the authors describe a system with a token (12), a token processor (14), and a host processor (16), which contains a memory (18) that contains a secret user code (22) and a read/write element (20).
Abstract: The system (10) has a token (12), a token processor (14), and a host processor (16). The token (12) may be a 'dumb' token, and contains a memory (18) that contains a secret user code (22) and a read/write element (20). The memory (18) may also contain a public code (24), an algorithm (26), and a time-varying value (28). The token may have a numeric keypad (30) for an imput device.
TL;DR: In this article, the authors propose a distributed synchronization system for replicated files in distributed systems using a library which replaces a standard I/O library, and may thus be employed without modification to hardware or the operating system.
Abstract: Techniques for providing replicated files in a distributed system. A replicated file has a set of copies in components of the distributed system. Operations on the copies have the same semantics for the application processes accessing them as operations on a single copy of a file in a system where all processes execute on the same host. These semantics are achieved by means of a distributed synchronization system. Each replicated file has a read token and a write token. In order for an application process to perform an operation on a replicated file, the token required for the operation must be in the process's host and the process must have access to the token. Tokens are passed between hosts by token servers which respond to requests for tokens from application processes and from other token servers. The techniques are implemented using a library which replaces a standard I/O library, and may thus be employed without modification to hardware or the operating system.
TL;DR: Wang et al. as mentioned in this paper proposed MePKC (Memorizable Public-Key Cryptography) using fully memorizable private key, which can be used to create big secret.
Abstract: Main invention is methods and systems to create big and yet memorizable secret, which are later applied into many novel and innovated applications in information engineering. Among the big secret creation methods are (i) self-created signature-like Chinese character, (ii) two-dimensional key (2D key), (iii) multilingual key, (iv) multi-tier geo-image key, (v) multi-factor key using software token, and their hybrid combinations. Multihash key using hash iteration and hash truncation is further used to increase number of created secret for multiple offline and online accounts. Besides, multihash signature using multiple hash values of a message from different hash iteration provides object-designated signature function. The object may be recipient, action, feature, function, meaning, etc., as representation. Also, random space steganography using stego-data with random noise insertion is proposed. The main application of big memorizable secret is MePKC (Memorizable Public-Key Cryptography) using fully memorizable private key. Here, 160- to 512-bit MePKC can be realized.