PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
A proxy re-encryption system allows the proxy to transform ciphertexts encrypted under Alice’s public key into the different ciphertexts that can be decrypted by Bob’s secret ...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptograph...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we describe an efficient implementation of the Tate and Ate pairings using Barreto-Naehrig pairing-friendly curves, on both a standard 32-bit PC and on a 32-bit smart...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is c...