Search Results (12)

Proxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access control. However, most existing proxy re-signature schemes, which are predominantly based on traditional public-key cryptosystems, face security vulnerabilities and certificate management bottlenecks. While identity-based schemes alleviate some issues, they introduce key escrow concerns. Certificateless schemes effectively resolve both certificate management and key escrow problems but remain vulnerable to quantum computing threats. To address these limitations, this paper constructs an efficient post-quantum certificateless proxy re-signature scheme based on algebraic lattices. Building upon algebraic lattice theory and leveraging the Dilithium algorithm, our scheme innovatively employs a lattice basis reduction-assisted parameter selection strategy to mitigate the potential algebraic attack vectors inherent in the NTRU lattice structure. This ensures the security and integrity of multi-party communication in quantum-threat environments. Furthermore, the scheme significantly reduces computational overhead and optimizes signature storage complexity through structured compression techniques, facilitating deployment on resource-constrained devices like Internet of Things (IoT) terminals. We formally prove the unforgeability of the scheme under the adaptive chosen-message attack model, with its security reducible to the hardness of the corresponding underlying lattice problems. Full article

Layered algebras are introduced and used to express layered graphs. Layered graphs are considered to be a highly effective abstract tool to manage the difficulty in conceptualizing and reasoning regarding complex systems related to coding in email exchange and access control in security. In the present paper, we study the varieties of several classes of lattice-based layer algebras and show that all these varieties have decidable equational theory via a finite model property. Full article

We fit the three finestructure constants of the Standard Model, in which the first approximation of theoretically estimable parameters include (1) a “unified scale”, turning out not equal to the Planck scale and thus only estimable by a very speculative story, the second includes (2) a “number of layers” being a priori the number of families, and the third is (3) a unified coupling related to a critical coupling on a lattice. So formally, we postdict the three fine structure constants! In the philosophy of our model, there is a physical lattice theory with link variables taking values in a (or in the various) “small” representation(s) of the standard model Group. We argue for that these representations function in the first approximation based on the theory of a genuine $SU\left(5\right)$ theory. Next, we take into account fluctuation of the gauge fields in the lattice and obtain a correction to the a priori $SU\left(5\right)$ approximation, because of course the link fluctuations not corresponding to any standard model Lie algebra, but only to the SU(5), do not exist. The model is a development of our old anti-grand-unification model having as its genuine gauge group, close to fundamental scale, a cross-product of the standard model group $S\left(U\right(3)\times U(2\left)\right)$ with itself, with there being one Cartesian product factor for each family. In our old works, we included the hypothesis of the “multiple point criticallity principle”, which here effectively means the coupling constants are critical on the lattice. Counted relative to the Higgs scale, we suggest in our sense that the“unified scale” (where the deviations between the inverse fine structure constants deviate by quantum fluctuations being only from standard model groups, not SU(5)) makes up the 2/3rd power of the Planck scale relative to the Higgs scale or the topquarkmass scale. Full article

This paper reveals some relations between fuzzy logic and quantum logic on partial residuated implications (PRIs) induced by partial t-norms as well as proposes partial residuated monoids (PRMs) and partial residuated lattices (PRLs) by defining partial adjoint pairs. First of all, we introduce the connection between lattice effect algebra and partial t-norms according to the concept of partial t-norms given by Borzooei, together with the proof that partial operation in any commutative quasiresiduated lattice is partial t-norm. Then, we offer the general form of PRI and the definition of partial fuzzy implication (PFI), give the condition that partial residuated implication is a fuzzy implication, and prove that each PRI is a PFI. Next, we propose PRLs, study their basic characteristics, discuss the correspondence between PRLs and lattice effect algebras (LEAs), and point out the relationship between LEAs and residuated partial algebras. In addition, like the definition of partial t-norms, we provide the notions of partial triangular conorms (partial t-conorms) and corresponding partial co-residuated lattices (PcRLs). Lastly, based on partial residuated lattices, we define well partial residuated lattices (wPRLs), study the filter of well partial residuated lattices, and then construct quotient structure of PRMs. Full article

General overlap functions are generalized on the basis of overlap functions, which have better application effects in classification problems, and the (weak) inflationary BL-algebras as the related algebraic structure were also studied. However, general overlap functions are a class of aggregation operators, and their commutativity puts certain restrictions on them. In this article, we first propose the notion of pseudo general overlap functions as a non-commutative generalization of general overlap functions, so as to extend their application range, then illustrate their relationship with several other commonly used aggregation functions, and characterize some construction methods. Secondly, the residuated implications induced by inflationary pseudo general overlap functions are discussed, and some examples are given. Then, on this basis, we show the definitions of inflationary pseudo general residuated lattices (IPGRLs) and weak inflationary pseudo BL-algebras, and explain that the weak inflationary pseudo BL-algebras can be gained by the inflationary pseudo general overlap functions. Moreover, they are more extensive algebraic structures, thus enriching the content of existing non-classical logical algebra. Finally, their related properties and their relations with some algebraic structures such as non-commutative residuated lattice-ordered groupoids are investigated. The legend reveals IPGRLs include all non-commutative algebraic structures involved in the article. Full article

In recent years, the m-polar fuzziness structure and the cubic structure have piqued the interest of researchers and have been commonly implemented in algebraic structures like groupoids, semigroups, groups, rings and lattices. The cubic m-polar (${\mathcal{C}}_m\mathcal{P}$) structure is a generalization of m-polar fuzziness and cubic structures. The intent of this research is to extend the ${\mathcal{C}}_m\mathcal{P}$ structures to the theory of groups and semigroups. In the present research, we preface the concept of the ${\mathcal{C}}_m\mathcal{P}$ groups and probe many of its characteristics. This concept allows the membership grade and non-membership grade sequence to have a set of m-tuple interval-valued real values and a set of m-tuple real values between zero and one. This new notation of group (semigroup) serves as a bridge among ${\mathcal{C}}_m\mathcal{P}$ structure, classical set and group (semigroup) theory and also shows the effect of the ${\mathcal{C}}_m\mathcal{P}$ structure on a group (semigroup) structure. Moreover, we derive some fundamental properties of ${\mathcal{C}}_m\mathcal{P}$ groups and support them by illustrative examples. Lastly, we vividly construct semigroup and groupoid structures by providing binary operations for the ${\mathcal{C}}_m\mathcal{P}$ structure and provide some dominant properties of these structures. Full article

To express wider uncertainty, Běhounek and Daňková studied fuzzy partial logic and partial function. At the same time, Borzooei generalized t-norms and put forward the concept of partial t-norms when studying lattice valued quantum effect algebras. Based on partial t-norms, Zhang et al. studied partial residuated implications (PRIs) and proposed the concept of partial residuated lattices (PRLs). In this paper, we mainly study the related algebraic structure of fuzzy partial logic. First, we provide the definitions of regular partial t-norms and regular partial residuated implication (rPRI) through the general forms of partial t-norms and partial residuated implication. Second, we define regular partial residuated lattices (rPRLs) and study their corresponding properties. Third, we study the relations among commutative quasi-residuated lattices, commutative Q-residuated lattices, partial residuated lattices, and regular partial residuated lattices. Last, in order to obtain the filter theory of regular partial residuated lattices, we restrict certain conditions and then propose special regular partial residuated lattices (srPRLs) in order to finally construct the quotient structure of regular partial residuated lattices. Full article

Group communication enables Internet of Things (IoT) devices to communicate in an efficient and fast manner. In most instances, a group message needs to be encrypted using a cryptographic key that only devices in the group know. In this paper, we address the problem of establishing such a key using a lattice-based one-way function, which can easily be inverted using a suitably designed lattice trapdoor. Using the notion of a bad/good basis, we present a new method of coupling multiple private keys into a single public key, which is then used for encrypting a group message. The protocol has the apparent advantage of having a conjectured resistance against potential quantum-computer-based attacks. All functions—key establishment, session key update, node addition, encryption, and decryption—are effected in constant time, using simple linear-algebra operations, making the protocol suitable for resource-constrained IoT networks. We show how a cryptographic session group key can be constructed on the fly by a user with legitimate credentials, making node-capture-type attacks impractical. The protocol also incorporates a mechanism for node addition and session-key generation in a forward- and backward-secrecy-preserving manner. Full article

In generating invariants for hybrid systems, a main source of intractability is that transition relations are first-order assertions over current-state variables and next-state variables, which doubles the number of system variables and introduces many more free variables. The more variables, the less tractability and, hence, solving the algebraic constraints on complete inductive conditions by a comprehensive Gröbner basis is very expensive. To address this issue, this paper presents a new, complete method, called the Citing Instances Method (CIM), which can eliminate the free variables and directly solve for the complete inductive conditions. An instance means the verification of a proposition after instantiating free variables to numbers. A lattice array is a key notion in this paper, which is essentially a finite set of instances. Verifying that a proposition holds over a Lattice Array suffices to prove that the proposition holds in general; this interesting feature inspires us to present CIM. On one hand, instead of computing a comprehensive Gröbner basis, CIM uses a Lattice Array to generate the constraints in parallel. On the other hand, we can make a clever use of the parallelism of CIM to start with some constraint equations which can be solved easily, in order to determine some parameters in an early state. These solved parameters benefit the solution of the rest of the constraint equations; this process is similar to the domino effect. Therefore, the constraint-solving tractability of the proposed method is strong. We show that some existing approaches are only special cases of our method. Moreover, it turns out CIM is more efficient than existing approaches under parallel circumstances. Some examples are presented to illustrate the practicality of our method. Full article

In recent years, fuzzy multisets and neutrosophic sets have become a subject of great interest for researchers and have been widely applied to algebraic structures include groups, rings, fields and lattices. Neutrosophic multiset is a generalization of multisets and neutrosophic sets. In this paper, we proposed a algebraic structure on neutrosophic multisets is called neutrosophic multigroups which allow the truth-membership, indeterminacy-membership and falsity-membership sequence have a set of real values between zero and one. This new notation of group as a bridge among neutrosophic multiset theory, set theory and group theory and also shows the effect of neutrosophic multisets on a group structure. We finally derive the basic properties of neutrosophic multigroups and give its applications to group theory. Full article

Cubic sets are the very useful generalization of fuzzy sets where one is allowed to extend the output through a subinterval of $[0,1]$ and a number from $[0,1]$ . Generalized cubic sets generalized the cubic sets with the help of cubic point. On the other hand Soft sets were proved to be very effective tool for handling imprecision. Semigroups are the associative structures have many applications in the theory of Automata. In this paper we blend the idea of cubic sets, generalized cubic sets and semigroups with the soft sets in order to develop a generalized approach namely generalized cubic soft sets in semigroups. As the ideal theory play a fundamental role in algebraic structures through this we can make a quotient structures. So we apply the idea of neutrosophic cubic soft sets in a very particular class of semigroups namely weakly regular semigroups and characterize it through different types of ideals. By using generalized cubic soft sets we define different types of generalized cubic soft ideals in semigroups through three different ways. We discuss a relationship between the generalized cubic soft ideals and characteristic functions and cubic level sets after providing some basic operations. We discuss two different lattice structures in semigroups and show that in the case when a semigroup is regular both structures coincides with each other. We characterize right weakly regular semigroups using different types of generalized cubic soft ideals. In this characterization we use some classical results as without them we cannot prove the inter relationship between a weakly regular semigroups and generalized cubic soft ideals. This generalization leads us to a new research direction in algebraic structures and in decision making theory. Full article

The localization properties of the wave functions of vibrations in two-dimensional (2D) crystals are studied numerically for square and hexagonal lattices within the framework of an algebraic model. The wave functions of 2D lattices have remarkable localization properties, especially at the van Hove singularities (vHs). Finite-size sheets with a hexagonal lattice (graphene-like materials), in addition, exhibit at zero energy a localization of the wave functions at zigzag edges, so-called edge states. The striped structure of the wave functions at a vHs is particularly noteworthy. We have investigated its stability and that of the edge states with respect to perturbations in the lattice structure, and the effect of the boundary shape on the localization properties. We find that the stripes disappear instantaneously at the vHs in a square lattice when turning on the perturbation, whereas they broaden but persist at the vHss in a hexagonal lattice. For one of them, they eventually merge into edge states with increasing coupling, which, in contrast to the zero-energy edge states, are localized at armchair edges. The results are corroborated based on participation ratios, obtained under various conditions. Full article