Learn · Foundations of Cryptography, IIIT Bangalore
Lecture 50 of 66Week 11 CCA-secure Public-key Hybrid Ciphers Based on Diffie-Hellman Problems and RSA-assumption, Digital Signatures,…
CCA-Secure Public-key Ciphers Based on RSA Assumption
Prof. Ashish Choudhury · IIIT Bangalore
Credits and licence
- From
- Foundations of Cryptography, IIIT Bangalore, IIIT Bangalore (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IISc Bangalore.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Introduction
- Symmetric-key Encryption
- Historical Ciphers and their Cryptanalysis
- Perfect Security
- Limitations of Perfect Security
- Introduction to Computational Security
- Semantic Security
- Pseudo-random Generators (PRGs)
- Operations on Pseudorandom Generators
- Stream Ciphers
- Provably-secure Instantiation of PRG
- Practical Instantiations of PRG
- CPA-security
- Pseudo-random Functions (PRFs)
- CPA-secure Encryption from PRF
- Modes of Operations of Block Ciphers Part I
- Modes of Operations of Block Ciphers Part II
- Theoretical Constructions of Block Ciphers
- Practical Constructions of Block Ciphers: Part I
- Practical Constructions of Block Ciphers: Part II
- From Passive to Active Adversary
- Message Integrity and Authentication
- Message Authentication for Long Messages : Part I
- Message Authentication for Long Messages : Part II
- Information-theoretic MACs : Part I
- Information-theoretic MACs : Part II
- Cryptographic Hash Functions: Part I
- Cryptographic Hash Functions: Part II
- Message Authentication Using Hash Functions
- Generic Attacks on Hash Functions and Additional Applications of Hash Functions
- Random Oracle Model: Part I
- Random Oracle Model: Part II
- Authenticated Encryption
- Composing CPA-secure Cipher with a Secure MAC: Part I
- Composing CPA-secure Cipher with a Secure MAC: Part II
- Key-Exchange Protocols: Part I
- Key-Exchange Protocols: Part II
- Cyclic groups
- Cryptographic Hardness Assumptions in the Cyclic Groups
- Candidate Cyclic Groups for Cryptographic Purposes: Part I
- Candidate Cyclic Groups for Cryptographic Purposes: Part II
- Cryptographic Applications of the Discrete Log Assumption
- Public-key Encryption
- El Gamal Public-key Encryption Scheme
- RSA Assumption
- RSA Public-key Cryptosystem
- Hybrid Public-key Cryptosystem
- CCA-Secure Public-key Ciphers
- CCA-Secure Public-key Ciphers Based on Diffie-Hellman Problems
- CCA-Secure Public-key Ciphers Based on RSA Assumption
- Digital Signatures
- RSA Signatures
- Identification Schemes
- Schnorr Signature Scheme and TLS/SSL
- Number Theory
- Secret Sharing
- Zero-Knowledge Protocols: Part I
- Zero-Knowledge Protocols: Part II
- Good Bye for Now
- Live Session 18-02-2021
- Live Session 10-03-2020
- Live Session 14-02-2022
- Live Session 19-04-2022
- Live Session 06-03-2024
- Live Session 10-02-2025
- Live Session 24-03-2025