Key-minimal cryptosystems for unconditional secrecy
From MaRDI portal
Recommendations
Cited in
(24)- Authentication codes and bipartite graphs
- A simply realizable ideal cryptographic system
- Attainable unconditional security for shared-key cryptosystems
- A framework for unconditionally secure public-key encryption (with possible decryption errors)
- The probabilistic reduction approach to specifying multinomial logistic regression models in health outcomes research
- Growth accelerations and reversals in emerging market and developing economies: external conditions and domestic amplifiers
- The Promise and Pitfalls of Differences-in-Differences: Reflections on 16 and Pregnant and Other Applications
- Altruistic behavior in a representative dictator experiment
- Marginal Changes in Random Parameters Ordered Response Models with Interaction Terms
- Re-keying algorithms for symmetric cryptosystems
- scientific article; zbMATH DE number 1979484 (Why is no real title available?)
- Can priming cooperation increase public good contributions?
- Algebraic properties of cryptosystem PGM
- Individual attitudes towards trade: Stolper-Samuelson revisited
- A large-deviations notion of perfect secrecy
- A tutorial on interaction
- scientific article; zbMATH DE number 1418481 (Why is no real title available?)
- Taylor quasi-likelihood for limited generalized linear models
- Double or nothing?! Small groups making decisions under risk in ``Quiz Taxi
- Коды аутентификации с секретностью (обзор)
- Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
- Group cooperation under uncertainty
- Efficiency in the trust game: an experimental study of precommitment
- Description of non-endomorphic maximum perfect ciphers with two-valued plaintext alphabet
This page was built for publication: Key-minimal cryptosystems for unconditional secrecy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923053)
