نتایج جستجو برای: bilinear pairing

تعداد نتایج: 34449  

Journal: :IACR Cryptology ePrint Archive 2006
Xianhui Lu Dake He Guomin Li

We construct an efficient identity based encryption scheme from pairing. The basic version of the new scheme is provably secure against chosen plaintext attack, and the full version of the new scheme is provably secure against adaptive chosen ciphertext attack. Our scheme is based on a new assumption (decision weak bilinear Diffie-Hellman assumption ) which is no stronger than decision bilinear...

2009

The theory has one formulation in terms of real inner product spaces and one in terms of complex Hermitian spaces. In fact the real case is naturally encompassed by the complex case. But since the real case is so often used, we will give both formulations starting with the real case. Let V be a real vector space. A real pairing 〈·, ·〉 on V , 〈·, ·〉 : V × V → R, (~v, ~ w) 7→ 〈~v, ~ w〉 is symmetr...

Journal: :IACR Cryptology ePrint Archive 2012
Jae Hong Seo Jung Hee Cheon

At Eurocrypt 2010, Freeman proposed a transformation from pairing-based schemes in composite-order bilinear groups to equivalent ones in prime-order bilinear groups. His transformation can be applied to pairing-based cryptosystems exploiting only one of two properties of composite-order bilinear groups: cancelling and projecting. At Asiacrypt 2010, Meiklejohn, Shacham, and Freeman showed that p...

Journal: :IACR Cryptology ePrint Archive 2012
Takuya Hayashi Takeshi Shimoyama Naoyuki Shinohara Tsuyoshi Takagi

There are many useful cryptographic schemes, such as ID-based encryption, short signature, keyword searchable encryption, attribute-based encryption, functional encryption, that use a bilinear pairing. It is important to estimate the security of such pairing-based cryptosystems in cryptography. The most essential number-theoretic problem in pairing-based cryptosystems is the discrete logarithm ...

Journal: :IACR Cryptology ePrint Archive 2009
Ernie Brickell Jiangtao Li

Enhanced Privacy ID (EPID) is a cryptographic scheme that enables the remote authentication of a hardware device while preserving the privacy of the device. EPID can be seen as a direct anonymous attestation scheme with enhanced revocation capabilities. In EPID, a device can be revoked if the private key embedded in the hardware device has been extracted and published widely so that the revocat...

2008
JENS KROESKE

In this paper the notion of an M -th order invariant bilinear differential pairing is introduced and a formal definition is given. If the manifold has an AHS structure, then various first order pairings are constructed. This yields a classification of all first order invariant bilinear differential pairings on homogeneous spaces with an AHS structure except for certain totally degenerate cases....

2013
Geoffrey MASON Gaywalee YAMSKULNA

This paper concerns the algebraic structure of finite-dimensional complex Leibniz algebras. In particular, we introduce left central and symmetric Leibniz algebras, and study the poset of Lie subalgebras using an associative bilinear pairing taking values in the Leibniz kernel.

Journal: :Int. J. Communication Systems 2010
Debiao He J. Chen R. Zhang

Many certificateless 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 improve the performance we propose a certificateless signature scheme without bilinear pairings. With the running time being saved greatly, our scheme...

Journal: :IACR Cryptology ePrint Archive 2005
David Freeman

We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification scheme.

2013
Allison Bishop Sarah Meiklejohn

Composite-order bilinear groups provide many structural features that are useful for both constructing cryptographic primitives and enabling security reductions. Despite these convenient features, however, composite-order bilinear groups are less desirable than prime-order bilinear groups for reasons of both efficiency and security. A recent line of work has therefore focused on translating the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید