Sciweavers

32 search results - page 1 / 7
» Secure Delegation of Elliptic-Curve Pairing
Sort
View
77
Voted
CARDIS
2010
Springer
168views Hardware» more  CARDIS 2010»
15 years 7 months ago
Secure Delegation of Elliptic-Curve Pairing
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...
Benoît Chevallier-Mames, Jean-Sébasti...
108
Voted
ICISC
2007
100views Cryptology» more  ICISC 2007»
15 years 1 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi
92
Voted
IEICET
2008
147views more  IEICET 2008»
15 years 12 days ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
123
Voted
ESORICS
2004
Springer
15 years 5 months ago
A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts ...
Bodo Möller
97
Voted
JOC
2010
106views more  JOC 2010»
14 years 10 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske