PKC'09 Call for Participation
pk...@mothra.ics.uci.edu
PKC'09: CALL FOR PARTICIPATION
------------------------------
12th IACR International Conference on Practice and
Theory in Public Key Cryptography (PKC) 2009
March 18-20, 2009, Irvine, CA, USA
GENERAL INFORMATION:
--------------------
We invite your participation at PKC 2009, the 12th installment of the
International Association for Cryptologic Research (IACR) Conference
on Practice and Theory in Public Key Cryptography (PKC'09), which will
take place at UC Irvine, California, on March 18-20, 2009.
The PKC conference bridges the theory and practice of public key
cryptography. It is thus relevant to information security
practitioners as well as researchers in theoretical and applied
cryptography. The conference program includes interesting advances
in various aspects of public key cryptography, including:
cryptanalysis, computational hardness, public key encryption,
signature and authentication schemes as well as secure multi-party
protocols. (Please see below for the full conference program.)
INVITED TALKS:
--------------
PKC'09 program includes two invited talks, by Prof. Anna Lysyanskaya
(Brown University) and Prof. Amit Sahai (UCLA). Both invited speakers
have made numerous important contributions to modern cryptography. In
particular, Prof. Lysyanskaya has made a series of important
discoveries by developing cryptographic protocols that support
privacy-preserving transactions. Prof. Sahai has achieved prominent
results in zero-knowledge proofs, concurrent composition of
cryptographic protocols and attribute-based encryption schemes.
CONFERENCE REGISTRATION:
------------------------
The regular registration rate is $408 and the student registration is
only $204. Attendees are encouraged to register before March 1, 2009;
thereafter, a late fee of $50 will be added to all registrations.
The low registration rate was possible due to the generous support
from our industrial sponsors (Google, Microsoft Research, Qualcomm and
Experian) and academic units at UC Irvine: Bren School of Information
and Computer Sciences, California Institute for Telecommunications and
Information Technology (CalIT2) and Secure Computing and Networking
Center (SCONCE).
Conference registration includes a copy of conference proceedings,
lunches and coffee breaks, transportation between the UCI conference
venue and two select hotels, a banquet event, and an IACR fee for
year-long membership in IACR, the International Association for
Cryptologic Research, which includes on-line access to IACR conference
proceedings and a subscription to the IACR Journal of Cryptology. The
IACR fee (regular $88, student $44) is waived for all attendees who
attended another IACR-sponsored conference this year (FSE'09 or
TCC'09).
Conference registration can be done on-line at:
http://www.ics.uci.edu/~pkc09/register.html
ACCOMODATION AND VENUE INFORMATION:
-----------------------------------
PKC'09 will be hosted by the Bren School of Information and Computer
Sciences at the University of California, Irvine (UCI), in Irvine,
California. The meetings will take place at CalIT2, a
research center and a conference facility located next door to the
Bren School of ICS. UCI is located in Southern California,
a mere 10-minute drive from the beach, 10-minute drive from the
Santa Ana Airport (SNA) and a 50-minute drive from the Los Angeles
International Airport (LAX). Conference attendees can stay at
numerous hotels in the Irvine area; however, two nearby hotels offer
discount rates to conference attendees: Atrium Hotel ($104/day) and
Crowne Plaza ($116/day).
For more information about the venue and accommodations, see:
www.ics.uci.edu/~pkc09/local.html
For more information about travel to Irvine and UCI, see:
www.ics.uci.edu/~pkc09/travel.html
For general information about Irvine area, see:
www.ics.uci.edu/~pkc09/attractions.html
CONFERENCE PROGRAM:
-------------------
1. A practical Key Recovery Attack on Basic TCHo, by Gregor Leander
Technical University of Denmark; Mathias Herrmann, HGI,
Ruhr-University of Bochum
2. Implicit Factoring: On Polynomial Time Factoring Given Only an
Implicit Hint, by Alexander May and Maike Ritzenhofen, HGI,
Ruhr-University of Bochum
3. The security of All Bits Using List Decoding, by Carla Rafols and
Paz Morillo, Universitat Politecnica de Catalunya
4. Subset-Restricted Random Walks for Pollard rho Method on GF(p^m),
by Minkyu Kim, Jung Hee Cheon, and Jin Hong, Seul National
University
5. A New Lattice Construction for Partial Key Exposure Attack for RSA,
by Yoshinori Aono, Tokyo Institute of Technology
6. Fast Multibase Methods and Other Optimizations for Elliptic Curve
Scalar Multiplication, by Patrick Longa and Catherine Gebotys,
University of Waterloo
7. An Algebraic Surface Cryptosystem, by Koichiro Akiyama, Toshiba;
Yasuhiro Goto, Hokkaido University of Education; Hideyuki Miyake,
Toshiba
8. Signing a Linear Subspace: Signature Schemes for Network Coding, by
Dan Boneh, Stanford; David Freeman, CWI and Universiteit Leiden;
Jonathan Katz, University of Maryland; Brent Waters, University of
Texas at Austin
9. On the Theory and Practice of Personal Digital Signatures, by Ivan
Damgard and Gert Lassoe Mikkelsen, Aarhus University
10. Identification of Multiple Invalid Signatures in Pairing-based
Batched Signatures, by Brian J. Matt, John Hopkins University
11. Security of Blind Signatures Under Aborts, by Marc Fischlin and
Dominique Schroder, Darmstadt University of Technology
12. Security of Sanitizable Signatures Revisited, by Christina
Brzuska, Marc Fischlin, Tobias Freudenreich, Anja Lehmann, Marcus
Page, Jakob Schelbert, Dominique Schroder, and Florian Volk,
Darmstadt University of Technology Zero-Knowledge
13. Zero-Knowledge Proofs with Witness Elimination, by Aggelos Kiayias
and Hong-Sheng Zhou, University of Connecticut
14. Verifiable Rotation of Homomorphic Encryptions, by Sebastiaan de
Hoogh, Berry Schoenmakers, Boris Skoric, and Jose Villegas,
Technical University of Eindhoven
15. Compact CCA-Secure Encryption for Messages of Arbitrary Length, by
Masayuki Abe, NTT; Eike Kiltz, CWI; Tatsuaki Okamoto, NTT
16. CCA-Secure Proxy Re-Encryption without Pairings, by Jun Shao and
Zhenfu Cao, Shanghai Jiao Tong University
17. Towards Black-Box Accountable Authority IBE with Short Ciphertexts
and Private Keys, by Benoit Libert and Damien Vergnaud, UCL Crypto
Group and Ecole Normale Superieure
18. Anonymous Hierarchical Identity-Based Encryption with Constant
Size Ciphertexts, by Jae Hong Seo, Seoul National University;
Tetsutaro Kobayashi, Miyako Ohkubo, and Koutarou Suzuki, NTT Labs,
Tokyo
19. Blind and Anonymous Identity-Based Encryption and Authorized
Private Searches on Public-key Encrypted Data, by Jan Camenisch,
IBM Zurich; Markulf Kohlweiss and Alfredo Rial, Katholieke
Universitit Leuven; Caroline Sheedy, Dublin City University
20. Escrow-Free Identity-based Encryption, by Sherman S.M. Chow, New
York University
21. Modeling Key Compromise Impersonation Attacks on Group Key
Exchange Protocols, by M. Choudary Gorantla, Colin Boyd, and Juan
Manuel Gonzalez Nieto, Queensland University of Technology
22. Distributed Public-Key Cryptography from Weak Secrets, by Michel
Abdalla, ENS; Xavier Boyen, Stanford; Celine Chevalier, ENS; David
Pointcheval, ENS
23. Multi-Party Computation with Omnipresent Adversary, by Hossein
Ghodosi, James Cook University; Josef Pieprzyk, Macquarie
University
24. Asynchronous Multiparty Computation: Theory and Implementation, by
Ivan Damgard, Martin Geisler, Mikkel Kroigaard, and Jesper Buus
Nielsen, Aarhus University
25. An Accumulator Based on Bilinear Maps and Efficient Revocation for
Anonymous Credentials, by Jan Camenisch, IBM Zurich; Markulf
Kohlweiss, Katholieke Universiteit Leuven; Claudio Soriente,
University of California at Irvine
26. Revocable Group Signature Schemes with Constant Costs for Signing
and Verifying, by Toru Nakanishi, Hiroki Fujii, Yuta Hira, and
Nobuo Funabiki, Okayama University
27. Controlling Access to an Oblivious Database using Stateful
Anonymous Credentials, by Scott Coull, Matthew Green, and Susan
Hohenberger, Johns Hopkins University
28. Improving the Boneh-Franklin traitor tracing scheme, by Pascal
Junod, University of Applied Sciences - Western Switzerland;
Alexandre Karlov and Arjen K. Lenstra, EPFL, Switzerland
CONFERENCE ORGANIZATION:
-------------
Conference Chairs: Stanislaw Jarecki and Gene Tsudik, UC Irvine
Contact email: pkc09 [AT] ics.uci.edu
PROGRAM COMMITTEE:
------------------
Xavier Boyen Voltage Security, USA
Christian Cachin IBM Zurich, Switzerland
Jan Camenisch IBM Zurich, Switzerland
Jung Hee Cheon Seoul National U., South Korea
Jean-Sebastien Coron U. of Luxembourg, Luxembourg
Nelly Fazio CUNY, USA
Bao Feng i2R, Singapore
Juan Garay Lucent Bell Labs, USA
Rosario Gennaro IBM TJ Watson, USA
Amir Herzberg Bar Ilan University, Israel
Marc Joye Thompson R&D, France
Seny Kamara Microsoft Research, USA
Eike Kiltz CWI, The Netherlands
Javier Lopez University of Malaga, Spain
Breno de Medeiros Google, USA
David Naccache ENS, France
Jesper Buus Nielsen Aarhus University, Denmark
Kenny Paterson Royal Holloway, UK
Benny Pinkas University of Haifa, Israel
David Pointcheval CNRS, France
Ahmed Reza-Sadeghi Bochum University, Germany
Rei Safavi-Naini University of Calgary, Canada
Nitesh Saxena NYU Polytechnic Institute, USA
Berry Schoenmakers TU Eindhoven, The Netherlands
Hovav Shacham UCSD, USA
Vitaly Shmatikov UT Austin, USA
Igor Shparlinski Macquarie University, Australia
Michael Steiner IBM TJ Watson, USA
Serge Vaudenay EPFL, Switzerland
Ivan Visconti University of Salerno, Italy
Suzanne Wetzel Stevens Inst. of Technology, USA
PKC STEERING COMMITTEE:
-----------------------
Ronald Cramer CWI, The Netherlands
Yvo Desmedt University College London, UK
Hideki Imai AIST, Japan
David Naccache ENS, France
Tatsuyaki Okamoto NTT, Japan
Jacques Stern ENS, France
Moti Yung Google, USA
Yuliang Zheng UNCC, USA