Lower bounds on the probability of successful substitution of messages
type: Item
instance of: scholarly article
title: Lower bounds on the probability of successful substitution of messages
zbMATH Open document ID: 0810.94028
author: L. A. Bassalygo
published in: Problems of Information Transmission
publication date: 1994-03-14T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 482601
zbMATH Keywords: cryptography
zbMATH Keywords: security
zbMATH Keywords: probability
zbMATH Keywords: substitution of messages
MaRDI profile type: Publication
Recommended article: Q3071763
Recommended article: Sublinear Message Bounds for Randomized Agreement
Recommended article: Reliable communication over channels with insertions, deletions, and substitutions
Recommended article: Communication and Randomness Lower Bounds for Secure Computation
Recommended article: Q2778860
Recommended article: Lower bounds for one-way probabilistic communication complexity
Recommended article: The communication complexity of private simultaneous messages, revisited
Recommended article: Q4044428
Recommended article: Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
description: scientific article; zbMATH DE number 482601