Results 111 to 120 of about 20,623 (302)
Significant Secret Image Sharing Scheme Based on Boolean Operation
Cybernetics and Information Technologies, 2017 Traditionally, (k, n) secret image sharing is an approach of breaking down a secret image into n number of shadow images to assign them to n number of users, so that any k or more then k users can bring back the secret image.
Verma Monu, Rani Rajneesh
doaj +1 more source
Deep Underground Science and Engineering, EarlyView.The evolution of the temperature field and frozen wall under different fracture conditions was examined by an artificial ground freezing‐based thermal‐hydraulic coupled model. It was observed that fracture inclination affects the interaction extent of freezing pipes and fracture, while phase transition extent is the dominant factor for heat transfer in
Chenyi Zhang +9 more
wiley +1 more source
Deep Underground Science and Engineering, EarlyView.An analytical framework delivers a closed‐form stress solution for lined compressed air energy storage chambers, enabling the determination of the minimum safe burial depth. The solution quantitatively evaluates lining support effectiveness, offering a reliable tool for chamber design and optimization.
Zeyuan Sun +3 more
wiley +1 more source
Deep Underground Science and Engineering, EarlyView.B1 is bord width 1, B2 is bord width 2, L is the pillar length, W is the pillar width, red color and letter A represent the pillars, and white color and number 1 represent excavated areas. Pstress is the average pillar stress; σv is the vertical component of the virgin stress, MPa; and e is the areal extraction ratio. e = B o B o + B P ${\rm{e}}=\frac{{
Tawanda Zvarivadza +4 more
wiley +1 more source
High performance image steganography integrating IWT and Hamming code within secret sharing
IET Image ProcessingSteganography and secret sharing are schemes to increase the security of private information against attackers. Steganography emphasizes secrecy while secret sharing distributes the secret key in shares that are conditionally classified to reconstruct ...
Zahra Saeidi +4 more
doaj +1 more source
, 2007 We consider the following problem. Let S be some secret. A collection of n people Ej share this secret in such a way that each Ej knows some information xj, for a certain fixed integer k, 2≤k≤n, the knowledge of any k of th x’s enables to find S easily, the knowlegde of less than k of the x’s leaves S undetermined.
openaire +1 more source
An improved boolean-based multiple secret images sharing scheme for different sized secret images
, 2016 碩士本論文提出一個可以處理相異尺寸的多重秘密影像分享技術，在此技術中又有兩種處理方式，先將不同尺寸的秘密影像做統一的處理，再利用雜湊函數還有亂數種子產生出亂數影像，透過亂數影像和秘密影像做布林函式運算，最後產出分享影像，在處理的過程中都是利用基本運算，所以在效能上有很好的效率，在安全性上也達成了秘密影像分享的效果，最後更能處理更多不同尺寸的影像。相較其他學者所提出的分享方法，本論文針對多樣性及安全性兩方面做了更佳的改進。在安全性方面，本文採取有幾張秘密影像就生成幾張亂數影像，在得到分享影像時 ...
陳駿龍;Chen, Jyun-Long
core
Deep Underground Science and Engineering, EarlyView.This study demonstrates the feasibility of an underground closed‐loop thermal storage facility at a post‐mining site, intended for seasonal heat energy storage. Its principal design shows water flow directions in winter and summer (1, 2), heat pumps (3), an upper water reservoir (4), and connecting pipes (5).
Dmytro Rudakov, Oleksandr Inkin
wiley +1 more source
Ideal secret sharing schemes from permutations
, 2006 The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing.
Pieprzyk, Josef, Zhang, Xian-Mo
core