A Key Distribution Center of a network is a server enabling private communications within groups of users. A Distributed Key Distribution Center is a set of servers that jointly realizes a Key Distribution Center. In this paper we build a robust Distributed Key Distribution Center Scheme secure against active and mobile adversary. We consider a general access structure for the set of servers an...

Based on a geometric meth.od, this paper presents an eficient a,nd authenticated cryptoscheme for establishing secure group-oriented data communications in internet environments. We assume that the internet environments consist of many hosts, and each host has many users attached to it. The secure group-oriented communication scheme proposed in this paper incorporates the public-key distributio...

Wireless sensor networks is composed of a large number of randomly deployed sensor nodes with limited computing ability and memory space. These characteristics gives rise to much challenge to key agreement. General key agreement schemes like KDC, PKI and Diffie-Hellman key exchange schemes are not applicable to the sensor networks. Several key distribution schemes have been proposed specificall...

In 1992, Blundo et al. have proposed a non-interactive k-secure m-conference protocol based on an m-variate polynomial over a finite field Fp. The key distribution center (KDC) is responsible to pick a symmetric m-variate polynomial of degree k and generate shares for users. Each share is a symmetric polynomial involving m− 1 variables of degree k, and needs to store the coefficients of such a ...

The combination of software-as-a-service and the increasing use of mobile devices gives rise to a considerable difference in computational power between servers and clients. Thus, there is a desire for clients to outsource the evaluation of complex functions to a server and to be able to verify that the resulting value is correct. Previous work in this area of Publicly Verifiable Outsourced Com...

Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related problem of mixed protocols, and show that a protocol can remain correct even when used in combination with a range of other protocols. We illustrate the method with the familiar OtwayRees [10, 1] protocol. We identify a simp...

Secure Group Communication is very critical for applications like board-meetings, group discussions and teleconferencing. Managing a set of secure group keys and group dynamics are the fundamental building blocks for secure group communication systems. Several group key management techniques have been proposed so far by many researchers. Some schemes are information theoretic and some are compl...

ethylene was homopolymerized over ziegler-natta catalyst and the homopolymerization was modeled using moment equations. mechanism was modeled according to five different reaction centers of catalyst. for each center, there are different reaction rate coefficients; therefore the final product of each center would be expected to be different. modeling results showed good conformity to the experim...