Sciweavers

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

96

Voted

JCS
2010

58views more JCS 2010»

Computationally sound analysis of protocols using bilinear pairings

15 years 1 months ago

Computationally sound analysis of protocols using bilinear pairings

Download www.lsv.ens-cachan.fr

Steve Kremer, Laurent Mazaré

Real-time Traffic

JCS 2010 |

claim paper

Related Content

» Secure Bilinear DiffieHellman Bits

» An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three

» Security Analysis of Some Batch Verifying Signatures from Pairings

» A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness

» ProgressionFree Sets and Sublinear PairingBased NonInteractive ZeroKnowledge Arguments

» Computational soundness for key exchange protocols with symmetric encryption

» An Improvement on a Threeparty Passwordbased Key Exchange Protocol Using Weil Pairing

» Multiresolutions numerically from subdivisions

» Shake them up a movementbased pairing protocol for CPUconstrained devices

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JCS
Authors	Steve Kremer, Laurent Mazaré

Comments (0)