The following pages link to (Q4343418):
Displaying 19 items.
- Arbitrated unconditionally secure authentication scheme with multi-senders (Q293236) (← links)
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test (Q1696144) (← links)
- Analysis and improvement of an authentication scheme in incremental cryptography (Q1726662) (← links)
- The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
- Incremental cryptography revisited: PRFs, nonces and modular design (Q2152052) (← links)
- Secure storage -- confidentiality and authentication (Q2172857) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- PMAC with Parity: Minimizing the Query-Length Influence (Q2890005) (← links)
- Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption (Q2975808) (← links)
- Generalizing PMAC Under Weaker Assumptions (Q3194621) (← links)
- On Fast and Provably Secure Message Authentication Based on Universal Hashing (Q3452360) (← links)
- Authenticated Encryption Mode for Beyond the Birthday Bound Security (Q3506375) (← links)
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier (Q3525682) (← links)
- A MAC Mode for Lightweight Block Ciphers (Q4639470) (← links)
- Boosting Merkle-Damgård Hashing for Message Authentication (Q5387101) (← links)
- Multilane HMAC— Security beyond the Birthday Limit (Q5458198) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)
- IQRA: Incremental Quadratic Re-keying friendly Authentication scheme (Q5871457) (← links)
- The security of the cipher block chaining message authentication code (Q5929912) (← links)
