Public Key Cryptography – PKC 2004: 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004. Proceedings

This book constitutes the refereed proceedings of the 7th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2004, held in Singapore in March 2004. The 32 revised full papers presented were carefully reviewed and selected from 106 submissions. All current issues in public key cryptography are addressed ranging from theoretical and mathematical foundations to a broad variety of public key cryptosystems. Front Matter....Pages - A Generalized Wiener Attack on RSA....Pages 1-13 Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem....Pages 14-27 Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism....Pages 28-40 Application of Montgomery’s Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point....Pages 41-54 Fast Arithmetic on Jacobians of Picard Curves....Pages 55-68 Undeniable Signatures Based on Characters: How to Sign with One Bit....Pages 69-85 Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures....Pages 86-100 Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model....Pages 101-114 Constant Round Authenticated Group Key Agreement via Distributed Computation....Pages 115-129 Efficient ID-based Group Key Agreement with Bilinear Maps....Pages 130-144 New Security Results on Encrypted Key Exchange....Pages 145-158 New Results on the Hardness of Diffie-Hellman Bits....Pages 159-172 Short Exponent Diffie-Hellman Problems....Pages 173-186 Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups....Pages 187-200 Algebraic Attacks over GF (2 k ), Application to HFE Challenge 2 and Sflash-v2....Pages 201-217 Secret Exponent Attacks on RSA-type Schemes with Moduli N = p r q ....Pages 218-230 General Group Authentication Codes and Their Relation to “Unconditionally-Secure Signatures”....Pages 231-247 From Digital Signature to ID-based Identification/Signature....Pages 248-261 Identity-Based Threshold Decryption....Pages 262-276 An Efficient Signature Scheme from Bilinear Pairings and Its Applications....Pages 277-290 An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications....Pages 291-304 A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation....Pages 305-318 Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability....Pages 319-332 A Point Compression Method for Elliptic Curves Defined over GF (2 n )....Pages 333-345 On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny....Pages 346-359 On the Security of Multiple Encryption or CCA -security+ CCA -security= CCA -security?....Pages 360-374 QuasiModo: Efficient Certificate Validation and Revocation....Pages 375-388 A Distributed Online Certificate Status Protocol with a Single Public Key....Pages 389-401 A First Approach to Provide Anonymity in Attribute Certificates....Pages 402-415 A Nonuniform Algorithm for the Hidden Number Problem in Subgroups....Pages 416-424 Cryptographic Randomized Response Techniques....Pages 425-438 A Correct, Private, and Efficient Mix Network....Pages 439-454 Back Matter....Pages - Let N = pq be an RSA-modulus, where p and q are primes of equal bit-size (wlog p > q).