Topics in Cryptology -- CT-RSA 2003
Editat de Marc Joyeen Limba Engleză Paperback – 18 mar 2003
Preț: 328.13 lei
Preț vechi: 410.16 lei
-20% Nou
Puncte Express: 492
Preț estimativ în valută:
58.06€ • 67.64$ • 50.70£
58.06€ • 67.64$ • 50.70£
Carte tipărită la comandă
Livrare economică 19 ianuarie-02 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540008477
ISBN-10: 3540008470
Pagini: 436
Ilustrații: XII, 424 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540008470
Pagini: 436
Ilustrații: XII, 424 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Key Self-protection.- Forward-Security in Private-Key Cryptography.- Intrusion-Resilient Public-Key Encryption.- Message Authentication.- TMAC: Two-Key CBC MAC.- Montgomery Prime Hashing for Message Authentication.- Digital Signatures.- An Analysis of Proxy Signatures: Is a Secure Channel Necessary?.- Invisibility and Anonymity of Undeniable and Confirmer Signatures.- Pairing Based Cryptography.- A Secure Signature Scheme from Bilinear Maps.- Access Control Using Pairing Based Cryptography.- Multivariate and Lattice Problems.- NTRUSign: Digital Signatures Using the NTRU Lattice.- About the XL Algorithm over GF(2).- Cryptographic Architectures.- Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications.- Hardware Performance Characterization of Block Cipher Structures.- New RSA-based Cryptosystems.- Simple Identity-Based Cryptography with Mediated RSA.- Two Birds One Stone: Signcryption Using RSA.- Invited Talk I.- Cryptography after the Bubble: How to Make an Impact on the World.- Chosen-Ciphertext Security.- Rethinking Chosen-Ciphertext Security under Kerckhoffs’ Assumption.- Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes.- Broadcast Encryption and PRF Sharing.- Fault Tolerant and Distributed Broadcast Encryption.- Shared Generation of Pseudo-Random Functions with Cumulative Maps.- Authentication Structures.- Authenticated Data Structures for Graph and Geometric Searching.- Fractal Merkle Tree Representation and Traversal.- Invited Talk II.- RSA Shortcuts.- Elliptic Curves and Pairings.- The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks.- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.- Threshold Cryptography.- Two Efficient andProvably Secure Schemes for Server-Assisted Threshold Signatures.- Secure Applications of Pedersen’s Distributed Key Generation Protocol.- Implementation Issues.- Seeing through Mist Given a Small Fraction of an RSA Private Key.- Simple Backdoors for RSA Key Generation.
Caracteristici
Includes supplementary material: sn.pub/extras