Topics in Cryptology -- CT-RSA 2003
Springer Berlin (Verlag)
978-3-540-00847-7 (ISBN)
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.
Erscheint lt. Verlag | 18.3.2003 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 424 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 608 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | anonymity • authentication • Calculus • Computational Number Theory • Cryptanalysis • cryptographic protocolls • cryptography • Cryptosystems • Data Security • data structures • digital • digital signature schemes • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Identity • Information Security • privacy • Public-Key Cryptosystems • rsa • RSA Cryptosystems • security |
ISBN-10 | 3-540-00847-0 / 3540008470 |
ISBN-13 | 978-3-540-00847-7 / 9783540008477 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich