Number theoretic public key solutions are subject to various quantum attacks making them less attractive for longer term use. Certain group theoretic constructs show promise in providing quantum-resistant cryptographic primitives. We introduce a new protocol called a Meta Key Agreement and Authentication Protocol (MKAAP) that has some characteristics of a public key solution and some of a share...

In this paper, a novel scheme to generate (n 2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle at...

Group communication is exploding in Internet applications such as video conferences, online chatting programs, games, and gambling. Since most group communication takes place over the Internet that is a wide open network, security plays a major role. For a secure communication, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintai...

Identification, authentication and key agreement protocol of UMTS networks have some weaknesses to provide DoS-attack resistance, mutual freshness, and efficient bandwidth consumption. In this article we consider UMTS AKA and some other proposed schemes. Then we explain the known weaknesses in the previous frameworks suggested for UMTS AKA protocol. After that we propose a new UMTS AKA protocol...

In interactive situations, agents can “learn” something that is not a preexisting truth. They can converge to an arbitrary convention, or tacit agreement. Once established they may even view it as an objective truth. Here we investigate accommodation dynamics for interpersonal comparisons of utility intervals. We show, for a large class of dyIn namics, convergence to a convention.

In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this paper we compare the s...

The HMQV protocols are ‘hashed variants’ of the MQV key agreement protocols. They were introduced at CRYPTO 2005 by Krawczyk, who claimed that the HMQV protocols have very significant advantages over their MQV counterparts: (i) security proofs under reasonable assumptions in the (extended) Canetti-Krawczyk model for key exchange; and (ii) superior performance in some situations. In this paper w...