Information theoretically secure encryption with almost free authentication
From MaRDI portal
Recommendations
Cited in
(5)- The power of primes: security of authentication based on a universal hash-function family
- \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels
- Information Theoretic Bounds on Authentication Systems in Query Model
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Information-theoretic bounds for authentication schemes
This page was built for publication: Information theoretically secure encryption with almost free authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929336)