Sciweavers

PAIRING
2010
Springer
149views Cryptology» more  PAIRING 2010»
13 years 10 months ago
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
Abstract. We discuss the relationship between ID-based key agreement protocols, certificateless encryption and ID-based key encapsulation mechanisms. In particular we show how in s...
Dario Fiore, Rosario Gennaro, Nigel P. Smart
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
13 years 10 months ago
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
Brian J. Matt
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 10 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
PAIRING
2010
Springer
147views Cryptology» more  PAIRING 2010»
13 years 11 months ago
Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves
Constructing pairing-friendly hyperelliptic curves with small ρ-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe...
Ezekiel J. Kachisa
PAIRING
2010
Springer
152views Cryptology» more  PAIRING 2010»
13 years 11 months ago
Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares
Threshold cryptography has been used to secure data and control access by sharing a private cryptographic key over different devices. This means that a minimum number of these dev...
Koen Simoens, Roel Peeters, Bart Preneel
PAIRING
2010
Springer
151views Cryptology» more  PAIRING 2010»
13 years 11 months ago
An Analysis of Affine Coordinates for Pairing Computation
Kristin Lauter, Peter L. Montgomery, Michael Naehr...
PAIRING
2010
Springer
179views Cryptology» more  PAIRING 2010»
13 years 11 months ago
Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hy...
Pierre-Alain Fouque, Mehdi Tibouchi
PAIRING
2010
Springer
237views Cryptology» more  PAIRING 2010»
13 years 11 months ago
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
Jean-Luc Beuchat, Jorge E. González-D&iacut...