The notion of non-malleable cryptography, an extension of semantically secure
cryptography, is defined. Informally, the additional requirement is that given the ciphertext it …

A secret-sharing scheme is a method by which a dealer distributes shares to parties such
that only authorized subsets of parties can reconstruct the secret. Secret-sharing schemes …

Quorum systems are well-known tools for ensuring the consistency and availability of
replicated data despite the benign failure of data repositories. In this paper we consider the …

This work describes schemes for distributing between n servers the evaluation of a function f
which is an approximation to a random function, such that only authorized subsets of servers …

A distributed mobility management scheme using a class of uniform quorum systems (UQS)
is proposed for ad hoc networks. In the proposed scheme, location databases are stored in …

We prove that three apparently unrelated fundamental problems in distributed computing,
cryptography, and complexity theory, are essentially the same problem. These three …

Quorum Bystems are well-known tools for ensuring the consistency and availability of
replicated data despite the benign failure of data repositones. In this paper we consider the …

As a well-known secret image sharing scheme, Thien-and-Lin's scheme generates shadow
images of reduced size, which is beneficial for storage, transmission, and processing …

In this paper, we propose an enhanced security framework for securing the cloud users data
in the cloud environment. This new security framework consists of access control …

Developments in digital technology and manufacturing processes have expanded the
horizon of designer innovation in creating products. In addition to this, real-time collaborative …