Probably Secure Keyed-Function Based Authenticated Encryption Schemes for Big Data
From MaRDI portal
Publication:4605645
DOI10.1142/S0129054117400123zbMath1417.94074OpenAlexW2786936095WikidataQ121694395 ScholiaQ121694395MaRDI QIDQ4605645
Rashed Mazumder, Atsuko Miyaji, Chun-hua Su
Publication date: 23 February 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054117400123
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analysis of the blockcipher-based hash functions from PGV
- The internet of things: a survey
- Parallelizable and Authenticated Online Ciphers
- CLOC: Authenticated Encryption for Short Input
- APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography
- Pipelineable On-line Encryption
- Boosting OMD for Almost Free Authentication of Associated Data
- A Lightweight 256-Bit Hash Function for Hardware and Low-End Devices: Lesamnta-LW
- Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
- Full PRF-Secure Message Authentication Code Based on Tweakable Block Cipher
- PPAE: Practical Parazoa Authenticated Encryption Family
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes
- A New Variant of PMAC: Beyond the Birthday Bound
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Computational Science and Its Applications – ICCSA 2004
- Theory of Cryptography
This page was built for publication: Probably Secure Keyed-Function Based Authenticated Encryption Schemes for Big Data
