History-Free Aggregate Message Authentication Codes
From MaRDI portal
Recommendations
- Aggregate Message Authentication Codes
- History-free sequential aggregate signatures
- scientific article; zbMATH DE number 5525643
- Key-indistinguishable message authentication codes
- On the security of iterated message authentication codes
- Homomorphic signatures and message authentication codes
- Forward-secure sequential aggregate message authentication revisited
- Unconditionally Secure Approximate Message Authentication
- Security of message authentication codes in the presence of key-dependent messages
- Quantum-secure (non-)sequential aggregate message authentication codes
Cited in
(10)- Generic construction of sequential aggregate MACs from any MACs
- History-free sequential aggregate MAC revisited
- Another look at tightness
- History-free sequential aggregate signatures
- MAC aggregation with message multiplicity
- Forward-secure sequential aggregate message authentication revisited
- Sequential aggregate signatures with lazy verification from trapdoor permutations
- Aggregate Message Authentication Codes
- Non-adaptive Group-Testing Aggregate MAC Scheme
- Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing
This page was built for publication: History-Free Aggregate Message Authentication Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588350)