MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Perfectly Secure Message Transmission." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

8 documents found, showing 1 through 8.

ATOM

Perfectly Secure Message Transmission
by Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung — 1990
…Abstract Perfectly Secure Message Transmission Danny Dolev* Cynthia Dworkt We study the problem…
Cited by 67 (4 self) – Add To MetaCart

Perfectly secure message transmission revisited
by Yvo Desmedt, Yongge Wang — 2002 — In: Proc. Eurocrypt ’02
…Perfectly Secure Message Transmission Revisited (Extended Abstract) Yvo Desmedt 1,2 and Yongge…
Cited by 18 (4 self) – Add To MetaCart

Perfectly Secure Message Transmission Revisited
by unknown authors
…Perfectly Secure Message Transmission Revisited Abstract—Secure communications guaranteeing…
Add To MetaCart

Towards optimal and efficient perfectly secure message transmission
by Matthias Fitzi, Matthew Franklin, S. Harsha Vardhan — 2007 — In Proc. 4th Theory of Cryptography Conference (TCC ’07), Lecture Notes in Computer Science
…Towards Optimal and Efficient Perfectly Secure Message Transmission Matthias Fitzi 1,⋆ , Matthew…
Cited by 2 (2 self) – Add To MetaCart

Probabilistic Perfectly Reliable and Secure Message Transmission: Possibility, Feasibility
by U Rangan
…Probabilistic Perfectly Reliable and Secure Message Transmission: Possibility, Feasibility…
Add To MetaCart

Constructing Disjoint Paths for Secure Communication
by Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu — 2003 — In Proc. of 17th Intl. Conference on Distributed Computing (DISC '03), volume 2848 of Lecture Notes in Computer Science
… Secure Message Transmission Perfectly secure message transmission is a fundamental problem in distributed…
Cited by 6 (3 self) – Add To MetaCart

A complete characterization of tolerable adversary structures for secure point
by Yvo Desmedt, Yongge Wang — 2005 — In Algorithms and Computation, 16th International Symposium, ISAAC 2005
… that the condition is sufficient. We shall describe a message transmission protocol π that is perfectly Z-secure. Let…
Cited by 2 (1 self) – Add To MetaCart

Approximate Quantum ErrorCorrecting Codes and Secret Sharing Schemes
by Claude Crépeau, Daniel Gottesman, Adam Smith — 2005 — In Advances in Cryptology: Proceedings of EUROCRYPT 2005, Springer-Verlag’s Lecture Notes in Computer Science, Volume 3494
…] and “non-interactive Las Vegas perfectly secure message transmission” [23]. “Robust secret sharing” [5…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 8.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB