نتایج جستجو برای: bilinear pairing
تعداد نتایج: 34449 فیلتر نتایج به سال:
With various applications of Weil pairing (Tate pairing) to cryptography, ID-based encryption schemes, digital signature schemes, blind signature scheme, two-party authenticated key agreement schemes, and tripartite key agreement scheme were proposed recently, all of them using bilinear pairing (Weil or Tate pairing). In this paper, we propose an ID-based one round authenticated tripartite key ...
For an elliptic curve E over any field K, the Weil pairing en is a bilinear map on n-torsion. For K of characteristic p > 0, the map en is degenerate if and only if n is divisible by p. In this paper, we consider E over the dual numbers K[ ] and define a non-degenerate “Weil pairing on p-torsion” which shares many of the same properties of the Weil pairing. We also show that the discrete logari...
Outsourcing paradigm has become a hot research topic in the cryptography community, where computation workloads can be outsourced to cloud servers by the resource-constrained devices, such as RFID tags. The computation of bilinear pairings is the most expensive operation in pairing-based cryptographic primitives. In this paper, we present two new algorithms for secure outsourcing the computatio...
Certificateless cryptosystems were proposed by Al-Riyami and Paterson in 2003 [1] to solve problems of public key cryptosystems based on PKI and based on identity. Up to now, various types of certificateless cryptographic primitives as encryption functions, signature schemes, key agreement protocols and etc, have been designed. But to the best of our knowledge, multiple-key agreement protocols ...
ID-based encryption allows for a sender to encrypt a message to an identity without access to a public key certificate. Based on the bilinear pairing, Boneh and Franklin proposed the first practical IDbased encryption scheme and used the padding technique of FujisakiOkamto to extend it to be a chosen ciphertext secure version. In this letter, we would like to use another padding technique to pr...
Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose an identity based signature scheme without bilinear pairings. With both the run...
For an elliptic curve E over any field K, the Weil pairing en is a bilinear map on n-torsion. For K of characteristic p > 0, the map en is degenerate if and only if n is divisible by p. In this paper, we consider E over the dual numbers K[ǫ] and define a non-degenerate “Weil pairing on ptorsion” which shares many of the same properties of the Weil pairing. We also show that the discrete logarit...
Structure-preserving signatures are signatures whose public keys, messages, and signatures are all group elements in bilinear groups, and the verification is done by evaluating pairing product equations. It is known that any structure-preserving signature in the asymmetric bilinear group setting must include at least 3 group elements per signature and a matching construction exists. In this pap...
The bilinear pairings such as Weil pairing and Tate pairing on elliptic curves have recently found many applications in cryptography. The first efficient algorithm for computing pairing was originally proposed by Miller and much subsequent research has been directed at many different aspects in order to improve efficiency. In 2003, Eisenträger, Lauter and Montgomery proposed a new point-double-...
A dynamic threshold sharing scheme is one that allows the set of participants to expand and contract. In this work we discuss dynamic threshold decryption schemes using bilinear pairing. We discuss and analyze existing schemes, demonstrate an attack and construct a significantly more efficient secure scheme.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید