Sciweavers

3702 search results - page 1 / 741
» All Pairings Are in a Group
Sort
View
IEICET
2008
76views more  IEICET 2008»
13 years 5 months ago
All Pairings Are in a Group
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
Changan Zhao, Fangguo Zhang, Jiwu Huang
IJNSEC
2007
122views more  IJNSEC 2007»
13 years 5 months ago
Group Oriented Identity-based Deniable Authentication Protocol from the Bilinear Pairings
Deniable authentication protocol is different from traditional authentication protocol in that the intended receiver can authenticate the source of a given message, but cannot pr...
Rongxing Lu, Zhenfu Cao
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
13 years 11 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
TIT
2010
108views Education» more  TIT 2010»
13 years 1 days ago
Optimal pairings
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
Frederik Vercauteren