Perfectly secure message transmission

Dolev, Danny; Dwork, Cynthia; Waarts, Orli; Yung, Moti

doi:10.1145/138027.138036

Cited by 326 publications

(239 citation statements)

References 4 publications

Supporting

Mentioning

231

Contrasting

Unclassified

Order By: Relevance

“…There are some similarities between our protocol and that described by Dolev et al [17] for networks of processors with some faulty processors, in that both protocols use secret sharing as a means of protecting against nodes that deviate from the protocol. The protocols differ substantially with respect to the adversarial models they address.…”

Section: (A B) ∈ E(g))mentioning

confidence: 88%

Distributed authentication for randomly compromised networks

2009

View full text Add to dashboard Cite

Abstract. We introduce a simple, practical approach with probabilistic information-theoretic security to solve one of quantum key distribution's major security weaknesses: the requirement of an authenticated classical channel to prevent man-in-the-middle attacks. Our scheme employs classical secret sharing and partially trusted intermediaries to provide arbitrarily high confidence in the security of the protocol. Although certain failures elude detection, we discuss preemptive strategies to reduce the probability of failure to an arbitrarily small level: the probability of such failures is exponentially suppressed with increases in connectivity (i.e. connections per node).

show abstract

Section: (A B) ∈ E(g))mentioning

confidence: 88%

Distributed authentication for randomly compromised networks

2009

View full text Add to dashboard Cite

show abstract

“…The issue of possibility, feasibility and optimality in the context of PSMT in undirected synchronous networks has been completely resolved in [14,45,50,1,16,53,25,35]. However, all these works assume that the adversary can corrupt the nodes only in Byzantine fashion.…”

Section: Our Motivationmentioning

confidence: 99%

“…Following the approach of [14], we assume that any PSMT protocol operates as a sequence of phases, where a phase is a send from S to R or vice-versa. Moreover, since the network is synchronous, there exists a global clock and hence the transmission delay of each wire is fixed.…”

Section: Definition 3 (Byzantine Corruption [17]) a Node P Is Said Tmentioning

confidence: 99%

“…Definition 5 (Perfectly Reliable Message Transmission (PRMT) [14]). Let N = (V, E) be an undirected graph representing a synchronous network.…”

Section: Definition 3 (Byzantine Corruption [17]) a Node P Is Said Tmentioning

confidence: 99%

“…al. [14], who presented the first ever characterization (POSSIBILITY) for PSMT in an undirected synchronous network tolerating threshold static Byzantine adversary A , who corrupts the same set of t b nodes throughout the protocol in Byzantine fashion 9 . Dolev et.…”

Section: Existing Literature and Our Contributions -Static Adversarymentioning

confidence: 99%

See 2 more Smart Citations

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Choudhary

Patra

Ashwinkumar

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we study the issues related to the possibility, feasibility and optimality for perfectly secure message transmission (PSMT) in an undirected synchronous network, under the influence of a mixed adversary having unbounded computing power, who can corrupt some of the nodes in the network in Byzantine, fail-stop and passive fashion respectively. Specifically, we answer the following questions: (a) Possibility: Given a network and a mixed adversary, what is the necessary and sufficient condition for the existence of any PSMT protocol over the network tolerating the adversary? (b) Feasibility: Once the existence of a protocol is ensured, then does there exist a polynomial time and efficient protocol on the given network? (c) Optimality: Given a message of specific length, what is the minimum communication complexity (lower bound) needed by any PSMT protocol to transmit the message and how to design a polynomial time protocol whose total communication complexity matches the lower bound on the communication complexity? We answer the above questions by considering two different types of mixed adversary, namely static mixed adversary and mobile mixed adversary. Intuitively, it is more difficult to tolerate a mobile mixed adversary (who can corrupt different set of nodes during different stages of the protocol) in comparison to its static counter part (who corrupts the same set of nodes throughout the protocol). However, surprisingly, we show that the connectivity requirement in the network and lower bound on communication 6 This is an extended, modified and elaborate version of [10]

show abstract

Social rational secure multi‐party computation

Wang

Liu

Wang

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYRational party is a new kind of parties who behave neither like honest parties nor like malicious adversaries. The crux point of rational party is the definition of the utility function, as rational parties only care about how to maximize their utility. In other words, rational parties choose the strategies, which can bring them the highest utilities. In rational secure two‐party computation protocol, the main task is how to boost mutual cooperation to complete the protocol. Social rational secure multi‐party computation (SRSMPC) means that in a social network, some distributed and rational parties with reputation properties want to jointly compute a functionality. The seemingly simple task becomes tough under three conditions. The first condition is that the network composed by parties may not be complete. That is, two parties may not be neighbors and they are connected through other parties. The second is that the network may be not secure. That is, messages may be tempered by malicious parties. The third condition is that parties may run the protocol under incomplete information scenario. That is, parties may have types and each type has a corresponding utility function. Under the first and second conditions, parties need to consider how to securely transmit messages between two parties who are not neighbors. Under the third condition, we propose the Tit‐for‐Tat strategy and prove that mutual cooperation is a sequential equilibrium between two parties. In this paper, we construct an SRSMPC protocol by using mechanism design under incomplete information to facilitate the implementation of the SRSMPC protocol within constant rounds. Meanwhile, newcomers are allowed to participate in the protocol. To the best of our knowledge, this is the first social rational secure computation protocol for multi‐party under an incomplete information scenario and an incomplete network. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Perfectly secure message transmission

Cited by 326 publications

References 4 publications

Distributed authentication for randomly compromised networks

Distributed authentication for randomly compromised networks

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Social rational secure multi‐party computation

Contact Info

Product

Resources

About