A method of protected distribution of data among unreliable and untrusted nodes
DOI10.18500/1816-9791-2019-19-3-326-337zbMATH Open1456.68032OpenAlexW2972250254MaRDI QIDQ5113873FDOQ5113873
Yury V. Kosolapov, Fedor Sergeevich Pevnev
Publication date: 18 June 2020
Published in: Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/isu811
Recommendations
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Cites Work
- Generalized Hamming weights for linear codes
- Some New Characters on the Wire-Tap Channel of Type II
- Dimension/length profiles and trellis complexity of linear block codes
- Selecting cryptographic key sizes
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
- Semantic Security for the Wiretap Channel
- Some new NP-complete coding problems
- Codes for a generalized wire-tap channel model
- On the experimental estimation of the lower bound for the maximum number of messages in a scheme aimed at data protection against spoofing
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: A method of protected distribution of data among unreliable and untrusted nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113873)