Efficient schemes for committing authenticated encryption
From MaRDI portal
Publication:2170073
Recommendations
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- Advances in Cryptology - EUROCRYPT 2004
- Analyzing multi-key security degradation
- Efficient schemes for committing authenticated encryption
- Fast message franking: from invisible salamanders to encryptment
- Fast Software Encryption
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1759277 (Why is no real title available?)
- Keying hash functions for message authentication
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Message franking via committing authenticated encryption
- Multi-key security: the Even-Mansour construction revisited
- Nonce-based cryptography: retaining security when randomness fails
- Nonces are noticed: AEAD revisited
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Progress in Cryptology - INDOCRYPT 2004
- Reconsidering generic composition
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Robust Encryption
- Robust encryption, revisited
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Cited in
(25)- A new authenticated encryption technique for handling long ciphertexts in memory constrained devices
- Fast message franking: from invisible salamanders to encryptment
- Efficient schemes for committing authenticated encryption
- Access control encryption with efficient verifiable sanitized decryption
- scientific article; zbMATH DE number 5670521 (Why is no real title available?)
- Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks
- Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more
- On committing authenticated-encryption
- Authenticated encryption with key identification
- Revisiting the security of \textsf{COMET} authenticated encryption scheme
- KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more
- The indifferentiability of the duplex and its practical applications
- Compactly committing authenticated encryption using encryptment and tweakable block cipher
- Succinctly-committing authenticated encryption
- The committing security of MACs with applications to generic composition
- Succinct PPRFs via memory-tight reductions
- Practical committing attacks against Rocca-S
- A formal treatment of envelope encryption
- Committing authenticated encryption: generic transforms with hash functions
- Committing security of AEAD based on stream cipher
- Robust AE with committing security
- How to build a short-input random oracle from public random permutations
- On TRP-RF switch in the quantum query model
- Binding security of implicitly-rejecting KEMs and application to BIKE and HQC
- Authenticated encryption based on Lesamnta-LW hashing mode
This page was built for publication: Efficient schemes for committing authenticated encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170073)