Yongge Wang, Yvo Desmedt  Home/Search
Context Related
| uwm.edu/~wang/papers/ecrypt99.ps.gz cacr.math.uwaterloo.ca...ecrypt99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uwm.edu/~wang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have initiated the study of secure communication and secure computation in multi-recipient (broadcast) models. A "broadcast channel" (such as ethernet) enables one processor to send the same message---simultaneously and privately---to a fixed subset of processors. In their recent paper, Franklin and Wright have shown that ... (Update)
Context of citations to this paper: More
...of lines. Subsequently, Wang and Desmedt have shown an efficient (0; ffi) secure message transmission protocol that works for all n t [WD99]. Intuitively, our protocol proceeds as follows. The receiver attempts to transmit to the sender many random, uniquely labeled, one...
...is an efficient protocol to achieve probabilisticly reliable and perfectly private communication when n d3k=2e. Recently, Wang and Desmedt [13] have shown that, indeed, the condition n k is necessary and sufficient for achieving efficient probabilisticly reliable and...
Cited by: More
Secure Communication in an Unknown Network Using Certificates - Burmester, Desmedt (Correct)
Sharing Unconditionally Secure Secret Keys - Mizuki (2000) (Correct)
Approximation Hardness And Secure Communication In Broadcast.. - Desmedt, Wang (1999) (Correct)
Similar documents (at the sentence level): More
69.2%: Secure Communication in Multicast Channels: The Answer to.. - Wang, Desmedt (2000) (Correct)
55.6%: Secure Communication in Broadcast Channels: The Answer to.. - Wang, Desmedt (Correct)
7.3%: Secure Communication in Minimal Connectivity Models - Franklin, Wright (1998) (Correct)
Active bibliography (related documents): More All
0.1: Efficient Zero-Knowledge Proofs for Some Practical Graph Problems - Desmedt, Wang (Correct)
0.1: Efficient Reliable Communication Over Partially Authenticated.. - Beimel, Malka (2003) (Correct)
0.1: Universal Hashing and Multiple Authentication - Atici, Stinson (1996) (Correct)
Similar documents based on text: More All
0.7: A comment on the efficiency of secret sharing.. - Desmedt, King.. (1998) (Correct)
0.4: Use Approximation Hardness to Achieve Dependable Computation - Burmester, Desmedt, Wang (1998) (Correct)
Related documents from co-citation: More All
5: Secure hypergraphs: privacy from partial broadcast - Franklin, Yung - 1995
4: Fault-tolerant Computation in the Full Information Model - Goldreich, Goldwasser et al. - 1991
4: Perfectly secure message transmission (context) - Dolev, Dwork et al. - 1993
BibTeX entry: (Update)
Y. Wang and Y. Desmedt, "Secure communication in broadcast channels: The answer to Franklin and Wright's question", Proc. Eurocrypt '99, 446--458. http://citeseer.ist.psu.edu/article/wang99secure.html More
@article{ wang99secure,
author = "Yongge Wang and Yvo Desmedt",
title = "Secure Communication in Broadcast Channels: The Answer to {Franklin} and {Wright}'s Question",
journal = "Lecture Notes in Computer Science",
volume = "1592",
pages = "446--??",
year = "1999",
url = "citeseer.ist.psu.edu/article/wang99secure.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
219 Completeness theorems for noncryptographic fault-tolerant di.. (context) - Ben-Or, Goldwasser et al. - 1988
127 Verifiable secret sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989
67 The Byzantine generals strike again (context) - Dolev - 1982
57 Perfectly secure message transmission (context) - Dolev, Dwork et al. - 1993
48 A survey of information authentication (context) - Simmons - 1992
40 Codes which detect deception (context) - Gilbert, MacWilliams et al. - 1974
35 Node- and edge-deletion NP-complete problems (context) - Yannakakis - 1978
32 Issues of Fault Tolerance in Concurrent Computations (context) - Hadzilacos - 1984
24 Fault-tolerant computation in the full information model - Goldreich, Goldwasser et al. - 1998
22 Secure communication in minimal connectivity models - Franklin, Wright - 1998
22 Secure hypergraphs: privacy from partial broadcast - Franklin, Yung - 1995
20 Multiparty unconditional secure protocols (context) - Chaum, Crepeau et al. - 1988
20 Robust sharing of secrets when the dealer is honest or fault.. (context) - Rabin - 1994
9 Trust and security: a new look at the Byzantine generals pro.. (context) - Burmester, Desmedt et al. - 1998
6 A simple and key-economical unconditional authentication sch.. (context) - den Boer - 1993
Documents on the same site (http://cs.uwm.edu/~wang/): More
Genericity, Randomness, And Polynomial-Time Approximations - Wang (1998) (Correct)
Resource-Bounded Balanced Genericity, Stochasticity .. - Ambos-Spies.. (Correct)
The Law of the Iterated Logarithm for p-Random Sequences - Wang (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC