Results 201 to 210 of about 10,318 (256)

Verifying self-organized storage with bilinear pairings

, 2007
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Bilinear Pairing Based DAA Protocol

2009 International Conference on Computational Intelligence and Natural Computing, 2009
Direct Anonymous Attestation (DAA) is adopted by the Trusted Platform Module (TPM) of v1.2 standard described by the Trusted Computing Group (TCG), aimed at settling protocols for trusted platform attestation and platform privacy protection. This paper gives a presentation of the new DAA protocol based on bilinear pairings and an analysis of its ...
Hong-hu Zhen, Yue Chen
openaire   +1 more source

Fast Software Implementations of Bilinear Pairings

IEEE Transactions on Dependable and Secure Computing, 2017
Advancement in pairing-based protocols has had a major impact on the applicability of cryptography to the solution of more complex real-world problems. However, the computation of pairings in software still needs to be optimized for different platforms including emerging embedded systems and high-performance PCs.
Reza Azarderakhsh, Dieter Fishbein, Gurleen Grewal, Shi Hu, David Jao, Patrick Longa, Rajeev Verma   +6 more
openaire   +1 more source

Signature scheme based on bilinear pairs

SPIE Proceedings, 2013
An identity-based signature scheme is proposed by using bilinear pairs technology. The scheme uses user’s identity information as public key such as email address, IP address, telephone number so that it erases the cost of forming and managing public key infrastructure and avoids the problem of user private generating center generating forgery ...
Rui Y. Tong, Yong J. Geng
openaire   +1 more source

Optimal Evaluation of Pairs of Bilinear Forms

SIAM Journal on Computing, 1978
A large class of multiplication problems in arithmetic complexity can be viewed as the simultaneous evaluation of a set of bilinear forms. This class includes the multiplication of matrices, polynomials, quaternions, Cayley and complex numbers. Considering bilinear algorithms, the optimal number of non-scalar multiplications can be described as the ...
openaire   +2 more sources

Idetity based group key agreement from bilinear pairing

Wuhan University Journal of Natural Sciences, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Liming, Wu, Chuankun
openaire   +1 more source

Efficient Group Signatures from Bilinear Pairing

2005
This paper presents two types of group signature schemes from bilinear pairings: the mini type and the improved type. The size of the group public keys and the length of the signatures in both schemes are constant. An on-line third party is introduced to help the schemes to realize the “join” of group members, the “opening” of group signatures, and the
Xiangguo Cheng, Huafei Zhu, Ying Qiu, Xinmei Wang   +3 more
openaire   +1 more source

Efficient Certificate-Based Signcryption Scheme from Bilinear Pairings

International Journal of Computers and Applications, 2008
Signcryption is a public key cryptographic primitive that performs digital signature and public key encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryption approach. In this paper, an efficient certificate-based signcryption scheme based on bilinear pairings is proposed.
F. Li, X. Xin, Y. Hu
openaire   +1 more source

Invariant Bilinear Pairing for Twistor Spinors

Advances in Applied Clifford Algebras, 2009
It is proved in [5] that one can manufacture (conformal) Killing forms from (conformal) twistor spinors on any Riemannian Spin-manifold. We shall prove that this procedure can be realized in the framework of a cup product on twistor spinors in the Bernstein-Gelfand-Gelfand sequence associated to conformal geometry induced from the Riemannian structure.
openaire   +1 more source

Certificateless Group Signature Scheme from Bilinear Pairings

Proceedings of the 2017 2nd International Conference on Communication and Information Systems, 2017
Certificateless public key cryptography solve the certificate management problems of the traditional public key cryptography, also overcomes the problems public key escrow in identity based cryptography.A group signature scheme allows a group member to sign messages anonymously on behalf of the group.This paper introduces a certificateless group ...
Chen Yameng, Cheng Xiangguo
openaire   +1 more source