Secret sharing (SS) is a threshold technology that shares a secret value by generating and distributing${n}$shares in the way that a set of any${k}$shares can recover the secret. On the other hand, blockchain is a decentralized system establishing a secure data structure for storing data in the form of a hash chain. Combining SS and blockchain is definitely a promising paradigm in the data security field. Recently, the fast healthcare interoperability resources (FHIRs) standard is defined for medical data exchange across various medical institutions. In this article, we combine SS, ElGamal’s encryption/decryption, and blockchain to propose a multihospital FHIR database authorization (MFDA). To achieve a secure MFDA, the group-based SS (GSS) and the notion using GSS on exponent (referred to as EGSS) are proposed. The secrets of GSS and EGSS have the discrete logarithm problem (DLP) relation, on which the secrets can be used as ElGamal’s private key and public key, respectively. Also, their shares will have DLP relation. By uploading public shares of EGSS on blockchain and using private shares of GSS in a private network, we can recover ElGamal’s public key from a deployed smart contract on blockchain and recover ElGamal’s private key from a qualified set. Meantime, when recovering private key, the private shares of GSS can be authenticated by public shares on blockchain to check tampering and corrupted of private shares during the communication in a private network. Theorems, examples, and experiments demonstrate that the proposed MFDA has efficient and secure database authorization.

In traditional visual cryptography schemes (VCSs), pixel expansion remains to be an unsolved challenge. To alleviate the impact of pixel expansion, several colored-black-and-white VCSs, called CBW-VCSs, were proposed in recent years. Although these methods could ease the effect of pixel expansion, the reconstructed image obtained by these methods may also suffer from low contrasts. To address this issue, we propose a contrast-enhanced (k, n) CBW-VCS based on random grids, named (k,n) RG-CBW-VCS, in this article. By applying color random grids, a binary secret image is encrypted into n color shares that have no pixel expansion. When any k 1 (k 1 > k ) color shares are collected together, the stacked results of them can be identified as the secret image; whereas the superposition of any k 2 ( k 2 < k ) color shares shows nothing. Through theoretical analysis and experimental results, we justify the effectiveness of the proposed (k, n) RG-CBW-VCS. Compared with related methods in feature, contrast, and pixel expansion, the results indicate that the proposed method generally achieves better performance.