搜索结果: 1-15 共查到“军事学 Secure Message Transmission”相关记录22条 . 查询时间(0.066 秒)
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...
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,...
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...
Round-Efficient Perfectly Secure Message Transmission Scheme Against General Adversary
PSMT adevrsary structure 3-round 2-round Q2-adversary
2010/8/26
In the model of Perfectly Secure Message Transmission Schemes (PSMTs), there are $n$ channels between a sender and a receiver, and they share no key. An infinitely powerful adversary $A$ can corrupt (...
Protocols for Reliable and Secure Message Transmission
Reliable and Secure Message Transmission Protocols
2010/7/13
Consider the following problem: a sender S and a receiver R are part of an unreliable, connected, distributed network. The distrust in the network is modelled by an entity called adversary, who has un...
Cryptanalysis of Secure Message Transmission Protocols with Feedback (Full version of the ICITS 2009 paper with the same title and authors)
secure message transmission privacy and reliability Guessing Attack
2009/12/29
In the context of secure point-to-point message transmission in networks with minimal
connectivity, previous studies showed that feedbacks from the receiver to the sender can be used to
reduce the r...
Secure Message Transmission with Small Public Discussion
Secure message transmission information-theoretic security almost-everywhere secure computation
2009/11/18
In the problem of Secure Message Transmission in the public discussion model (SMT-PD), a Sender
wants to send a message to a Receiver privately and reliably. Sender and Receiver are connected by
n c...
Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures
secret sharing perfectly secure message transmission error correction
2009/10/9
An error decodable secret-sharing scheme is a secret-sharing scheme with the additional
property that the secret can be recovered from the set of all shares, even after a coalition
of participants c...