End-to-end authenticity in public networks plays a significant role. Namely, without
authenticity, the adversary might be able to retrieve even confidential information straight …

We study the problem of achieving global broadcast in a radio network where a node can
multicast messages to all of its neighbors (that is, nodes within some given distance r), and …

Secure communications guaranteeing reliability and privacy (without unproven
assumptions) in networks with active adversaries has been an important research issue. It …

Web services (WS) received significant attention recently because services can be
searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic …

Abstract We study the Reliable Broadcast problem in incomplete networks against a
Byzantine adversary. We examine the problem under the locally bounded adversary model …

Secure multiparty computation (MPC) on incomplete communication networks has been
studied within two primary models:(1) where a partial network is fixed a priori, and thus …

We study the interplay of network connectivity and the issues related to the'possibility','
feasibility'and'optimality'for unconditionally reliable message transmission (URMT) and …

In the model of perfectly secure message transmission (PSMT) schemes, there are n
channels between a sender and a receiver. An infinitely powerful adversary A may corrupt …

In the model of perfectly secure message transmission schemes (PSMTs), there are n
channels between a sender and a receiver. An infinitely powerful adversary may corrupt …

Security is often investigated in terms of a single goal (eg, confidentiality), but in practical
settings mostly a compound property comprising multiple and often interdependent aspects …