Progress in Cryptology - INDOCRYPT 2006 [electronic resource] : 7th International Conference on Cryptology in India, Kolkata, India, December 11-13, 2006. Proceedings / edited by Rana Barua, Tanja Lange.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- text
- computer
- online resource
- 9783540497691
- Computer science
- Computer Communication Networks
- Data protection
- Data encryption (Computer science)
- Computer software
- Computational complexity
- Information Systems
- Computer Science
- Data Encryption
- Algorithm Analysis and Problem Complexity
- Discrete Mathematics in Computer Science
- Systems and Data Security
- Computer Communication Networks
- Management of Computing and Information Systems
- 005.82 23
- QA76.9.A25
Item type | Current library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
![]() |
Central Library | Available | E-43821 |
Invited Talk -- Whither Cryptography? -- Symmetric Cryptography: Attacks -- Non-randomness in eSTREAM Candidates Salsa20 and TSC-4 -- Differential and Rectangle Attacks on Reduced-Round SHACAL-1 -- Algebraic Attacks on Clock-Controlled Cascade Ciphers -- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication -- Hash Functions -- Update on Tiger -- RC4-Hash: A New Hash Function Based on RC4 -- Security of VSH in the Real World -- Provable Security: Key Agreement -- Cryptanalysis of Two Provably Secure Cross-Realm C2C-PAKE Protocols -- Efficient and Provably Secure Generic Construction of Three-Party Password-Based Authenticated Key Exchange Protocols -- On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols -- Invited Talk -- Another Look at “Provable Security”. II -- Provable Security: Public Key Cryptography -- Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions -- General Conversion for Obtaining Strongly Existentially Unforgeable Signatures -- Conditionally Verifiable Signature -- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission -- Symmetric Cryptography: Design -- Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks -- Enciphering with Arbitrary Small Finite Domains -- Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240 -- Modes of Operation and Message Authentication Codes -- Symmetric Nonce Respecting Security Model and the MEM Mode of Operation -- HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach -- Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function -- A Simple and Unified Method of Proving Indistinguishability -- Fast Implementation of Public Key Cryptography -- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography -- CMSS – An Improved Merkle Signature Scheme -- ID-Based Cryptography -- Constant-Size ID-Based Linkable and Revocable-iff-Linked Ring Signature -- Secure Cryptographic Workflow in the Standard Model -- Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext -- Identity-Based Parallel Key-Insulated Encryption Without Random Oracles: Security Notions and Construction -- Embedded System and Side Channel Attacks -- AES Software Implementations on ARM7TDMI -- Galois LFSR, Embedded Devices and Side Channel Weaknesses.
There are no comments on this title.