Pages that link to "Item:Q5929912"
From MaRDI portal
The following pages link to The security of the cipher block chaining message authentication code (Q5929912):
Displaying 49 items.
- Automated proofs of block cipher modes of operation (Q287326) (← links)
- Revisiting structure graphs: applications to CBC-MAC and EMAC (Q350515) (← links)
- Tweakable block ciphers (Q451118) (← links)
- Notions and relations for RKA-secure permutation and function families (Q540472) (← links)
- An analysis of the blockcipher-based hash functions from PGV (Q604636) (← links)
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- Simple password-based three-party authenticated key exchange without server public keys (Q975863) (← links)
- Encryption modes with almost free message integrity (Q1021243) (← links)
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm (Q1021246) (← links)
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers (Q1749791) (← links)
- Bernoulli numbers and the probability of a birthday surprise (Q1811084) (← links)
- Tight security bounds for double-block hash-then-sum MACs (Q2055619) (← links)
- On the security of \textsf{TrCBC} (Q2094391) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- MoSS: modular security specifications framework (Q2128988) (← links)
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting (Q2129001) (← links)
- Incremental cryptography revisited: PRFs, nonces and modular design (Q2152052) (← links)
- Blockcipher-based authenticated encryption: how small can we go? (Q2188958) (← links)
- Beyond-birthday secure domain-preserving PRFs from a single permutation (Q2416937) (← links)
- Improved security analysis for nonce-based enhanced hash-then-mask MACs (Q2692363) (← links)
- NIST Block Cipher Modes of Operation for Authentication and Combined Confidentiality and Authentication (Q2785981) (← links)
- Reconfigurable Cryptography: A Flexible Approach to Long-Term Security (Q2796136) (← links)
- Breaking Symmetric Cryptosystems Using Quantum Period Finding (Q2829216) (← links)
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers (Q2835582) (← links)
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC (Q2835585) (← links)
- ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION (Q2890985) (← links)
- FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION (Q2905285) (← links)
- Integrity Analysis of Authenticated Encryption Based on Stream Ciphers (Q2953865) (← links)
- The State of the Authenticated Encryption (Q2970268) (← links)
- Concealment and Its Applications to Authenticated Encryption (Q3000035) (← links)
- On the Security of the Winternitz One-Time Signature Scheme (Q3011927) (← links)
- The power of primes: security of authentication based on a universal hash-function family (Q3056339) (← links)
- Contributory Password-Authenticated Group Key Exchange with Join Capability (Q3073704) (← links)
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713) (← links)
- Security of Hash-then-CBC Key Wrapping Revisited (Q3104712) (← links)
- On cryptographic properties of the $CVV$ and $PVV$ parameters generation procedures in payment systems (Q3382017) (← links)
- On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers (Q3503881) (← links)
- Efficient One-Round Key Exchange in the Standard Model (Q3511152) (← links)
- A Provable-Security Treatment of the Key-Wrap Problem (Q3593107) (← links)
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography (Q3600371) (← links)
- Building Secure Block Ciphers on Generic Attacks Assumptions (Q3644193) (← links)
- Strong Authenticity with Leakage Under Weak and Falsifiable Physical Assumptions (Q5040424) (← links)
- Using the numerical solution for partial fractional differential equation by ADI numerical method to cryptography in Hill matrix system (Q5059605) (← links)
- Economically Optimal Variable Tag Length Message Authentication (Q5854434) (← links)
- Quantum attacks on beyond-birthday-bound MACs (Q6167739) (← links)
- \textsf{LightMAC}: fork it and make it faster (Q6584328) (← links)
- On quantum secure compressing pseudorandom functions (Q6595806) (← links)
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \) (Q6605894) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)
