Results 191 to 200 of about 30,753 (229)

An efficient certificateless anonymous signcryption communication scheme for vehicular adhoc network. [PDF]

Sci Rep
Luo C, Li D, Khan MS.
europepmc   +1 more source

TPAAS: Trustworthy privacy-preserving anonymous authentication scheme for online trading environment. [PDF]

PLoS One
Rajasekaran AS, Maria A, Lloret J, Dannana S.   +3 more
europepmc   +1 more source

On Some Bilinear Forms as ”Pairings”

On Some Bilinear Forms as ”Pairings”
openaire  

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