Results 21 to 30 of about 30,832 (233)

Pairing-Free for Public Key Encryption With Equality Test Scheme

open access: yesIEEE Access, 2021
The modular exponentiation has been proved better in terms of computational efficiency as compared to bilinear pairing. Therefore, discrete logarithm, a concept of modular exponentiation may be incorporated to present improved security schemes. With this
Huijun Zhu   +3 more
doaj   +1 more source

Duality between quantum symmetric algebras [PDF]

open access: yes, 2006
Using certain pairings of couples, we obtain a large class of two-sided non-degenerated graded Hopf pairings for quantum symmetric algebras.Comment: 15 pages. Letters in Math.
C. Cibils   +13 more
core   +2 more sources

Expanders and right-angled Artin groups

open access: yes, 2021
The purpose of this article is to give a characterization of families of expander graphs via right-angled Artin groups. We prove that a sequence of simplicial graphs $\{\Gamma_i\}_{i\in\mathbb{N}}$ forms a family of expander graphs if and only if a ...
Flores, Ramón   +2 more
core   +1 more source

Multilinear morphisms between 1-motives [PDF]

open access: yes, 2007
Let S be an arbitrary scheme. We define biextensions of 1-motives by 1-motives which we see as the geometrical origin of morphisms from the tensor product of two 1-motives to a third one. If S is the spectrum of a field of characteristic 0, we check that
Bertolin, Cristiana
core   +8 more sources

Efficient identity-based authenticated multiple key exchange protocol - doi: 10.4025/actascitechnol.v35i4.16434

open access: yesActa Scientiarum: Technology, 2013
Authenticated multiple key exchange (AMKE) protocols not only allow participants to warrant multiple session keys within one run of the protocol but also ensure the authenticity of the other party.
Yitao Chen, Weiwei Han
doaj   +1 more source

The review on elliptic curves as cryptographic pairing groups [PDF]

open access: yesMathematics and Computational Sciences, 2021
Elliptic curve is a set of two variable points on polynomials of degree 3 over a field acted by an addition operation that forms a group structure. The motivation of this study is the mathematics behind that elliptic curve to the applicability within a ...
E Khamseh
doaj   +1 more source

An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments

open access: yesCryptography, 2018
Attribute-based encryption (ABE) is used for achieving data confidentiality and access control in cloud environments. Most often ABE schemes are constructed using bilinear pairing which has a higher computational complexity, making algorithms inefficient
Balaji Chandrasekaran   +1 more
doaj   +1 more source

Electronic voting protocol from bilinear pairings

open access: yesRevista Facultad de Ingeniería Universidad de Antioquia, 2013
Electronic voting has been an active research area since two decades, which involves using information systems and cryptographic schemes in order to reduce costs and human mistakes as well as increase process speed, without discard its security. In the literature there exist some proposals, which are based on the difficult to resolve mathematical ...
Gina Gallegos García   +2 more
openaire   +2 more sources

Limited Verifier Signature from Bilinear Pairings [PDF]

open access: yes, 2004
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a limited verifier, who will try to preserve the privacy of the signer if the signer follows some specified rules. Also, the limited verifier can provide a proof to convince a
Chen, XF Chen, Xiaofeng   +2 more
openaire   +1 more source

Development of the algorithm coding alphabet by points of the elliptic curve

open access: yesНаука. Инновации. Технологии, 2022
The paper describes the encryption algorithm alphabet by elliptic curve point with using operations of bilinear pairing.
Michail Grigorievich Babenko   +2 more
doaj  

Home - About - Disclaimer - Privacy