Many work was done for filiform Lie algebras defined by M. Vergne [8]. An interesting fact is that this algebras are obtained by deformations of the filiform Lie algebra Ln,m. This was used for classifications in [4]. Like filiform Lie algebras, filiform Lie superalgebras are obtained by nilpotent deformations of the Lie superalgebra Ln,m. In this paper, we recall this fact and we study even co...

We present new techniques for achieving adaptive security in broadcast encryption systems. Previous work on fully collusion resistant broadcast encryption with short ciphertexts was limited to considering only static security. First, we present a new definition of security that we call semi-static security and show a generic “two-key” transformation from semi-statically secure systems to adapti...

We consider discrete-time projective semilinear control systems ξt`1 “ Aputq ̈ ξt, where the states ξt are in projective space RPd ́1, inputs ut are in a manifold U of arbitrary dimension, and A : U Ñ GLpd,Rq is a differentiable mapping. An input sequence pu0, . . . , uN ́1q is called universally regular if for any initial state ξ0 P RPd ́1, the derivative of the time-N state with respect to the i...

We present new techniques for achieving adaptive security in broadcast encryption systems. Previous work on fully collusion resistant broadcast encryption systems with very short ciphertexts was limited to considering only static security. First, we present a new definition of security that we call semi-static security and show a generic “two-key” transformation from semi-statically secure syst...

On a suitable category of formal schemes equipped with codimension functions we construct a canonical pseudofunctor (−)♯ taking values in the corresponding categories of Cousin complexes. Cousin complexes on such a formal scheme X functorially represent derived-category objects F by the local cohomologies H codim(x) x F (x ∈ X) together with “residue maps” from the cohomology at x to that at ea...

Functional encryption is a new paradigm of public-key encryption that allows a user to compute f (x) on encrypted data CT (x) with a private key SK f to finely control the revealed information. Multi-input functional encryption is an important extension of (single-input) functional encryption that allows the computation f (x1, . . . ,xn) on multiple ciphertexts CT (x1), . . . ,CT (xn) with a pr...

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to R^d$ of nonnegative coefficients and vector $s\in positive entries, among an exponentially number ways combining $n$ instances $s$ using $n-1$ applications $*$ for given $n$, we are interested in the largest entry over all resulting vectors. An asymptotic behavior is that $n$-th root this converges to growth rate $\lambda$ when tends infini...

In this paper, we propose a novel practical Certificate-Less digital signing system based on bilinear map pairings defined on super elliptic curve, which is proved more efficiency than some similar systems pioneered heretofore as viewed from information security application widely applied in mobile-thin computation environment often with a narrow communication bandwidth concomitant. For a long ...