Cantitate/Preț
Produs

Public Key Cryptography -- PKC 2004: 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004: Lecture Notes in Computer Science, cartea 2947

Editat de Feng Bao, Robert Deng, Jianying Zhou
en Limba Engleză Paperback – 18 feb 2004

Din seria Lecture Notes in Computer Science

Preț: 39184 lei

Nou

Puncte Express: 588

Preț estimativ în valută:
7499 7790$ 6229£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540210184
ISBN-10: 3540210180
Pagini: 472
Ilustrații: XIII, 459 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 Choicefor 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.

Caracteristici

Includes supplementary material: sn.pub/extras