scientific article; zbMATH DE number 1406775

From MaRDI portal
Revision as of 07:42, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4940691

zbMath0939.94567MaRDI QIDQ4940691

Hugo Krawczyk

Publication date: 1 March 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (46)

Attacks on quantum key distribution protocols that employ non-ITS authenticationAnalysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3Universal Hashing and Multiple AuthenticationUniversal Hash Functions from Exponential Sums over Finite Fields and Galois RingsOn Fast and Provably Secure Message Authentication Based on Universal HashingWeak-Key and Related-Key Analysis of Hash-Counter-Hash Tweakable Enciphering SchemesA new multi-linear universal hash familyOn-line ciphers and the Hash-CBC constructionsOn Weak Keys and Forgery Attacks Against Polynomial-Based MAC SchemesTight security of cascaded LRW2Improving classical authentication over a quantum channelThe universality of iterated hashing over variable-length stringsA modular approach to the security analysis of two-permutation constructionsMessage authentication based on cryptographically secure CRC without polynomial irreducibility testBetter security-efficiency trade-offs in permutation-based two-party computationCategorization of faulty nonce misuse resistant message authenticationOn weak keys and forgery attacks against polynomial-based MAC schemesQuantum key distribution with PRF(Hash, Nonce) achieves everlasting securityTowards closing the security gap of Tweak-aNd-Tweak (TNT)On Privacy-Preserving Biometric AuthenticationOn Efficient Message Authentication Via Block Cipher Design TechniquesKey-leakage evaluation of authentication in quantum key distribution with finite resourcesDirect proof of security of Wegman-Carter authentication with partially known keyMMH: Software message authentication in the Gbit/second ratesMRD HashingRIV for Robust Authenticated EncryptionRelated-Key Almost Universal Hash Functions: Definitions, Constructions and ApplicationsOn an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy CodesAuthenticating ad hoc networks by comparison of short digestsPractical unconditionally secure two-channel message authenticationKey-Recovery Attacks on Universal Hash Function Based MAC AlgorithmsThe circulant hash revisitedPrecise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker: Increasing the Security and Efficiency ofOnline Ciphers from Tweakable BlockciphersAn Integrated ECC-MAC Based on RS CodeEncryption modes with almost free message integrityInput-Oblivious Proof Systems and a Uniform Complexity Perspective on P/polyEWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MACThe Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3Reliable communication over partially authenticated networksTwo New Efficient CCA-Secure Online Ciphers: MHCBC and MCBCMRD hashing.A new post-quantum voting protocol based on physical lawsLimits of the Cryptographic Realization of Dolev-Yao-Style XORQuantum key distribution using universal hash functions over finite fields




This page was built for publication: