PKC 2003 was the Sixth International Workshop on Practice and Theory in Public Key Cryptography and was sponsored by IACR, the International As- ciation for Cryptologic Research (www.iacr.org). This year the workshop was organized in cooperation with the Department of Computer Science, Florida State University. The General Chair, Mike Burmester was responsible for local organization, registration, etc. There were 105 submitted papers which were considered by the Program Committee. This is an increase of 52% compared to PKC 2002, which took place in Paris, France, February 2002, and which was incorrectly identi?ed on the cover of the proceedings as being the fourth workshop. Due to the large number of submissions, some papers that contained new ideas had to be rejected. Priority was given to novel papers. Of the 105 submissions, 26 were selected for the proceedings. These contain the revised versions of the accepted papers. Each paper was sent to at least 3 members of the program committee for comments. Revisions were not checked for correctness of their scienti?c aspects and the authors bear full responsibility for the contents of their papers. Some authors will write ?nal versions of their papers for publication in refereed journals. I am very grateful to the members of the Program Committee for their hard work in the di?cult task of selecting roughly 1 out of 4 of the submitted papers.
Author(s): Yevgeniy Dodis (auth.), Yvo G. Desmedt (eds.)
Series: Lecture Notes in Computer Science 2567
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002
Language: English
Pages: 376
Tags: Computer Science, general; Computer Communication Networks; Data Encryption; Algorithm Analysis and Problem Complexity; Computers and Society; Management of Computing and Information Systems
Efficient Construction of (Distributed) Verifiable Random Functions....Pages 1-17
An Identity-Based Signature from Gap Diffie-Hellman Groups....Pages 18-30
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme....Pages 31-46
An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack....Pages 47-61
On the Bit Security of NTRUEncrypt....Pages 62-70
Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks....Pages 71-84
Randomness Re-use in Multi-recipient Encryption Schemeas....Pages 85-99
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack....Pages 100-115
The Cramer-Shoup Strong-RSA Signature Scheme Revisited....Pages 116-129
Strong Key-Insulated Signature Schemes....Pages 130-144
A Verifiable Secret Shuffe of Homomorphic Encryptions....Pages 145-160
Round-Optimal Contributory Conference Key Agreement....Pages 161-174
Security Analysis of the MOR Cryptosystem....Pages 175-186
A Practical Attack on Some Braid Group Based Cryptographic Primitives....Pages 187-198
A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems....Pages 199-211
Validation of Elliptic Curve Public Keys....Pages 211-223
Exceptional Procedure Attack on Elliptic Curve Cryptosystems....Pages 224-239
On Montgomery-Like Representations for Elliptic Curves over GF (2 k )....Pages 240-254
A Dedicated Sieving Hardware....Pages 254-266
A Fast and Secure Implementation of Sflash....Pages 267-278
A Practical Public Key Cryptosystem from Paillier and Rabin Schemes....Pages 279-291
A Lattice Based Public Key Cryptosystem Using Polynomial Representations....Pages 292-308
The Security of DSA and ECDSA....Pages 309-323
Side-Channel Attacks on Textbook RSA and ElGamal Encryption....Pages 324-336
On the Security of HFE, HFEv- and Quartz....Pages 337-350
Generic Attacks and the Security of Quartz....Pages 351-364
