Generalized signcryption can adaptively work as an encryption scheme, a signature scheme, or a signcryption scheme with only one algorithm. The paper proposes an efficient certificateless generic signcryption scheme without utilizing bilinear pairing operations. It is proved to satisfy confidentiality and unforgeability against chosen ciphertext and message attacks in an adaptive manner, respectively, in the random oracle model. Due to the lower computational cost and communication overhead, the proposed scheme is suitable for low power and processor devices.

No abstract

No abstract

Abstract. A d-dimensional framework is a graph and a map from its vertices to E d . Such a framework is globally rigid if it is the only framework in E d with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a generic framework globally rigid? We answer this question by proving a conjecture by Connelly, that his sufficient condition is also necessary: a generic framework is globally rigid if and only if it has a stress matrix with kernel of dimension d + 1, the minimum possible.An alternate version of the condition comes from considering the geometry of the lengthsquared mapping : the graph is generically locally rigid iff the rank of is maximal, and it is generically globally rigid iff the rank of the Gauss map on the image of is maximal.We also show that this condition is efficiently checkable with a randomized algorithm, and prove that if a graph is not generically globally rigid then it is flexible one dimension higher.