Secure group communication systems have become increasingly important for many emerging network applications. An efficient and robust group key management approach is indispensable to a secure group communication system. Motivated by the theory of hyper-sphere, this paper presents a new group key management approach with a group controller (GC). In our new design, a hyper-sphere is constructed for a group and each member in the group corresponds to a point on the hyper-sphere, which is called the member's private point. The GC computes the central point of the hyper-sphere, intuitively, whose “distance” from each member's private point is identical. The central point is published such that each member can compute a common group key, using a function by taking each member's private point and the central point of the hyper-sphere as the input. This approach is provably secure under the pseudo-random function (PRF) assumption. Compared with other similar schemes, by both theoretical analysis and experiments, our scheme (1) has significantly reduced memory and computation load for each group member; (2) can efficiently deal with massive membership change with only two re-keying messages, i.e., the central point of the hyper-sphere and a random number; and (3) is efficient and very scalable for large-size groups.

No abstract uploaded!

Let A and A be non-negative self-adjoint operators in a separable Hilbert space such that its form sum A is densely defined. It is shown that the Trotter product formula holds for imaginary times in the A -norm, that is, one has%%\begin {displaymath}

For any 2⩽r⩽∞,n⩾2, we prove the existence of an open set U of C^r‑self‑mappings of any n‑manifold so that a generic map f in U displays a fast growth of the number of periodic points: the number of its n‑periodic points grows as fast as asked. This complements the works of Martens–de Melo–van Strien, Kaloshin, Bonatti–Díaz–Fisher and Turaev, to give a full answer to questions asked by Smale in 1967, Bowen in 1978 and Arnold in 1989, for any manifold of any dimension and for any smoothness. Furthermore, for any 1⩽r<∞ and any k⩾0, we prove the existence of an open set \hat U of k-parameter families in U such that for a generic (f_p)^p ∈ \hat U, for every ∥p∥⩽1, the map f_p displays a fast growth of the number of periodic points. This gives a negative answer to a problem asked by Arnold in 1992 in the finitely smooth case.

Micciancio defined a generalization of cyclic lattices, called ideal lattices. These lattices can be used in cryptosystems to decrease the number of parameters necessary to describe a lattice by a square root, making them more efficient. He proves that the computational intractability of classic lattice problems for these lattices gives rise to provably secure one-way and collision-resistant hash functions. This provable security relies on the assumption that reducing bases of ideal lattices is similar to reducing bases of random lattices. We give an indication that lattice problems in ideal lattices do not represent the general case by providing a distinguisher, which decides in time O(n^4) whether a given basis of rank spans an ideal lattice or not. Using this algorithm we perform a statistical analysis for several dimensions and show that randomly generated lattices are practically never ideal.