Abstract. In Secure Message Transmission (SMT) problem, a sender S is connected to a receiver R through N node disjoint bidirectional paths.

In this paper we focus on 1-round δ-RMT and (0,δ)-SMT where the chance of protocol failure (receiver cannot decode the sent message) is at most δ, and in the ...

A new approach to the construction of 1-round δ-RMT and (0, δ)-SMT for all connectivities N≥2t+1, using list decodable codes and message authentication ...

We propose a new approach to the construction of 1-round δ-RMT and (0, δ)-SMT for all connectivities N≥2t+1, using list decodable codes and message ...

Jul 30, 2022 · In this paper we focus on 1-round \delta-RMT and (0,\delta)-SMT where the chance of protocol failure (receiver cannot decode the sent message) ...

Get details about the chapter of A General Construction for 1-Round δ-RMT and (0, δ)-SMT from book Applied Cryptography and Network Security: 10th ...

No information is available for this page. · Learn why

Reihaneh Safavi-Naini, Mohammed Ashraful Tuhin, Pengwei Wang: A General Construction for 1-Round δ-RMT and (0, δ)-SMT. ACNS 2012: 344-362.

A General Construction for 1-Round δ-RMT and (0, δ)-SMT. R Safavi-Naini, MA Tuhin, P Wang. Applied Cryptography and Network Security, 344-362, 2012. 6, 2012.

A General Construction for 1-Round δ-RMT and (0, δ)-SMT. R Safavi-Naini, MA Tuhin, P Wang. Applied Cryptography and Network Security, 344-362, 2012. 6, 2012.