Public Key Cryptography - PKC 2005
Springer Berlin (Verlag)
978-3-540-24454-7 (ISBN)
Cryptanalysis.- A New Related Message Attack on RSA.- Breaking a Cryptographic Protocol with Pseudoprimes.- Experimenting with Faults, Lattices and the DSA.- Key Establishment.- Securing RSA-KEM via the AES.- One-Time Verifier-Based Encrypted Key Exchange.- Password-Based Authenticated Key Exchange in the Three-Party Setting.- Optimization.- On the Optimization of Side-Channel Attacks by Advanced Stochastic Methods.- Symmetric Subgroup Membership Problems.- Building Blocks.- Optimizing Robustness While Generating Shared Secret Safe Primes.- Fast Multi-computations with Integer Similarity Strategy.- Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order.- Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries.- RSA Cryptography.- Converse Results to the Wiener Attack on RSA.- RSA with Balanced Short Exponents and Its Application to Entity Authentication.- The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity.- From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited.- Multivariate Asymmetric Cryptography.- Tractable Rational Map Signature.- Cryptanalysis of the Tractable Rational Map Cryptosystem.- Large Superfluous Keys in ultivariate uadratic Asymmetric Systems.- Cryptanalysis of HFEv and Internal Perturbation of HFE.- Signature Schemes.- A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible.- Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring.- The Security of the FDH Variant of Chaum's Undeniable Signature Scheme.- Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions.- Identity-Based Cryptography.- Improved Identity-Based Signcryption.- EfficientMulti-receiver Identity-Based Encryption and Its Application to Broadcast Encryption.- CBE from CL-PKE: A Generic Construction and Efficient Schemes.- Best Paper Award.- A Verifiable Random Function with Short Proofs and Keys.
Erscheint lt. Verlag | 13.1.2005 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
Zusatzinfo | XIV, 436 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 1400 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | aes • Algorithm analysis and problem complexity • asymmetric cryptography • authentication • cryptography • digital signature schemes • group key agreement • identity-based encryption • Public Key Cryptography • Public Key Cryptosystems • public key encryption • RSA Cryptosystems • Shared Secret • signcryption |
ISBN-10 | 3-540-24454-9 / 3540244549 |
ISBN-13 | 978-3-540-24454-7 / 9783540244547 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich