Secure network coding with adaptive and active attack

DOI10.1007/978-3-031-82014-4_9MaRDI QIDQ6973077zbMATH OpenFDO

Authors Masahito Hayashi

Publication date 11 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-82014-4_9

zbMATH Keywords

anti-Latin squarenonlinear codeone-hop relay networkunicast relay network

Mathematics Subject Classification ID

Cryptography (94A60) Other types of codes (94B60)

Cites work

• Capacity of Quantum Private Information Retrieval With Colluding Servers
• Euler squares.
• How to share a secret
• Linear network coding
• Network information flow
• Nonnegative entropy measures of multivariate symmetric correlations
• On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
• On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes
• Secure Network Coding for Wiretap Networks of Type II
• Secure Network Coding on a Wiretap Network
• The Construction of Orthogonal Latin Squares
• Unified approach to secret sharing and symmetric private information retrieval with colluding servers in quantum systems
• Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
• Universal Secure Network Coding via Rank-Metric Codes
• Wire-Tap Channel II

This page was built for publication: Secure network coding with adaptive and active attack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973077)