Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of pkc 2004
Preface and frontmatter
Page
Title
1-13
A Generalized Wiener Attack on RSA
14-27
Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem
28-40
Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism
41-54
Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point
55-68
Fast Arithmetic on Jacobians of Picard Curves
69-85
Undeniable Signatures Based on Characters: How to Sign with One Bit
86-100
Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures
101-114
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
115-129
Constant Round Authenticated Group Key Agreement via Distributed Computation
130-144
Efficient ID-based Group Key Agreement with Bilinear Maps
145-158
New Security Results on Encrypted Key Exchange
159-172
New Results on the Hardness of Diffie-Hellman Bits
173-186
Short Exponent Diffie-Hellman Problems
187-200
Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
201-217
Algebraic Attacks over GF(2
k
), Application to HFE Challenge 2 and Sflash-v2
218-230
Secret Exponent Attacks on RSA-type Schemes with Moduli N= p
r
q
231-247
General Group Authentication Codes and Their Relation to "Unconditionally-Secure Signatures"
248-261
From Digital Signature to ID-based Identification/Signature
262-276
Identity-Based Threshold Decryption
277-290
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
291-304
An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications
305-318
A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation
319-332
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
333-345
A Point Compression Method for Elliptic Curves Defined over GF(2 n)
346-359
On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny
360-374
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
375-388
QuasiModo: Efficient Certificate Validation and Revocation
389-401
A Distributed Online Certificate Status Protocol with a Single Public Key
402-415
A First Approach to Provide Anonymity in Attribute Certificates
416-424
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
425-438
Cryptographic Randomized Response Techniques
439-454
A Correct, Private, and Efficient Mix Network