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

Asynchronous Secure Communication Tolerating Mixed Adversaries

Kannan Srinathan, Mrinal Kumar, Chandrasekharan Pandu Rangan

Published Jan 1, 2002• 14 citations
Publisher
DOI
10.1007/3-540-36178-2_14

Related papers

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

Mrinal Kumar, Kannan Srinathan, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2002•7 citations

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary

Arpita Patra, Ashish Choudhary, Kannan Srinathan +1 more

Lecture notes in computer science•Sep 5, 2007•9 citations

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar +2 more

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

Perfectly Secure Message Transmission Tolerating Mixed Adversary.

Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar +2 more

•Jan 1, 2008•0 citations

Asynchronous Perfectly Secure Communication over One-Time Pads

Giovanni Di Crescenzo, Aggelos Kiayias

Lecture notes in computer science•Jan 1, 2005•9 citations

Asynchronous Secure Communication Tolerating Mixed Adversaries

Kannan Srinathan, Manoranjan Kumar, U Rangan

Abstract. We study the problem of secure communication tolerating generalized mixed adversaries across an underlying completely asynchronous incomplete network. We explore the interplay between the minimal network connectivity required and the degree of security attainable, and completely characterize the network requirements for attaining perfect and unconditional (with negligible error) security. We also consider networks with additional broadcast capabilities and prove that unconditionally secure communication can be achieved with much lesser connectivity if the network assures the broadcast primitive. 1

•Apr 1, 2008•0 citations
Abstract. We study the problem of secure communication tolerating generalized mixed adversaries across an underlying completely asynchronous incomplete network. We explore the interplay between the minimal network connectivity required and the degree of security attainable, and completely characterize the network requirements for attaining perfect and unconditional (with negligible error) security. We also consider networks with additional broadcast capabilities and prove that unconditionally secure communication can be achieved with much lesser connectivity if the network assures the broadcast primitive. 1