Results 201 to 210 of about 30,753 (229)

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

Two Threshold Multisignature Schemes from Bilinear Pairings

2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07), 2007
Threshold multisignature combines the traits of threshold signature and multisignature. It solves the problem that any t users can impersonate other t users' signatures in threshold signature. Identity-based public key systems allow the user to use his identity as the public key, which can simplify the key management procedure compared with CA-based ...
Guowen Li, Jia Yu, Rupeng Li, Daxing Li
openaire   +1 more source

Certificate-based blind signatures from bilinear pairings

The 2nd International Conference on Information Science and Engineering, 2010
Certificate-based public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user's public key in the traditional public key cryptography and to overcome the key escrow problem in the identity-based public key cryptography.
Zhenjie Huang, Qunshan Chen, null Yanhua Hao   +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
openaire   +1 more source

Robust Certificateless Signature Scheme without Bilinear Pairings

2013 International Conference on IT Convergence and Security (ICITCS), 2013
During these years, the research field of certificateless signature (CLS) scheme without bilinear pairings is promptly investigated as the key escrow problem in identity-based cryptography can be solved via this concept. In this paper, we demonstrate that a certificateless signature scheme proposed by Gong and Li cannot fulfil its security claims.
Kuo-Hui Yeh, Kuo-Yu Tsai, Ren-Zong Kuo, Tzong-Chen Wu   +3 more
openaire   +1 more source

Accumulators from Bilinear Pairings and Applications

2005
We propose a dynamic accumulator scheme from bilinear pairings and use it to construct an identity-based (ID-based) ring signature scheme with constant-size signatures and to provide membership revocation to group signature schemes, identity escrow schemes and anonymous credential systems.
openaire   +1 more source

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

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