7. PKC 2004: Singapore

• Johannes Blömer, Alexander May:
  A Generalized Wiener Attack on RSA. 1-13
  
• Jean-Sébastien Coron:
  Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem. 14-27
  
• Roberto Maria Avanzi, Mathieu Ciet, Francesco Sica:
  Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism. 28-40
  
• Pradeep Kumar Mishra, Palash Sarkar:
  Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point. 41-54
  
• Stéphane Flon, Roger Oyono:
  Fast Arithmetic on Jacobians of Picard Curves. 55-68
  
• Jean Monnerat, Serge Vaudenay:
  Undeniable Signatures Based on Characters: How to Sign with One Bit. 69-85
  
• Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk:
  Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures. 86-100
  
• Huafei Zhu:
  Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model. 101-114
  
• Emmanuel Bresson, Dario Catalano:
  Constant Round Authenticated Group Key Agreement via Distributed Computation. 115-129
  
• Kyu Young Choi, Jung Yeon Hwang, Dong Hoon Lee:
  Efficient ID-based Group Key Agreement with Bilinear Maps. 130-144
  
• Emmanuel Bresson, Olivier Chevassut, David Pointcheval:
  New Security Results on Encrypted Key Exchange. 145-158
  
• Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski:
  New Results on the Hardness of Diffie-Hellman Bits. 159-172
  
• Takeshi Koshiba, Kaoru Kurosawa:
  Short Exponent Diffie-Hellman Problems. 173-186
  
• Benoît Libert, Jean-Jacques Quisquater:
  Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups. 187-200
  
• Nicolas Courtois:
  Algebraic Attacks over GF(2^k), Application to HFE Challenge 2 and Sflash-v2. 201-217
  
• Alexander May:
  Secret Exponent Attacks on RSA-type Schemes with Moduli N= p^rq. 218-230
  
• Reihaneh Safavi-Naini, Luke McAven, Moti Yung:
  General Group Authentication Codes and Their Relation to "Unconditionally-Secure Signatures". 231-247
  
• Kaoru Kurosawa, Swee-Huay Heng:
  From Digital Signature to ID-based Identification/Signature. 248-261
  
• Joonsang Baek, Yuliang Zheng:
  Identity-Based Threshold Decryption. 262-276
  
• Fangguo Zhang, Reihaneh Safavi-Naini, Willy Susilo:
  An Efficient Signature Scheme from Bilinear Pairings and Its Applications. 277-290
  
• Ryotaro Hayashi, Tatsuaki Okamoto, Keisuke Tanaka:
  An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications. 291-304
  
• Jintai Ding:
  A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation. 305-318
  
• Jun Furukawa:
  Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability. 319-332
  
• Brian King:
  A Point Compression Method for Elliptic Curves Defined over GF(2 n). 333-345
  
• Toru Akishita, Tsuyoshi Takagi:
  On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny. 346-359
  
• Rui Zhang, Goichiro Hanaoka, Junji Shikata, Hideki Imai:
  On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? 360-374
  
• Farid F. Elwailly, Craig Gentry, Zulfikar Ramzan:
  QuasiModo: Efficient Certificate Validation and Revocation. 375-388
  
• Satoshi Koga, Kouichi Sakurai:
  A Distributed Online Certificate Status Protocol with a Single Public Key. 389-401
  
• Vicente Benjumea, Javier Lopez, José A. Montenegro, José M. Troya:
  A First Approach to Provide Anonymity in Attribute Certificates. 402-415
  
• Igor Shparlinski, Arne Winterhof:
  A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. 416-424
  
• Andris Ambainis, Markus Jakobsson, Helger Lipmaa:
  Cryptographic Randomized Response Techniques. 425-438
  
• Kun Peng, Colin Boyd, Ed Dawson, Kapalee Viswanathan:
  A Correct, Private, and Efficient Mix Network. 439-454
  

Last update Wed May 22 16:20:28 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page