Results 181 to 190 of about 618 (230)

On Some Bilinear Forms as ”Pairings”

On Some Bilinear Forms as ”Pairings”
openaire  

Delegated multi-party private set intersections from extendable output functions. [PDF]

PeerJ Comput Sci
Bay A.
europepmc   +1 more source

A certificateless aggregate signature scheme for VANETs with privacy protection properties. [PDF]

PLoS One
Li H, Shen C, Huang H, Wu C.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

ID-Based Aggregate Signatures from Bilinear Pairings

Lecture Notes in Computer Science, 2005
Aggregate signature scheme was recently proposed by Boneh, Gentry, Lynn and Shacham, which presented a method for combining n signatures from n different signers on n different messages into one signature. In this paper, we propose an identity-based aggregate signature scheme based on the bilinear pairings. This enhances the efficiency of communication
Feng Dengguo, Zhang Zhenfeng
exaly   +2 more sources

Automated Proofs of Signatures using Bilinear Pairings

2018 16th Annual Conference on Privacy, Security and Trust (PST), 2018
In this paper, we extend an automated proof-generation tool, AutoG& P with new axioms and formalizations to support composite data types and q-type assumptions, which in turn can be used to automate pairing-based signature schemes. AutoG& P due to Barthe et at.
Guruprasad Eswaraiah, Roopa Vishwanathan, Douglas Nedza   +2 more
openaire   +1 more source

Short Signature from the Bilinear Pairing

2010
Short digital signatures are essential to ensure the authenticity of messages in low-bandwidth communication channels and are used to reduce the communication complexity of any transmission. A new short signature scheme based on the bilinear pairing in the standard model is introduced. The proposed scheme has short public parameters and the size of the
Leyou Zhang, Yupu Hu, Qing Wu 0005
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

Pairs of Bilinear Equations in a Finite Field

Canadian Journal of Mathematics, 1966
Let F = GF(g) be the finite field of q = pr elements, p arbitrary. We wish to consider the system of bilinear equations1.1where all coefficients are from F. The number of solutions in F of a single bilinear equation may be obtained from a theorem of John H. Hodges (3, Theorem 3) by properly defining the matrices U, V, A, B. In 1954, L.
openaire   +2 more sources

An undeniable strong DSVS scheme with no bilinear pairings

2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI), 2016
Undeniability is an essential security property of the traditional digital signature. Strong designated verifier signature(DSVS) is a special digital signature in where the validity of a signature can only be checked by the designated verifier. However, most strong DSVS schemes do not have the undeniability property which leads to dispute between a ...
Xiaoming Hu 0002, Chuang Ma, Jian Wang 0028, Huajie Xu, WenAn Tan   +4 more
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