44 results on '"Nandi, Mridul"'
Search Results
2. Indifferentiability of the Confusion-Diffusion Network and the Cascade Block Cipher
3. Proof of Mirror Theory for a Wide Range of $$\xi _{\max }$$
4. Big Brother Is Watching You: A Closer Look at Backdoor Construction
5. Light-OCB: Parallel Lightweight Authenticated Cipher with Full Security
6. Towards Tight Security Bounds for OMAC, XCBC and TMAC
7. Mind the Composition: Birthday Bound Attacks on EWCDMD and SoKAC21
8. How to Build Optimally Secure PRFs Using Block Ciphers
9. BBB Secure Nonce Based MAC Using Public Permutations
10. XHX – A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing
11. Beyond Birthday Bound Secure MAC in Faulty Nonce Model
12. Tweakable HCTR: A BBB Secure Tweakable Enciphering Scheme
13. Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the $$\chi ^2$$ Method
14. Practical Fault Attacks on Minalpher: How to Recover Key with Minimum Faults?
15. The Iterated Random Function Problem
16. Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption
17. Improved Security for OCB3
18. INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes
19. One-Key Compression Function Based MAC with Security Beyond Birthday Bound
20. An Inverse-Free Single-Keyed Tweakable Enciphering Scheme
21. On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
22. On the Minimum Number of Multiplications Necessary for Universal Hash Functions
23. Characterization of EME with Linear Mixing
24. ELmE: A Misuse Resistant Parallel Authenticated Encryption
25. Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions
26. On the Security of Hash Functions Employing Blockcipher Postprocessing
27. Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems
28. A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
29. Security Analysis of the Mode of JH Hash Function
30. The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants
31. Speeding Up the Wide-Pipe: Secure and Fast Hashing
32. Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
33. Fast and Secure CBC-Type MAC Algorithms
34. Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions
35. Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
36. A Simple and Unified Method of Proving Indistinguishability
37. RC4-Hash: A New Hash Function Based on RC4
38. Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
39. Towards Optimal Double-Length Hash Functions
40. Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model
41. A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model
42. A Sufficient Condition for Optimal Domain Extension of UOWHFs
43. New Parallel Domain Extenders for UOWHF
44. An Improved Security Bound for HCTR
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.