Key-minimal cryptosystems for unconditional secrecy

DOI10.1016/S0165-1765(03)00032-6zbMath0711.94015OpenAlexW2049350168WikidataQ42168024 ScholiaQ42168024MaRDI QIDQ923053

Philippe Godlewski, Chris J. Mitchell

Publication date: 1990

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-1765(03)00032-6

zbMATH Keywords

cryptosystemslatin squareperpendicular arraysecrecy codeunconditional secrecy

Mathematics Subject Classification ID

Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (16)

A tutorial on interaction ⋮ Group cooperation under uncertainty ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ Growth accelerations and reversals in emerging market and developing economies: external conditions and domestic amplifiers ⋮ Individual attitudes towards trade: Stolper-Samuelson revisited ⋮ The probabilistic reduction approach to specifying multinomial logistic regression models in health outcomes research ⋮ Can priming cooperation increase public good contributions? ⋮ Efficiency in the trust game: an experimental study of precommitment ⋮ Authentication codes and bipartite graphs ⋮ Double or nothing?! Small groups making decisions under risk in ``Quiz Taxi ⋮ DESCRIPTION OF NON-ENDOMORPHIC MAXIMUM PERFECT CIPHERS WITH TWO-VALUED PLAINTEXT ALPHABET ⋮ Altruistic behavior in a representative dictator experiment ⋮ Marginal Changes in Random Parameters Ordered Response Models with Interaction Terms ⋮ Algebraic properties of cryptosystem PGM ⋮ Коды аутентификации с секретностью (обзор) ⋮ Taylor quasi-likelihood for limited generalized linear models

This page was built for publication: Key-minimal cryptosystems for unconditional secrecy