Pencil: a domain-extended committing BBB PRF for strengthening GCM
From MaRDI portal
Publication:7443550
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- Advances in Cryptology - CRYPTO 2003
- Authenticated encryption: Relations among notions and analysis of the generic composition paradigm
- Breaking and repairing GCM security proofs
- Efficient schemes for committing authenticated encryption
- Encryption modes with almost free message integrity
- How to securely release unverified plaintext in authenticated encryption
- Information Security and Cryptology - ICISC 2005
- Making GCM great again: toward full security and longer nonces
- Message franking via committing authenticated encryption
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- The security and performance of the Galois/counter mode (GCM) of operation
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
- Towards optimally secure deterministic authenticated encryption schemes
This page was built for publication: \(\sharp \mathsf{Pencil}\): a domain-extended committing BBB PRF for strengthening GCM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443550)