Fast message franking: from invisible salamanders to encryptment
From MaRDI portal
Publication:1673389
DOI10.1007/978-3-319-96884-1_6zbMATH Open1440.94044OpenAlexW2950995294MaRDI QIDQ1673389FDOQ1673389
Authors: Yevgeniy Dodis, Paul Grubbs, Thomas Ristenpart, Joanne Woodage 
Publication date: 12 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_6
Recommendations
Cited In (19)
- The indifferentiability of the duplex and its practical applications
- A message franking channel
- Asymmetric message franking: content moderation for metadata-private end-to-end encryption
- The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees?
- Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks
- Partition oracles from weak key forgeries
- Anonymous, robust post-quantum public key encryption
- Authenticated encryption with key identification
- Compactly committing authenticated encryption using encryptment and tweakable block cipher
- Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more
- Asymmetric group message franking: definitions and constructions
- End-to-end secure messaging with traceability only for illegal content
- Integrating causality in messaging channels
- Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
- On committing authenticated-encryption
- Forward secure message franking
- The committing security of MACs with applications to generic composition
- KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more
- Efficient schemes for committing authenticated encryption
This page was built for publication: Fast message franking: from invisible salamanders to encryptment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673389)
