搜索结果: 1-15 共查到“军队指挥学 Message Transmission”相关记录30条 . 查询时间(0.078 秒)
Composable and Finite Computational Security of Quantum Message Transmission
Quantum cryptography composable security computational security
2019/8/14
Recent research in quantum cryptography has led to the development of schemes that encrypt and authenticate quantum messages with computational security. The security definitions used so far in the li...
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission
mobile tt-adversary PSMT
2018/12/3
In a network of nn nodes (modelled as a digraph), the goal of a perfectly secret message transmission (PSMT) protocol is to replicate sender's message mm at the receiver's end without revealing any in...
Perfectly Secure Message Transmission Scheme against Rational Adversaries
secure message transmission game theory rational adversary
2017/4/12
Secure Message Transmission (SMT) is a two-party cryptographic scheme by which a sender securely and reliably sends messages to a receiver using nn channels. Suppose that an adversary corrupts at most...
Reliable Message Transmission under Partial Knowledge
reliable message transmission byzantine adversary partial knowledge
2016/1/3
A fundamental primitive in distributed computing is Reliable Message Transmission
(RMT), which refers to the task of correctly sending a message from a party to
another, despite the presence of byza...
Message Transmission with Reverse Firewalls---Secure Communication on Corrupted Machines
reverse firewalls exfiltration secure message transmission
2015/12/30
A secure reverse firewall, as recently defined by Mironov and Stephens-Davidowitz, is a
third party that “sits between a user and the outside world” and modifies the user’s sent and received
message...
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks
cryptographic protocols
2012/3/28
In this paper, we study the communication complexity of Reliable Message Transmission (RMT) and Secure Message Transmission (SMT) protocols in asynchronous settings. We consider two variants of the pr...
Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks
Directed networks Connectivity Information-theoretic security
2012/3/27
In this paper we give the minimal connectivity required in a synchronous directed network, which is under the influence of a computationally unbounded \emph{Byzantine} adversary that can corrupt a sub...
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks
Reliable Message Transmission Secure Message Transmission investigation reveals
2011/6/9
In this paper, we study the communication complexity of Reliable Message Transmission (RMT) and Secure Message Transmission (SMT) protocols in asynchronous settings. We consider two variants of the pr...
Efficient 2-Round General Perfectly Secure Message Transmission: A Minor Correction to Yang and Desmedt's Protocol
Protocol General Perfectly
2012/3/28
At Asiacrypt~'10, Yang and Desmedt proposed a number of perfectly secure message transmission protocols in the general adversary model. However, there is a minor flaw in the 2-round protocol in an und...
Efficient 2-Round General Perfectly Secure Message Transmission: A Minor Correction to Yang and Desmedt's Protocol
perfectly secure message transmission protocols minor flaw transmit multiple messages
2011/6/9
At Asiacrypt~'10, Yang and Desmedt proposed a number of perfectly secure message transmission protocols in the general adversary model. However, there is a minor flaw in the 2-round protocol in an und...
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
Information theoretic security non-threshold adversary Byzantine corruption efficiency
2011/1/18
Patra et al. gave a necessary and sufficient condition for the possibility of almost perfectly secure message transmission protocols tolerating general, non-threshold Q^2 adversary structure. However,...
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
cryptographic protocols
2012/3/30
Patra et al. gave a necessary and sufficient condition for the possibility of almost perfectly secure message transmission protocols tolerating general, non-threshold Q^2 adversary structure. However,...
Unconditionally Reliable Message Transmission in Directed Neighbour Networks
information-theoretic security directed neighbour network Byzantine adversary
2011/1/12
The problem of unconditionally reliable message transmission (URMT) is to design a protocol which when run by players in a network enables a sender S to deliver a message to a receiver R with high pro...
Secure Message Transmission In Asynchronous Directed Networks
information-theoretic security asynchronous network directed network Byzantine adversary
2011/1/12
We study the problem of information-theoretically secure message transmission (SMT) in asynchronous directed networks. In line with the literature, the distrust and failures of the network is captured...
Secure Message Transmission In Asynchronous Directed Networks
foundations / information-theoretic security asynchronous network directed network Byzantine adversary
2012/3/30
We study the problem of information-theoretically secure message transmission (SMT) in asynchronous directed networks. In line with the literature, the distrust and failures of the network is captured...