scientific article; zbMATH DE number 1406775
From MaRDI portal
Publication:4940691
Recommendations
Cited in
(52)- Encryption modes with almost free message integrity
- Reliable communication over partially authenticated networks
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- On-line ciphers and the Hash-CBC constructions
- The circulant hash revisited
- A new post-quantum voting protocol based on physical laws
- Quantum key distribution using universal hash functions over finite fields
- Tight security of cascaded LRW2
- Key-leakage evaluation of authentication in quantum key distribution with finite resources
- Authenticating ad hoc networks by comparison of short digests
- Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
- MRD hashing.
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Towards closing the security gap of Tweak-aNd-Tweak (TNT)
- scientific article; zbMATH DE number 1676651 (Why is no real title available?)
- Input-oblivious proof systems and a uniform complexity perspective on P/poly
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3
- On weak keys and forgery attacks against polynomial-based MAC schemes
- On privacy-preserving biometric authentication
- Lyra2: Efficient Password Hashing with High Security against Time-Memory Trade-Offs
- Analysis of message injection in stream cipher-based hash functions
- Online ciphers from tweakable blockciphers
- Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
- Universal hashing and multiple authentication
- Universal hash functions from exponential sums over finite fields and Galois rings
- On fast and provably secure message authentication based on universal hashing
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- An Integrated ECC-MAC Based on RS Code
- A new multi-linear universal hash family
- Improving classical authentication over a quantum channel
- The universality of iterated hashing over variable-length strings
- MMH: Software message authentication in the Gbit/second rates
- MRD hashing
- RIV for robust authenticated encryption
- Related-key almost universal hash functions: definitions, constructions and applications
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Direct proof of security of Wegman-Carter authentication with partially known key
- On Efficient Message Authentication Via Block Cipher Design Techniques
- : Increasing the Security and Efficiency of
- Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- A modular approach to the security analysis of two-permutation constructions
- Better security-efficiency trade-offs in permutation-based two-party computation
- Categorization of faulty nonce misuse resistant message authentication
- Efficient quantum blind signature for quantum networks
- CPAKE: an identity-binding password authenticated key exchange from quasi-cyclic codes
- Authenticated encryption based on Lesamnta-LW hashing mode
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Practical unconditionally secure two-channel message authentication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940691)
