In this paper, a novel key management model and algorithm for two-tier architecture network are proposed based on elliptic curve cryptosystem (ECC) combined with public key (CPK) technology, verifiable secret sharing technology, and two-tier architecture network technology. This novel key management algorithm is composed of several sub-algorithms, such as key generation, key update, nodes joini...

By adopting a non-interactive information-theoretic secure verifiable secret sharing scheme in an unorthodox way, a verifiable fingerprint vault scheme is presented in this paper. Fuzzy vault scheme is a novel cryptographic construct which can increase the security of the biometric template in a biometric authentication system. It can be also used to bind the cryptographic key and the user in a...

We present a general treatment of all non-cryptographic (i.e., information-theoretically secure) linear verifiable-secret-sharing (VSS) and distributed-commitment (DC) schemes, based on an underlying secret sharing scheme, pairwise checks between players, complaints, and accusations of the dealer. VSS and DC are main building blocks for unconditional secure multi-party computation protocols. Th...

We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Because an LSSS neither guarantees reconstructability when some shares are false, nor verifiability of a shared value, nor allow...

This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and Shoup based on Paillier’s decision composite residuosity assumption, along with efficient protocols for verifiable encryption and decryption of discrete logarithms (and more generally, of representations ...

The ( ) , t n threshold secret sharing scheme proposed by Shamir (1979) encodes the secret key into n shares and those shares are distributed among the participants. Each share incorporates an x-value uniquely designated for every single participant. If the shares are distributed on insecure (or public) channels, malicious users may acquire a few (or all) shares. If the number of shares obtaine...