Public Key Cryptography PKC 2004 : 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004. Proceedings.Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 2947,Publication details: Berlin ; Heidelberg : Springer-Verlag Berlin Heidelberg, 2004. Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540246329; 3540246320Subject(s): Computer science | Computer Communication Networks | Data encryption (Computer science) | Computer software | Information Systems | Data Encryption | Algorithm Analysis and Problem Complexity | Computers and Society | Management of Computing and Information Systems | Computer science | Computer software | Data encryption (Computer science)Genre/Form: Electronic books. DDC classification: 005.82 LOC classification: QA76.9.A25Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
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.
A Generalized Wiener Attack on RSA -- Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem -- Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism -- Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point -- Fast Arithmetic on Jacobians of Picard Curves -- Undeniable Signatures Based on Characters: How to Sign with One Bit -- Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures -- Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model -- Constant Round Authenticated Group Key Agreement via Distributed Computation -- Efficient ID-based Group Key Agreement with Bilinear Maps -- New Security Results on Encrypted Key Exchange -- New Results on the Hardness of Diffie-Hellman Bits -- Short Exponent Diffie-Hellman Problems -- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups -- Algebraic Attacks over GF(2 k ), Application to HFE Challenge 2 and Sflash-v2 -- Secret Exponent Attacks on RSA-type Schemes with Moduli N=p r q -- General Group Authentication Codes and Their Relation to "Unconditionally-Secure Signatures" -- From Digital Signature to ID-based Identification/Signature -- Identity-Based Threshold Decryption -- An Efficient Signature Scheme from Bilinear Pairings and Its Applications -- An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications -- A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation -- Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability -- A Point Compression Method for Elliptic Curves Defined over GF(2 n ) -- On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny -- On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? -- QuasiModo: Efficient Certificate Validation and Revocation -- A Distributed Online Certificate Status Protocol with a Single Public Key -- A First Approach to Provide Anonymity in Attribute Certificates -- A Nonuniform Algorithm for the Hidden Number Problem in Subgroups -- Cryptographic Randomized Response Techniques -- A Correct, Private, and Efficient Mix Network.