Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

IEICET
2008

favoriteEmaildiscussreport

76views more IEICET 2008»

All Pairings Are in a Group

13 years 4 months ago

All Pairings Are in a Group

Download eprint.iacr.org

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 up pairing computations. It is possible that our observation can be applied into other aspects of pairing-based cryptosystems.

Changan Zhao, Fangguo Zhang, Jiwu Huang

Real-time Traffic

Abstract Angle | IEICET 2008 | Pairing-based Cryptosystems | Short Miller |

claim paper

Related Content

» Group Oriented Identitybased Deniable Authentication Protocol from the Bilinear Pairings

» Bilinear Groups of Composite Order

» Accumulators from Bilinear Pairings and Applications

» Optimal pairings

» IdentityBased Threshold Proxy Signature from Bilinear Pairings

» Efficient Pairing Computation with Theta Functions

» On Compact Representations of AllPairsShortestPathDistance Matrices

» Harnessing parallelism in multicore clusters with the AllPairs Wavefront and Makeflow abst...

» Scaling up all pairs similarity search

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IEICET
Authors	Changan Zhao, Fangguo Zhang, Jiwu Huang

Comments (0)