The paper presents new results concerning application of cellular automata (CAs) to the secret key cryptography extending results presented in (14, 1.51. One dimensional, nonunifOrm CAs is considered us a generator ofpseudorundam number sequences (PNS) used in cryptography with the secret key. The quality of PNSs highly depends on a set of applied CA rules. Tojnd such rules nonunifOrm CAs with ...

Cloud storage auditing is the process of verifying the integrity of the data stored in public cloud. The existing auditing protocols are based on the assumption that the client’s secret key for auditing is secure. In practical the secret key is not absolutely secure due to weak security settings at the client. If secret key for auditing is exposed, most of the current auditing protocols become ...

A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broa...

Kerberos has become a mature, reliable, secure network authentication protocol. Kerberos is based on secret key encryption technology. It is the native network authentication protocol in the Microsoft Windows 2000 operating system and may be a candidate for use as a general-purpose authentication protocol for large user communities on the Internet. Several proposals have been developed that add...

This paper is concerned with key escrow protocols for use in international communications environments, where communication domains do not necessarily trust one another. It is concerned particularly with systems where users place their trust collectively with groups of trusted third parties. We consider two diierent protocols, discuss and improve their eeciency and generalise the type of key sp...

We propose quantum secret sharing scheme that emphasizes on the cooperation (twice) of communicating parties to avoid untrustworthy members and improves the strength of the key. The proposed scheme is a new approach in quantum secret sharing in which cooperation of the parties is emphasized at the same time the key is strengthened by performing a shift operation on the received partial keys. In...

• The insider and outsider attacks against the improved version (Subsection 3.1, Methods 1 and 2; Subsection 3.2 Method 1) are limited by the success of a guessing attack against the hash function. We highlight that the attacks assume the guessing of a random number (not a password, which would have been feasible!). Hence, if the hash function is properly selected, the attacks are infeasible1. ...