This paper proposes a new sub-threshold low power 9T static random-access memory (SRAM) cell compatible with bit interleaving structure in which the effective sizing adjustment of access transistors in write mode is provided  by isolating writing and reading paths. In the proposed cell, we consider a weak inverter to make better write mode operation. Moreover applying boosted word line feature ...

In this paper, we introduce the concept of oblivious transfer with threshold access control. Namely, for each message in a database, the server associates an attribute set τ with it such that the message can only be available, on request, to the users who possess at least t attributes out of τ. Meanwhile, after the server and users execute the protocol, the server will not learn anything about ...

A distributed key generation (DKG) protocol is a central segment in distributed cryptosystems. It permits a gathering of members to mutually produce a pair of keys (private key and public key) without assuming any trusted member. The public key is output in clear but only authorised subgroups of members are able to reconstruct or utilize the private key. Existing study on DKG protocols assumes ...

Designing a secure, resilient and user-friendly access control system is a challenging task. In this article, a threshold-based location-aware access control mechanism is proposed. This design uniquely combines the concepts of secret sharing and distance bounding protocols to tackle various security vulnerabilities. The proposed solution makes use of the fact that the user carries around variou...

Abstract In this article, all multipartite access structures obtained from uniform integer polymatroids were investigated using the method developed by Farràs, Martí-Farré, and Padró. They are matroid ports, i.e., they satisfy necessary condition to be ideal. Moreover, each polymatroid defines some ideal structures. Some objects in family can useful for applications of secret sharing. The prese...

Verifiable secret sharing schemes (VSS) are secret sharing schemes (SSS) dealing with possible cheating by participants. In this paper we use the VSS proposed by Cramer, Damgard and Maurer [6, 7, 5]. They introduced a purely linear algebraic method to transform monotone span program (MSP) based secret sharing schemes into VSS. In fact, the monotone span program model of Karchmer and Wigderson [...