Technical Program

Also available for download as a PDFPDF file.

Monday, December 13, 2010
 
09:00 – 10:00 Registration
10:00 – 10:10 Opening remarks
 
Session 1 – Efficient software implementation
Chair: Christophe Ritzenthaler
10:10 – 10:35 An Analysis of Affine Coordinates for Pairing Computation
Kristin Lauter, Peter L. Montgomery, and Michael Naehrig
10:35 – 11:00 High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
Jean-Luc Beuchat, Jorge E. Gonzalez-Diaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, and Tadanori Teruya
 
Keynote talk I
Chair: Akira Otsuka
11:00 – 12:00 Some Security Topics with Possible Applications for Pairing-Based Cryptography
Gene Tsudik
 
12:00 – 14:00 Lunch and Excursion (Writing and enjoying Japanese poetry -Haiku-) at Basho-no-Yakata Museum
 
Session 2 – Digital signatures
Chair: Fabien Laguillaumie
14:00 – 14:25 A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange
Qiong Huang, Duncan S. Wong, and Willy Susilo
14:25 – 14:50 Anonymizable Signature and its Construction from Pairings
Fumitaka Hoshino, Tetsutaro Kobayashi, and Koutarou Suzuki
14:50 – 15:15 Identification of Multiple Invalid Pairing-based Signatures in Constrained Batches
Brian J. Matt
 
15:15 – 15:45 Coffee break
 
Session 3 – Cryptographic protocols
Chair: Brian Matt
15:45 – 16:10 Oblivious Transfer with Access Control: Realizing Disjunction without Duplication
Ye Zhang, Man Ho Au, Duncan S. Wong, Qiong Huang, Nikos Mamoulis, David W. Cheung, and Siu-Ming Yiu
16:10 – 16:35 Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices that Cannot Store Shares
Koen Simoens, Roel Peeters, and Bart Preneel
16:35 – 17:00 Shorter Verifier-Local Revocation Group Signature with Backward Unlinkability
Lingbo Wei and Jianwei Liu
 
19:00 – 21:00 Dinner with "Noh" and "Kyogen" at Yamanaka-za
 
 
Tuesday, December 14, 2010
 
09:00 – 09:15 Registration
 
Session 4 – Key agreement
Chair: Katsuyuki Takashima
09:15 – 09:40 Strongly Secure Two-Pass Attribute-based Authenticated Key Exchange
Kazuki Yoneyama
09:40 – 10:05 Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
Dario Fiore, Rosario Gennaro, and Nigel P. Smart
10:05 – 10:30 Ephemeral Key Leakage Resilient and Efficient ID-AKEs that can Share Identities, Private and Master Keys
Atsushi Fujioka, Koutarou Suzuki, and Berkant Ustaoglu
 
10:30 – 11:00 Coffee break
 
Keynote talk II
Chair: Marc Joye
11:00 – 12:00 Pairing-Based Non-interactive Zero-Knowledge Proofs (PPS) (PDF)
Jens Groth
 
12:00 – 14:00 Lunch and Excursion (Tea Ceremony) at Mugen-an
 
Session 5 – Applications: code generation, time-released encryption, cloud computing
Chair: David Galindo
14:00 – 14:25 Designing a Code Generator for Pairing Based Cryptographic Functions
Luis J. Dominguez Perez and Michael Scott
14:25 – 14:50 Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability
Takahiro Matsuda, Yasumasa Nakai, and Kanta Matsuura
14:50 – 15:15 Optimal Authenticated Data Structures with Multilinear Forms
Charalampos Papamanthou, Roberto Tamassia, and Nikos Triandopoulos
 
15:15 – 15:45 Coffee break
 
Session 6 – Point encoding & Pairing-friendly curves
Chair: Michael Naehrig
15:45 – 16:10 Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
Pierre-Alain Fouque and Mehdi Tibouchi
16:10 – 16:35 Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
Jean-Gabriel Kammerer, Reynald Lercier, and Guénaël Renault
16:35 – 17:00 A New Method for Constructing Pairing-Friendly Abelian Surfaces
Robert Drylo
17:00 – 17:35 Generating more Kawazoe-Takahashi Genus 2 Pairing-friendly Hyperelliptic Curves
Ezekiel J. Kachisa
 
19:00 – 21:00 Dinner at Kajikaso Royal Hotel
 
 
Wednesday, December 15, 2010
 
09:00 – 09:15 Registration
 
Session 7 – ID-based encryption schemes
Chair: Phong Nguyen
09:15 – 09:40 New Identity-Based Proxy Re-Encryption Schemes to Prevent Collusion Attacks
Lihua Wang, Licheng Wang, Masahiro Mambo and Eiji Okamoto
09:40 – 10:05 Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts
Angelo De Caro, Vincenzo Iovino, and Giuseppe Persiano
10:05 – 10:30 Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffe-Hellman
David Galindo
 
10:30 – 11:00 Coffee break
 
Keynote talk III
Chair: Atsuko Miyaji
11:00 – 12:00 A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties (PDF)
Joseph H. Silverman
 
12:00 – 13:30 Lunch
 
Session 8 – Efficient Hardware, FPGAs, and algorithms
Chair: Katsuyuki Okeya
13:30 – 13:55 Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves
Nicolas Estibals
13:55 – 14:20 A Variant of Miller's Formula and Algorithm
John Boxall, Nadia El Mrabet, Fabien Laguillaumie, and Duc-Phong Le
14:20 – 14:45 Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Sorina Ionica and Antoine Joux
14:45 – 15:10 High Speed Flexible Pairing Cryptoprocessor on FPGA Platform
Santosh Ghosh, Debdeep Mukhopadhyay, and Dipanwita Roy Chowdhury
 
15:10 – 15:20 Closing remarks
www.000webhost.com