Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

Abstract Given an unsatisfiable Boolean formula F in CNF, subset of clauses U is called Minimal Unsatisfiable Subset (MUS) if every proper satisfiable. Since MUSes serve as explanations for the unsatisfiability , find applications a wide variety domains. The availability efficient SAT solvers has aided development scalable techniques finding and enumerating past two decades. Building on recent ...

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 are able to compute the function. A user who wants to compute f(x) should send x to the members of an authorized subset and receive information which enables him to compute f(x). We require that such a scheme i...

A hierarchical threshold secret image sharing (HTSIS) scheme is a method to share a secret image among a set of participants with different levels of authority. Recently, Guo et al. (2012) [22] proposed a HTSIS scheme based on steganography and Birkhoff interpolation. However, their scheme does not provide the required secrecy needed for HTSIS schemes so that some non-authorized subsets of part...

We introduce and analyse approximate quantum secret sharing in a formal cryptographic setting, wherein dealer encodes distributes to players such that authorized structures (sets of subsets players) can approximately reconstruct the omnipotent adversarial agents controlling non-authorized are denied secret. In particular, viewing map encoding shares for an structure as channel, we show reconstr...

A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal relaxations and minimal explanations for over-constrained problems find many practical uses. For Boolean formulas, minimal relaxations of over-constrained problems are referred to as Minimal Correction Subsets (MCSes). MCSes find many applications, including the enumeration of MUSes. Existing approaches fo...