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

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

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Abstract. Patra et al. [25] gave a necessary and sufficient condition for the possibility of almost perfectly secure message transmission protocols 4 tolerating general, non-threshold

Related papers

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

Round-efficient perfectly secure message transmission scheme against general adversary

Kaoru Kurosawa

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

Non-Applicability of Pseudobasis for Designing Perfectly Secure Message Transmission Protocols Against Non-Threshold Adversary.

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra

•Jan 1, 2011•0 citations

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Keith M. Martin, Maura B. Paterson, Douglas R. Stinson

Cryptography and Communications•Dec 15, 2010•16 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

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary

Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan +1 more

Lecture notes in computer science•Aug 12, 2008•9 citations