搜索结果: 1-10 共查到“军事学 perfectly secure message transmission”相关记录10条 . 查询时间(0.067 秒)
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...
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,...
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 (...
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...
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks
Communication Complexity Perfectly Secure Message Transmission Directed Networks
2009/9/27
In this paper, we re-visit the problem of perfectly secure message transmission (PSMT) in a di-
rected network under the presence of a threshold adaptive Byzantine adversary, having unbounded
comput...
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
Perfectly secure message transmission information theoretic security efficiency
2009/6/9
In the model of perfectly secure message transmission schemes
(PSMTs), there are n channels between a sender and a receiver. An infinitely
powerful adversary A may corrupt (observe and forge) the me...
Perfectly Secure Message Transmission Revisited
network security privacy network connectivity
2009/4/15
Perfectly Secure Message Transmission Revisited.