Publications of pkc 2002

Page	Title
1-16	New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive
17-33	Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages
34-47	On Sufficient Randomness for Secure Public-Key Cryptosystems
48-63	Multi-recipient Public-Key Encryption with Shortened Ciphertext
64-79	Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code
80-98	Formal Proofs for the Security of Signcryption
99-114	A Provably Secure Restrictive Partially Blind Signature Scheme
115-124	M+1-st Price Auction Using Homomorphic Encryption
125-140	Client/Server Tradeoffs for Online Elections
141-158	Self-tallying Elections and Perfect Ballot Secrecy
159-171	Efficient 1-Out-n Oblivious Transfer Schemes
172-187	Linear Code Implies Public-Key Traitor Tracing
188-198	Design and Security Analysis of Anonymous Group Identification Protocols
199-210	On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem
211-227	Solving Underdefined Systems of Multivariate Quadratic Equations
228-236	Selective Forgery of RSA Signatures with Fixed-Pattern Padding
237-251	New Chosen-Plaintext Attacks on the One-Wayness of the Modified McEliece PKC Proposed at Asiacrypt 2000
252-262	SPA-Based Adaptive Chosen-Ciphertext Attack on RSA Implementation
263-279	A Combined Timing and Power Attack
280-296	A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks
297-309	New European Schemes for Signature, Integrity and Encryption (NESSIE): A Status Report
310-322	An Improved Method of Multiplication on Certain Elliptic Curves
323-334	An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves
335-345	Weierstraß Elliptic Curves and Side-Channel Attacks
346-356	One-Way Cross-Trees and Their Applications
357-374	RSA Key Generation with Verifiable Randomness
375-384	New Minimal Modified Radix-r Representation with Applications to Smart Cards