The following pages link to Mridul Nandi (Q350514):
Displaying 50 items.
- Revisiting structure graphs: applications to CBC-MAC and EMAC (Q350515) (← links)
- On the security of joint signature and encryption revisited (Q350517) (← links)
- Verifiability-based conversion from CPA to CCA-secure predicate encryption (Q683914) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls (Q1633460) (← links)
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
- Generic attacks against beyond-birthday-bound MACs (Q1673397) (← links)
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC (Q1673414) (← links)
- TriviA: a fast and secure authenticated encryption scheme (Q1695881) (← links)
- Improved security for OCB3 (Q1703942) (← links)
- The iterated random function problem (Q1703944) (← links)
- Tweakable HCTR: a BBB secure tweakable enciphering scheme (Q1738042) (← links)
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers (Q1749791) (← links)
- A note on the chi-square method: a tool for proving cryptographic security (Q1749799) (← links)
- On the optimality of non-linear computations for symmetric key primitives (Q1755961) (← links)
- Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries (Q1784090) (← links)
- Fault based almost universal forgeries on CLOC and SILC (Q1989610) (← links)
- Predicate signatures from pair encodings via dual system proof technique (Q2009416) (← links)
- Delegation-based conversion from CPA to CCA-secure predicate encryption (Q2019836) (← links)
- The Oribatida v1.3 family of lightweight authenticated encryption schemes (Q2040556) (← links)
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 (Q2055608) (← links)
- Efficient fully CCA-secure predicate encryptions from pair encodings (Q2070257) (← links)
- The \(\mathsf{mF}\) mode of authenticated encryption with associated data (Q2078199) (← links)
- Multi-user BBB security of public permutations based MAC (Q2088959) (← links)
- \textsf{Light-OCB}: parallel lightweight authenticated cipher with full security (Q2154057) (← links)
- Blockcipher-based authenticated encryption: how small can we go? (Q2188958) (← links)
- Tight security of cascaded LRW2 (Q2188969) (← links)
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff (Q2232120) (← links)
- \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC (Q2274243) (← links)
- Beyond birthday bound secure MAC in faulty nonce model (Q2292655) (← links)
- XHX -- a framework for optimally secure tweakable block ciphers from classical block ciphers and universal hashing (Q2303107) (← links)
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations (Q2672297) (← links)
- How to build optimally secure PRFs using block ciphers (Q2692365) (← links)
- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes (Q2795968) (← links)
- An Inverse-Free Single-Keyed Tweakable Enciphering Scheme (Q2795970) (← links)
- INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes (Q2799005) (← links)
- One-Key Compression Function Based MAC with Security Beyond Birthday Bound (Q2817474) (← links)
- Forging Attacks on Two Authenticated Encryption Schemes COBRA and POET (Q2938841) (← links)
- XLS is Not a Strong Pseudorandom Permutation (Q2938860) (← links)
- On the Minimum Number of Multiplications Necessary for Universal Hash Functions (Q2946925) (← links)
- Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions (Q2948158) (← links)
- Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption (Q2975808) (← links)
- Attacks on the Authenticated Encryption Mode of Operation <italic>PAE</italic> (Q2977244) (← links)
- ELmD: A Pipelineable Authenticated Encryption and Its Hardware Implementation (Q2985204) (← links)
- On the Security of Hash Functions Employing Blockcipher Postprocessing (Q3013082) (← links)
- The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants (Q3058714) (← links)
- Speeding Up the Wide-Pipe: Secure and Fast Hashing (Q3058721) (← links)
- Improved security analysis for OMAC as a pseudorandom function (Q3182466) (← links)
- Fast and Secure CBC-Type MAC Algorithms (Q3391583) (← links)
- An Improved Security Bound for HCTR (Q3525680) (← links)
