Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes

Yvo Desmedt, Stelios Erotokritou, Reihaneh Safavi–Naini

Published Jan 1, 2010• 13 citations
Publisher
DOI
10.1007/978-3-642-12678-9_11

Related papers

Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme

Kaoru Kurosawa, Kazuhiro Suzuki

Springer eBooks•Apr 4, 2008•49 citations

Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra

Lecture notes in computer science•Jan 1, 2011•1 citation

Efficient single phase unconditionally secure message transmission with optimum communication complexity

Kannan Srinathan, Ashish Choudhary, Arpita Patra +1 more

ACM Symposium on Principles of Distributed Computing (PODC)•Aug 18, 2008•12 citations

Towards Optimal and Efficient Perfectly Secure Message Transmission

Matthias Fitzi, Matthew Franklin, Juan A. Garay +1 more

Springer eBooks•May 16, 2007•80 citations

Round-efficient perfectly secure message transmission scheme against general adversary

Kaoru Kurosawa

Designs Codes and Cryptography•Jul 16, 2011•2 citations

Efficient 1-Round Almost-Perfect Secure Message Transmission Protocols with Flexible Connectivity

Reihaneh Safavi–Naini, Mohammed Ashraful Alam Tuhin

Mathematics in industry•Jan 1, 2012•0 citations