Abstract is missing.
- An Analysis of Affine Coordinates for Pairing ComputationKristin Lauter, Peter L. Montgomery, Michael Naehrig. 1-20 [doi]
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig CurvesJean-Luc Beuchat, Jorge E. González-Díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, Tadanori Teruya. 21-39 [doi]
- Some Security Topics with Possible Applications for Pairing-Based CryptographyGene Tsudik. 40 [doi]
- A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange - (Extended Abstract)Qiong Huang, Duncan S. Wong, Willy Susilo. 41-61 [doi]
- Anonymizable Signature and Its Construction from PairingsFumitaka Hoshino, Tetsutaro Kobayashi, Koutarou Suzuki. 62-77 [doi]
- Identification of Multiple Invalid Pairing-Based Signatures in Constrained BatchesBrian J. Matt. 78-95 [doi]
- Oblivious Transfer with Access Control : Realizing Disjunction without DuplicationYe Zhang, Man Ho Au, Duncan S. Wong, Qiong Huang, Nikos Mamoulis, David W. Cheung, Siu-Ming Yiu. 96-115 [doi]
- Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store SharesKoen Simoens, Roel Peeters, Bart Preneel. 116-135 [doi]
- Shorter Verifier-Local Revocation Group Signature with Backward UnlinkabilityLingbo Wei, Jianwei Liu. 136-146 [doi]
- Strongly Secure Two-Pass Attribute-Based Authenticated Key ExchangeKazuki Yoneyama. 147-166 [doi]
- Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key AgreementDario Fiore, Rosario Gennaro, Nigel P. Smart. 167-186 [doi]
- Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master KeysAtsushi Fujioka, Koutarou Suzuki, Berkant Ustaoglu. 187-205 [doi]
- Pairing-Based Non-interactive Zero-Knowledge ProofsJens Groth. 206 [doi]
- Designing a Code Generator for Pairing Based Cryptographic FunctionsLuis J. Dominguez Perez, Michael Scott. 207-224 [doi]
- Efficient Generic Constructions of Timed-Release Encryption with Pre-open CapabilityTakahiro Matsuda 0002, Yasumasa Nakai, Kanta Matsuura. 225-245 [doi]
- Optimal Authenticated Data Structures with Multilinear FormsCharalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos. 246-264 [doi]
- Deterministic Encoding and Hashing to Odd Hyperelliptic CurvesPierre-Alain Fouque, Mehdi Tibouchi. 265-277 [doi]
- Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial TimeJean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault. 278-297 [doi]
- A New Method for Constructing Pairing-Friendly Abelian SurfacesRobert Drylo. 298-311 [doi]
- Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic CurvesEzekiel J. Kachisa. 312-326 [doi]
- New Identity-Based Proxy Re-encryption Schemes to Prevent Collusion AttacksLihua Wang, Licheng Wang, Masahiro Mambo, Eiji Okamoto. 327-346 [doi]
- Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short CiphertextsAngelo De Caro, Vincenzo Iovino, Giuseppe Persiano. 347-366 [doi]
- Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffie-HellmanDavid Galindo. 367-376 [doi]
- A Survey of Local and Global Pairings on Elliptic Curves and Abelian VarietiesJoseph H. Silverman. 377-396 [doi]
- Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular CurvesNicolas Estibals. 397-416 [doi]
- A Variant of Miller s Formula and AlgorithmJohn Boxall, Nadia El Mrabet, Fabien Laguillaumie, Duc-Phong Le. 417-434 [doi]
- Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding DegreeSorina Ionica, Antoine Joux. 435-449 [doi]
- High Speed Flexible Pairing Cryptoprocessor on FPGA PlatformSantosh Ghosh, Debdeep Mukhopadhyay, Dipanwita Roy Chowdhury. 450-466 [doi]