Topics in Cryptology — CT-RSA 2003 [electronic resource] : The Cryptographers’ Track at the RSA Conference 2003 San Francisco, CA, USA, April 13–17, 2003 Proceedings / edited by Marc Joye.

Contributor(s): Joye, Marc [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 2612Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2003Description: XII, 424 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540365631Subject(s): Computer science | Computer Communication Networks | Operating systems (Computers) | Data encryption (Computer science) | Computational complexity | Information Systems | Computer Science | Data Encryption | Computer Communication Networks | Operating Systems | Discrete Mathematics in Computer Science | Computers and Society | Management of Computing and Information SystemsAdditional physical formats: Printed edition:: No titleDDC classification: 005.82 LOC classification: QA76.9.A25Online resources: Click here to access online
Contents:
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 and Provably 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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4316

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 and Provably 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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha