As a convenient and low-cost mobile communication technology, short messaging service (SMS) is experiencing rapid growth and our findings provide practical implications for promoting SMS based Virtual Private Network successfully. Secure communication is an important aspect of any networking environment and also is an especially significant challenge in data transmission, fund transfers, import...

We consider a new form of authenticated key exchange which we call multi-factor passwordauthenticated 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 disclo...

An analogue of McEliece’s cryptosystem, the Gabidulin-Paramonov-Trejtakov (GPT) public-key cryptosystem is based on rank-metric-based Gabidulin codes instead of Goppa codes. The GPT cryptosystem has attracted steady attention since it is much more robust against the decoding attacks and can therefore achieve the same level of security with much smaller keys. The key sizes, nonetheless, may stil...

In this paper, we introduce a new concept of digital signature that we call fuzzy signature, which is a signature scheme that uses a noisy string such as biometric data as a private key, but does not require user-specific auxiliary data (which is also called a helper string in the context of fuzzy extractors), for generating a signature. Our technical contributions are three-fold: (1) We first ...

This standard describes a syntax for private-key information. Private-key information includes a private key for some public-key cryptosystem and a set of attributes. The standard also describes a syntax for encrypted private keys. A password-based encryption algorithm (e.g., one of those described in PKCS #5 [1]) could be used to encrypt the private-key information. The intention of including ...

In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon generalized to a Gröbner basis formulation. Since then a handful of improvements of this construction has been proposed. In this paper it is suggested that security, and possibly e ciency, of any Polly Cracker-type cryptosyst...

The ring signature is a group signature without a group manager, so that a signer realizes a signature in the name of the group. In some situations it is necessary for a message to be signed by more than one persons. The scheme of the ring signature with divided key is an algorithm which ensures realizing a key signature by a group of k entities from a group of n entities. Because of the way th...

In this paper steganographic approaches to DNA cryptography are presented. The rst approach shows how digital DNA strands can be used for steganography to provide rapid encryption and decryption. The second approach is based on a method of graphical subtraction of gel-images. It can be used to constitute a molecular checksum and can be combined with the rst approach to support encryption. The s...

One of the important applications of digital signature is anonymous credential or pseudonym system. In these scenarios, it is essential that the identity of the signer is kept secret from any third party, except the trusted authority. The identity in such a system is uniquely identified by the secret key (or the signing key) rather than the public key, since the public key may be repeatedly ran...