Results 211 to 220 of about 10,318 (256)

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

Efficient designated confirmer signature from bilinear pairings

Proceedings of the 2008 ACM symposium on Information, computer and communications security, 2008
Designated confirmer signature is an important cryptographic primitive, it is widely used in E-commerce. In this paper, we propose a new designated confirmer signature scheme which is transformed from a new signature scheme. The proposed scheme has very simple construction and is much more efficient than the previous ones and does not need any ...
Fangguo Zhang, Xiaofeng Chen, Baodian Wei   +2 more
openaire   +1 more source

Certificateless Short Signature Scheme from Bilinear Pairings

Applied Mechanics and Materials, 2013
Certificateless short signature schemes can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However, all existing certificateless short signature schemes only proven secure against a normal adversary which can only obtain the valid signature for the original public key rather than a ...
Shu Rong Feng, Jiao Mo, Hua Zhang, Zheng Ping Jin   +3 more
openaire   +1 more source

Group key agreement from bilinear pairings

2013
The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current literature.
openaire   +2 more sources