5. PKC 2002: Paris, France

@proceedings{DBLP:conf/pkc/2002,
  editor    = {David Naccache and
               Pascal Paillier},
  title     = {Public Key Cryptography, 5th International Workshop on Practice
               and Theory in Public Key Cryptosystems, PKC 2002, Paris, France,
               February 12-14, 2002, Proceedings},
  booktitle = {Public Key Cryptography},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2274},
  year      = {2002},
  isbn      = {3-540-43168-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Encryption Schemes

• Kouichi Sakurai, Tsuyoshi Takagi:
  New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive. 1-16
  
• Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen:
  Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages. 17-33
  
• Takeshi Koshiba:
  On Sufficient Randomness for Secure Public-Key Cryptosystems. 34-47
  
• Kaoru Kurosawa:
  Multi-recipient Public-Key Encryption with Shortened Ciphertext. 48-63
  

Signature Schemes

• Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hideki Imai:
  Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code. 64-79
  
• Joonsang Baek, Ron Steinfeld, Yuliang Zheng:
  Formal Proofs for the Security of Signcryption. 80-98
  
• Greg Maitland, Colin Boyd:
  A Provably Secure Restrictive Partially Blind Signature Scheme. 99-114
  

Protocols I

• Masayuki Abe, Koutarou Suzuki:
  M+1-st Price Auction Using Homomorphic Encryption. 115-124
  
• Ivan Damgård, Mads Jurik:
  Client/Server Tradeoffs for Online Elections. 125-140
  
• Aggelos Kiayias, Moti Yung:
  Self-tallying Elections and Perfect Ballot Secrecy. 141-158
  

Protocols II

• Wen-Guey Tzeng:
  Efficient 1-Out-n Oblivious Transfer Schemes. 159-171
  
• Kaoru Kurosawa, Takuya Yoshida:
  Linear Code Implies Public-Key Traitor Tracing. 172-187
  
• Chan H. Lee, Xiaotie Deng, Huafei Zhu:
  Design and Security Analysis of Anonymous Group Identification Protocols. 188-198
  
• Michaël Quisquater, Bart Preneel, Joos Vandewalle:
  On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem. 199-210
  

Cryptanalysis

• Nicolas Courtois, Louis Goubin, Willi Meier, Jean-Daniel Tacier:
  Solving Underdefined Systems of Multivariate Quadratic Equations. 211-227
  
• Arjen K. Lenstra, Igor Shparlinski:
  Selective Forgery of RSA Signatures with Fixed-Pattern Padding. 228-236
  
• Kazukuni Kobara, Hideki Imai:
  New Chosen-Plaintext Attacks on the One-Wayness of the Modified McEliece PKC Proposed at Asiacrypt 2000. 237-251
  

Side Channels

• Roman Novak:
  SPA-Based Adaptive Chosen-Ciphertext Attack on RSA Implementation. 252-262
  
• Werner Schindler:
  A Combined Timing and Power Attack. 263-279
  
• Tetsuya Izu, Tsuyoshi Takagi:
  A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks. 280-296
  

Invited Talk

• Bart Preneel:
  New European Schemes for Signature, Integrity and Encryption (NESSIE): A Status Report. 297-309
  

ECC Implementations

• Young-Ho Park, Sangho Oh, Sangjin Lee, Jongin Lim, Maenghee Sung:
  An Improved Method of Multiplication on Certain Elliptic Curves. 310-322
  
• Young-Ho Park, Sangtae Jeong, Chang Han Kim, Jongin Lim:
  An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. 323-334
  
• Eric Brier, Marc Joye:
  Weierstraß Elliptic Curves and Side-Channel Attacks. 335-345
  

Applications

• Marc Joye, Sung-Ming Yen:
  One-Way Cross-Trees and Their Applications. 346-356
  
• Ari Juels, Jorge Guajardo:
  RSA Key Generation with Verifiable Randomness. 357-374
  
• Marc Joye, Sung-Ming Yen:
  New Minimal Modified Radix-r Representation with Applications to Smart Cards. 375-384