Detail Cantuman
Pencarian Spesifik
E Book
Public Key Cryptography - PKC 2005
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 -- Efficient Multi-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.
Ketersediaan
Tidak ada salinan data
Informasi Detail
| Judul Seri |
-
|
|---|---|
| No. Panggil |
-
|
| Penerbit | Springer : Berlin., 2005 |
| Deskripsi Fisik |
XIV, 436 p.online resource.
|
| Bahasa |
English
|
| ISBN/ISSN |
9783540305804
|
| Klasifikasi |
005.82
|
| Tipe Isi |
-
|
| Tipe Media |
-
|
|---|---|
| Tipe Pembawa |
-
|
| Edisi |
1st ed.
|
| Subjek |
Management information systems.
Computer communication systems. Computer Communication Networks. Computers and civilization. Computers and Society. Data encryption (Computer science). Algorithms. Cryptology. Algorithm Analysis and Problem Complexity. Computer science. Management of Computing and Information Systems. |
| Info Detail Spesifik |
-
|
| Pernyataan Tanggungjawab |
Serge Vaudenay.
|
Versi lain/terkait
Tidak tersedia versi lain
Informasi
Akses Katalog Publik Daring - Gunakan fasilitas pencarian untuk mempercepat penemuan data katalog






