
Citation: Yong Wang, Li-qun Gu. Biomedical diagnosis perspective of epigenetic detections using alpha-hemolysin nanopore[J]. AIMS Materials Science, 2015, 2(4): 448-472. doi: 10.3934/matersci.2015.4.448
[1] | Lina Zhang, Jing Zhang, Jiaqi Sun, Qingpeng Chen . A global progressive image secret sharing scheme under multi-group joint management. Mathematical Biosciences and Engineering, 2024, 21(1): 1286-1304. doi: 10.3934/mbe.2024055 |
[2] | Xiaoping Li, Yanjun Liu, Hefeng Chen, Chin-Chen Chang . A novel secret sharing scheme using multiple share images. Mathematical Biosciences and Engineering, 2019, 16(6): 6350-6366. doi: 10.3934/mbe.2019317 |
[3] | Feng Liu, Xuehu Yan, Lintao Liu, Yuliang Lu, Longdan Tan . Weighted visual secret sharing with multiple decryptions and lossless recovery. Mathematical Biosciences and Engineering, 2019, 16(5): 5750-5764. doi: 10.3934/mbe.2019287 |
[4] | Guozheng Yang, Lintao Liu, Xuehu Yan . A compressed secret image sharing method with shadow image verification capability. Mathematical Biosciences and Engineering, 2020, 17(4): 4295-4316. doi: 10.3934/mbe.2020237 |
[5] | Li-na Zhang, Jia-qi Sun, Xiao-yu Zhang, Qing-peng Chen, Jing Zhang . Two-level QR code scheme based on region matrix image secret sharing algorithm. Mathematical Biosciences and Engineering, 2023, 20(9): 16678-16704. doi: 10.3934/mbe.2023743 |
[6] | Jingju Liu, Lei Sun, Jinrui Liu, Xuehu Yan . Fake and dishonest participant location scheme in secret image sharing. Mathematical Biosciences and Engineering, 2021, 18(3): 2473-2495. doi: 10.3934/mbe.2021126 |
[7] | Li-na Zhang, Chen-yu Cui, Xiao-yu Zhang, Wei Wu . Adaptive visual cryptography scheme design based on QR codes. Mathematical Biosciences and Engineering, 2022, 19(12): 12160-12179. doi: 10.3934/mbe.2022566 |
[8] | Yanjun Liu, Chin-Chen Chang, Peng-Cheng Huang . Security protection using two different image shadows with authentication. Mathematical Biosciences and Engineering, 2019, 16(4): 1914-1932. doi: 10.3934/mbe.2019093 |
[9] | Xingxing Jia, Yixuan Song, Daoshun Wang, Daxin Nie, Jinzhao Wu . A collaborative secret sharing scheme based on the Chinese Remainder Theorem. Mathematical Biosciences and Engineering, 2019, 16(3): 1280-1299. doi: 10.3934/mbe.2019062 |
[10] | Song Wan, Guozheng Yang, Lanlan Qi, Longlong Li , Xuehu Yan, Yuliang Lu . Multiple security anti-counterfeit applications to QR code payment based on visual secret sharing and QR code. Mathematical Biosciences and Engineering, 2019, 16(6): 6367-6385. doi: 10.3934/mbe.2019318 |
Secret image sharing (SIS) belongs to but differs from secret sharing, and image is widely used and covers many privacies [2,1], thus, SIS should be specially studied and designed. In a $ (k, n) $ threshold SIS scheme, it aims at splitting a secret image into $ n $ shadows, i.e., shares or shadow images, which are then assigned to $ n $ participants. The secret can be disclosed by any $ k $ or more shadows while less than $ k $ shadows gain nothing of the secret. SIS can be applied to many scenarios, such as key management, access control, information hiding, authentication, watermarking, transmitting passwords, and distributed storage and computing in cloud computing [3,4,5,6,7,8]. In the field of SIS research, there are mainly Shamir's polynomial-based scheme [9] and visual secret sharing (VSS) [10] also called visual cryptography scheme (VCS) [11].
Shamir's original polynomial-based SIS [9,12] for $ (k, n) $ threshold splits a secret image into the constant coefficient of a random $ (k-1) $-degree polynomial to generate $ n $ shadows, which are then assigned to $ n $ participants. The secret image can be disclosed with high-resolution by means of Lagrange interpolation with any $ k $ or more shadows. Inspired by Shamir's original scheme, some researchers [13,14,15,16,17,18] proposed more polynomial-based schemes to possess more features. Although polynomial-based SIS only needs $ k $ shadows for disclosing the distortion-less secret image, it has high computational complexity because of Lagrange interpolation and "all-or-nothing".
In $ (k, n) $ threshold VSS [19,20,21,22,23,24], the outputted $ n $ shadows are printed onto transparencies and then assigned to $ n $ participants. The beauty of VSS is that the secret image is disclosed by superposing any $ k $ or more shadows with human native eyes and no cryptographic computation. Collecting less than $ k $ shadows will in general give no clue about the secret image even a watchdog owns infinite computation power. Unfortunately, original VSS suffers from codebook design, pixel expansion problem, low contrast and "all-or-nothing", which are taken into account by the following works [23,25,26,27,28,29,30,31,32]. Furthermore, most of the existing VSS schemes have limitations of lossy recovery and "all-or-nothing" [29,33,34].
In contrast to "all-or-nothing", progressive secret image sharing (PSIS) [33,35,36,37,38] achieves the characteristic that the more shadows the better disclosed secret image quality. PSIS is useful in many multimedia applications, such as art work image vending, Pay-TV/Music, multi-level representation and degraded encryption, where we need to intentionally disclose the multimedia with a degraded but recognizable quality so as to protect the details in addition to multimedia content. Unfortunately, conventional PSIS may be lossy recovery. Progressiveness can be divided into global progressiveness and regional progressiveness. Global progressive PSIS mainly protects the detail of the secret image progressively, while regional progressive PSIS mainly protects the secret image region by region. Since the paper intends to protect the detail of the secret image, we focus on global progressiveness in this article. However, PSIS is mainly for $ (k, n) $ threshold, where lossless recovery is seldom achieved.
Based on above analyses, conventional SIS has the drawback of "all-or-nothing" and conventional PSIS has the limitation of lossy recovery. Thus, we intend to propose ramp SIS which achieves both progressive and lossless recovery by a unique disclosing method.
In this article, first we introduce ramp SIS definition according to image features and ramp secret sharing [39,40,41]. Then we propose $ (k_1, k_2, n) $ ramp SIS based on the Chinese remainder theorem (CRT) [42,43,44]. In the proposed ramp, i.e., $ (k_1, k_2, n) $ threshold, CRT-based SIS, when we collect any $ k_1 $ or more and less than $ k_2 $ shadows, the secret image will be disclosed in a progressive way [45]. On the other hand, when we collect any $ k_2 $ or more shadows, the secret image will be disclosed losslessly. Furthermore, the disclosing method is only modular arithmetic resulting in ability in real-time application. We give theoretical analyses and experiments to display the effectiveness of our method.
Our method allows the purchaser to review the secret with a degraded quality by collecting less shadows prior to buying them. Then the purchaser can obtain the lossless version by collecting more shadows after he decides to buy it. Image generally differs from data, thus the progressive feature with poor quality of image makes sense to some applicable scenarios. The progressive feature achieves that the quality of the image can be partially degraded. Such perceptibility makes it possible for the potential purchasers to view low-quality copies of the image prior to buying them.
A detailed scenario is given as follows. In the process of displaying and selling an art image, since the details are very important for the art image, details should be protected. After sharing the art image once, the owner can disclose and present different image qualities to different people on different occasions, instead of sharing again. For example, in an exhibition, first the owner can demonstrate a low quality of the art image with any $ k_1 $ or more shadows to prove the copyright of the art, then after reaching a purchase agreement he shows the lossless quality with any $ k_2 $ or more shadows.
The detailed advantages and contributions of the proposed approach are as follows.
$ 1. $ A formal definition of ramp SIS is first introduced.
$ 2. $ $ (k_1, k_2, n) $ ramp SIS based on CRT is proposed. We use CRT due to the following advantages comparing to polynomial-based SIS. On one hand, CRT-based SIS can achieve lossless recovery, while most of the polynomial-based SIS schemes are in general lossy. On the other hand, the disclosed operation of polynomial-based SIS is Lagrange's interpolation ($ O(k\log ^2 k) $), while that of CRT-based SIS is only modular operation ($ O(k) $) [44], therefore, CRT-based SIS has lower computational cost than polynomial-based SIS to disclose the secret image.
$ 3. $ The secret image is decoded by only modular operation. When we collect any $ k_2 $ or more shadows, the secret image will be disclosed losslessly, which outperforms polynomial-based SIS due to lossy recovery for secret pixel value larger than 250 if 251 is selected as the prime value in polynomial-based SIS.
The rest of the paper is organized as follows. Section 2 introduces ramp SIS definition and some basic requirements for the proposed method. In section 3, the proposed method and its analyses are presented in detail. Section 4 gives the security analyses of typical SIS schemes. Section 4 is devoted to experimental results. Finally, section 5 concludes this paper.
In this section, we will give some preliminaries. In conventional $ (k, n) $ threshold SIS, an original secret image $ S $ is encrypted into $ n $ shadows $ SC_1, SC_2, \cdots SC_n $, and the decrypted secret image $ {S}' $ is disclosed from any $ t $ ($ k \le t \le n, t \in {\rm Z}^ + $) shadows.
CRT was first exploited in the Western han dynasty of China as well as formally introduced in the southern and northern dynasties. It intends to solve a set of linear congruence equations.
When we choose a set of integers $ {m_i }(i = 1, 2, \cdots, k) $ satisfying $ \gcd \left({m_i, m_j } \right) $$ = 1, i \ne j $, then there is a unique solution $ y \equiv \left({a_1 M_1 M_1^{ - 1} + a_2 M_2 M_2^{ - 1} + \cdots + a_k M_k M_k^{ - 1} } \right)\left({\bmod \; M} \right) $, $ y \in \left[ {0, M - 1} \right] $) to Eq. (2.1).
$ y≡a1(modm1)y≡a2(modm2)⋯y≡ak−1(modmk−1)y≡ak(modmk) $
|
(2.1) |
where $ M = \prod\nolimits_{i = 1}^k {m_i } $, $ {{M}_{i}}={{M}_{/{{m}_{i}}}}$ and $ M_i M_i^{ - 1} \equiv 1\left({\bmod \; m_i } \right) $.
Proof. Since $ \gcd \left({m_i, m_j } \right) = 1, i \ne j $, $ \gcd \left({m_i, M_i } \right) = 1 $ and we have $ M_i^{ - 1} $ subject to $ M_i M_i^{ - 1} \equiv 1\left({\bmod \; m_i } \right) $.
For $ a_1 M_1 M_1^{ - 1} $, we have
$ aiMiM−1i≡ai(modmi),i≠j $
|
(2.2) |
$ aiMiM−1i≡ai(modmj), $
|
(2.3) |
According to Eqs. (2.2) and (2.3), $ y \equiv \left({a_1 M_1 M_1^{ - 1} + a_2 M_2 M_2^{ - 1} + \cdots + a_k M_k M_k^{ - 1} } \right)\left({\bmod \; M} \right) $, $ y \in \left[ {0, M - 1} \right] $ subject to Eq. (2.1).
Thus, on one hand, $ y $ is one solution to Eq. (2.1).
On the other hand, if both $ y_1 $ and $ y_2 $ are solutions to Eq. (2.1), we have $ y_1 -y_2 \equiv 0\left({\bmod \; m_i } \right) $. Since $ \gcd \left({m_i, m_j } \right) = 1, i \ne j $, $ M $ is exactly divided by $ y_1 -y_2 $. In addition, $ y $ is one solution to Eq. (2.1), thus, the set of solutions to Eq. (2.1) is $ \left\{ {zM + y\left| {z \in \bf{Z}} \right.} \right\} $.
Therefore, there is a unique solution $ y \equiv \left({a_1 M_1 M_1^{ - 1} + a_2 M_2 M_2^{ - 1} + \cdots + a_k M_k M_k^{ - 1} } \right)\left({\bmod \; M} \right) $, $ y \in \left[ {0, M - 1} \right] $) to Eq. (2.1).
CRT will be utilized in the proposed scheme to possess $ (k_x, n) $ threshold, where $ 2 \le k_1 \le k_x \le k_2 \le n $. Both Polynomial-based SIS and CRT-based SIS are well studied. We use CRT in our scheme due to the following advantages and differences.
● The shadow size of polynomial-based SIS is easier to be reduced.
● CRT-based SIS easily achieves lossless reconstruction, while most polynomial-based SIS schemes are not lossless.
● The disclosing operation is Lagrange's interpolation ($ O(k log^2 k) $ in polynomial-based SIS, while that is modular operation ($ O(k) $ [46]) in CRT-based SIS, thus CRT-based SIS has lower computational complexity than polynomial-based SIS to disclose the secret image.
● The principle of CRT-based SIS is complex and hard to be understood.
● The number of owners is in general not limited in polynomial-based SIS, while that in CRT-based SIS is small like n ≤ 6, because as n increases the available value of mi decreases, which will affect the distribution of the values of the shadow pixels and therefore further may lead to secure issue.
Digital image differs from pure electronic data, where the differences mainly have:
● An image includes many pixels, which have correlations between adjacent ones, such as structure, texture, edge and other related information. The correlations are important to security and hence need to be considered in SIS algorithm design. Thus, SIS should encrypt not only the pixel values but also the correlations between adjacent pixels.
● There are lots of pixels in an image so that computational complexity of SIS should be considered.
● An image owns special file storage structure. Using grayscale image as an example, its pixel value is in the range of $ \left[ {0,255} \right] $, which should be satisfied in SIS design, e.g., the output value, the input value, and other relative parameters, should lie in the range. For example, the secret pixel value range and the shadow pixel value range should not exceed the range. In addition, we have $ {m_i } \le 256 $ when applying to CRT.
● An image is a specific form of the data, where each grayscale (binary) pixel is represented as one byte (bit), so SIS is easily to be applied to secret sharing.
● In general, secret data is available only if it is losslessly recovered. Whereas, an image may be useful when recovered with some errors because of human eyes' low pass filter feature, thus, progressiveness makes sense to SIS.
The above differences lead to that in general traditional secret sharing cannot be directly applied to SIS. In particular, CRT-based ramp secret sharing cannot be directly applied to CRT-based ramp SIS.
Definition 1. A SIS splits a secret image, denoted as $ S $, into $ n $ shadow images, denoted as $ SC_1, SC_2, \cdots SC_n $. We say the SIS is a $ (k_1, k_2, n) $ ramp SIS subject to:
● security condition. The secret image cannot be reconstructed with any less than $ k_1 $ shares.
● ramp recovery condition. The secret image will be reconstructed progressively with any $ k_1 $ or more and less than $ k_2 $ shares. The reconstructed image quality increases with the number of shares from $ k_1 $ to $ k_2 $.
● decodable condition. The secret image is decoded with any $ k_2 $ or more shares.
If $ k_1 = k_2 = k $, $ (k_1, k_2, n) $ ramp SIS will reduce to $ (k, n) $-threshold SIS. The ramp SIS is called linear ramp SIS if the reconstructed image quality increases linearly with the number of shares from $ k_1 $ to $ k_2 $.
In VSS, contrast is generally used, which is also adopted in this paper to evaluate the quality in VSS. In polynomial-based SIS, in general due to lossless recovery the metrics are seldom considered. In the research field of image processing, there are many metrics to evaluate image quality, where some typical metrics will be directly adopted in this paper.
The visual quality in VSS, which can decide how well human eyes can recognize the disclosed image, of the disclosed secret image $ S' $ corresponding to secret image $ S $ can be overall evaluated by contrast as follows [28].
Definition 2.
$ α=P0−P11+P1=P(S′[AS0]=0)−P(S′[AS1]=0)1+P(S′[AS1]=0) $
|
(2.4) |
Where $ \alpha $ is contrast, $ P_0 $ (resp., $ P_1 $) means the probability of white pixels in the disclosed image $ {S}' $ for the corresponding white (resp., black) area in secret image $ S $, that is, $ P_0 $ denotes correctly decrypted probability corresponding to white area in secret image $ S $, and $ P_1 $ denotes wrongly decrypted probability corresponding to black area in secret image $ S $.
Since lossless disclose or nothing, i.e., "all-or-nothing", conventional SIS for grayscale image omits to discuss quality evaluation of disclosed secret image. Progressiveness differs from "all-or-nothing", therefore, we should discuss the quality evaluation of the disclosed gray secret image. The following typical objective metrics will be adopted to evaluate the image quality between $ S' $ and $ S $.
$ 1. $ Peak signal-to-noise-ratio (PSNR): PSNR, in Eq. (2.5), between the primary image $ I $ with size of M$ \times $N and modified image $ I' $ is adopted to measure the image similarity, where MSE as Eq. (2.6) denotes the mean square error.
$ PSNR=10log10(2552MSE)dB $
|
(2.5) |
$ MSE=1M×NM∑i=1N∑j=1[I′(i,j)−I(i,j)]2 $
|
(2.6) |
$ 2. $ Structural similarity index measure (SSIM) [47] is to assess the visual impact of three characteristics in an image, i.e., luminance, contrast and structure, which gains a multiplicative combination of the above three terms, as Eq. (2.7). The value of SSIM is in -1 and 1. The larger SSIM results in higher image similarity.
$ SSIM(x,y)=[l(x,y)]α⋅[c(x,y)]β⋅[s(x,y)]γ $
|
(2.7) |
where
$ l\left({x, y} \right) = \frac{{2\mu _x \mu _y + C_1 }}{{\mu _x^2 + \mu _y^2 + C_1 }} \\ c\left({x, y} \right) = \frac{{2\sigma _x \sigma _y + C_2 }}{{\sigma _x^2 + \sigma _y^2 + C_2 }} \\ s\left({x, y} \right) = \frac{{2\sigma _{xy} + C_3 }}{{\sigma _x \sigma _y + C_3 }} \\ $
$ \mu _x, \mu_y, \sigma_x, \sigma_y, and\; \sigma_{xy} $ are the local means, standard deviations, and cross-covariance for images $ x, y $. In this paper, we set $ C_3 = \frac{{C_2 }}{2}, \alpha = \beta = \gamma = 1 $.
$ 3. $ NC is to evaluate the quality between the original secret image and the disclosed secret image, as Eq. (2.8).
$ NC(I,I′)=1M∑i=1N∑j=1I2(i,j)M∑i=1N∑j=1I(i,j)×I′(i,j) $
|
(2.8) |
$ 4. $ The universal quality index (UQI) [48] can reflect the distortion of the disclosed secret image with its original secret image, whose value is between -1 and 1. The larger UQI means better quality. The block size of UQI is 8 in this paper. For details please refer to [48].
In addition, contrast can decide how well human eyes recognize the disclosed binary secret, so that it is expected to be as great as possible to obtain better visual quality. About how the contrast values map to the quality of the disclosed image, please refer to [49]. Herein, in order to show some intuitions about the expected performance, we have the followings.
$ 1. $ When $ \alpha \in $ [0, 0.03], one cannot recognize the secret image.
$ 2. $ When $ \alpha \in $ (0.03, 0.14], one can see a little information of the secret image.
$3. $ When $ \alpha \in $ (0.14, 0.21], the secret image is recognized with acceptable quality.
$ 4. $ When $ \alpha \in $ (0.21, 1], the secret image is fast recognized with good quality.
About how the PSNR values map to the image quality [50], we may refer to the followings.
$ 1. $ When PSNR $ \in $ [28.5, $ + \infty $], the image quality is very good.
$ 2. $ When PSNR $ \in $ [23.0, 28.5), the image quality is good.
$ 3. $ When PSNR $ \in $ [19.5, 23.0), the image quality is medium.
$ 4. $ When PSNR $ \in $ [17.0, 19.5), the image quality is poor.
$ 5. $ When PSNR $ \in $ [0, 17.0), the image quality is bad.
Algorithm 1. The proposed $ (k_1, k_2, n) $ ramp SIS |
Input: A secret image $ S $ with size of H$ \times W $ and threshold parameters $ (k_1, k_2, n) $, where $ 2 \le k_1 \le k_2 \le n $. Output: $ n $ shadows $ SC_1, SC_2, \cdots SC_n $ and corresponding private integers $ m_1, m_2, \cdots m_n $. |
Step 1: Choose a set of integers $ \left\{ {128 \le p < m_1 < m_2 \cdots < m_n \le 256} \right\} $ to satisfy $ 1.$ $ \gcd \left({m_i, m_j } \right) = 1, i \ne j $. $ 2.$ $ \gcd \left({m_i, p} \right) = 1 $ for $ i = 1, 2, \cdots, n $. $ 3.$ $ M_{k_x} > pN_{k_x} $ for any $ 2 \le k_1 \le k_x \le k_2 $. where $ M_{k_x} = \prod\nolimits_{i = 1}^{k_x} {m_i } $, $ N_{k_x} = \prod\nolimits_{i = 1}^{{k_x} - 1} {m_{n - i + 1} } $ and $ p $ is public. Step 2: Calculate $ T_{k_x} = \left[ {\frac{{\left\lfloor {\frac{M_{k_x}}{p} - 1} \right\rfloor - \left\lceil {\frac{N_{k_x}}{p}} \right\rceil }}{2} + \left\lceil {\frac{N_{k_x}}{p}} \right\rceil } \right] $ for $ k_x = k_1, k_1+1, \cdots k_2 $ and $ T_{k_x} $ is public as well among all the participants. For each coordinate $ (h, w)\in \{(h, w)\vert 1 \le h \le H, 1 \le w \le W\} $, repeat Steps 3-5. Step 3:For now processing pixel value $ s = S(h, w) $, we select randomly a threshold $ {{k_x}^*} $ in $ [k_1, k_2] $. Step 4:If $ 0 \le x < p $, randomly pick up an integer $ A $ in $ \left[ {T_{{k_x}^*} + 1, \left\lfloor {\frac{M_{{k_x}^*}}{p} - 1} \right\rfloor } \right] $ and compute $ y = s + Ap $. Else randomly pick up an integer $ A $ in $ \left[ {\left\lceil {\frac{N_{{k_x}^*}}{p}} \right\rceil, T_{{k_x}^*}} \right) $ and $ y = s-p + Ap $. Step 5:Calculate $ a_i \equiv y\left({\bmod \; m_i } \right) $ and compute $ SC_{i}(h, w) = a_i $ for $ i = 1, 2, \cdots, n $. Step 6: Output $ n $ shadows $ SC_{1}, SC_{2}, \cdots SC_{n} $ and their private corresponding integers $ m_1, m_2, \cdots m_n $. |
We give the proposed $ (k_1, k_2, n) $ ramp SIS based on CRT in Algorithm 1 with an original secret image $ S $ leading to $ n $ output shadows $ SC_1, SC_2, \cdots SC_n $ and private corresponding integers $ m_1, m_2, \cdots m_n $. The recovery Steps are described in Algorithm 2.
In Algorithm 1 and Algorithm 2, we find that.
$ 1. $ In Step 1 of the proposed Algorithm 1, $ \left\{ {128 \le p < m_1 < m_2 \cdots < m_n \le 256} \right\} $ is given due to image pixel value range and $ pN_{k_x} < M_{k_x} $. We suggest here that $ p $ is as small as possible for security and $ m_i $ is as large as possible, thus, the pixel values of shadow will be randomly distributed in large range.
$ 2. $ $ \gcd \left({m_i, m_j } \right) = 1 $ and $ \gcd \left({m_i, p} \right) = 1 $ intend to satisfy CRT conditions, where $ m_i $ may be preserved as the private key for participant $ i $ or may be public. $ \gcd \left({m_i, p} \right) = 1 $ is on account of not only applicable CRT but also containing all possible pixel values in range $ [0, m_i) $ for shadow $ SC_i $. We note that, our method can accommodate only a constant number of participants because in Step 1 of Algorithm 1 one has to choose $ n+1 $ integers between 128 and 256, which must be pairwise relatively prime and whose available numbers are more than 23 but less than 128. However, these numbers can satisfy general applications.
Algorithm 2. Recovery for the proposed scheme. |
Input: $ t $ shadows $ SC_{i_1}, SC_{i_2 }, \cdots SC_{i_t } $, their corresponding private integers $ m_{i_1}, m_{i_2}, \cdots m_{i_t} $, $ p $ and $ T_{k_x} $ for $ k_x = k_1, k_1+1, \cdots k_2 $, where $ k_1 \le t $. Output: A H $ \times $ W disclosed secret image $ S' $. |
Step 1:For each coordinate $ (h, w) \in \left\{ {(h, w)\vert 1 \le h \le H, 1 \le w \le W} \right\} $, repeat Steps 2-5. Step 2:Calculate $ a_{i_j} = SC_{i_j}(h, w) $ for $ j = 1, 2, \cdots, t $. Let's solve the following linear equations according to CRT. $y ≡ai1(modmi1)y ≡ai2(modmi2) ⋯y ≡ail−1(modmit−1)y ≡ait(modmit) (3.1) $ Step 3:Calculate $ T^* = \left\lfloor {\frac{y}{p}} \right\rfloor $. Step 4:For $ k_x = k_1, k_1+1, \cdots k_2 $, if $ T^* \ge T_{k_x} $, let $ s_{k_x} \equiv y\left({\bmod \; p} \right) $; otherwise let $ s_{k_x} = y\left({\bmod \; p} \right)+p $. Step 5:$ {k_x}^* = \mathop {\arg \; \min }\limits_{k_x \in [k_1, k_2]} \left\{ {\left. {k_x } \right|s_{k_x } = s_{k_x + 1} = \cdots = s_{min(t, k_2)} } \right\} $. Set $ S'(h, w) = s_{{k_x}^*} $. Step 6:Output the disclosed secret image $ S' $. |
$ 3. $ In Step 2 of Algorithm 1, $ T_{k_x} $ divides interval $ \left[ {\left\lceil {\frac{N_{k_x}}{p}} \right\rceil, \left\lfloor {\frac{M_{k_x}}{p} - 1} \right\rfloor } \right] $ into two parts with a view to classify $ 0 \le x < p $ or $ p \le x \le 255 $ according to Step 4 of Algorithm 2. As a result, $ s $ can be losslessly disclosed for arbitrary $ x \in \left[ {0,255} \right] $.
$4. $ In Step 4 of our Algorithm 1, we know $ A $ is randomly picked up from $ \left[ {\left\lceil {\frac{N_{k_x}}{p}} \right\rceil, \left\lfloor {\frac{M_{k_x}}{p} - 1} \right\rfloor } \right] $, thus, $ N_{k_x} \le y < M_{k_x} $ in order to obtain $ (k_x, n) $ threshold for $ y $ as explained in Section 2.1.
$ 5. $ In Step 4 of Algorithm 1, $ A $ is randomly selected for every secret pixel $ s $, hence $ y = s + Ap $ can enlarge $ s $ value in order to scramble both the correlations between adjacent pixels and the secret pixel value without auxiliary encryption.
$ 6. $ In Step 4 of Algorithm 1, $ y = s + Ap $ and $ s < p $ will determine a unique $ s $ according to $ s \equiv y\left({\bmod \; p} \right) $.
$ 7. $ In the recovery phase, for the current processing location $ (h, w) $, we do not know its threshold, thus, in Steps 4–5 of Algorithm 2 we search for the minimum threshold satisfying losslessly recovering the original secret pixel $ s $, denoted as $ {k_x}^* $.
$ 8. $ Our $ (k_1, k_2, n) $ threshold extension method may be also suitable for other SIS, such as polynomial-based SIS.
Moreover, we explain the differences between Algorithm 1 and the classical ones as follows.
$ 1. $ Ramp SIS has not been formally introduced before our work.
$ 2. $ CRT is first applied to Algorithm 1 to achieve ramp SIS.
$ 3. $ Steps 1–4 of Algorithm 1 are different from the classical CRT-based SIS schemes since Steps 1–4 will achieve ramp SIS proved in Section 3.2.
We will show performances of the proposed method by theoretically analyzing the security, visual recognition and valid ramp threshold construction. In Theorem 1, we will prove that the proposed scheme is a valid $ (k_1, k_2, n) $ ramp SIS construction. Prior to the proof of Theorem 1, some Lemmas are given. Without loss of generality, in the following analyses, we assume that $ {{k_x}^*} = {{k_0}} $ threshold is selected in Step 3 of Algorithm 1 for now processing pixel value $ s = S(h, w) $.
Lemma 1. Each shadow generated by our method gives no clue about the secret image.
Proof.
From $ y = s + Ap $ or $ y = s-p + Ap $ and $ a_i \equiv y\left({\bmod \; m_i } \right) $, we will prove $ SC_i(h, w) = a_i $ is random in range $ [0, m_i) $.
If $ A $ is fixed, since $ s $ represents the pixel value of secret image, we assume $ s $ and $ s-p $ is random in range $ [0,255] $. Due to $ a_i \equiv (s + Ap)\left({\bmod \; m_i } \right) $, we have $ a_i $ is random in range $ [0, m_i) $.
On the other hand, if $ s $ is fixed, $ \gcd \left({m_i, p} \right) = 1 $, thus, $ Ap\left({\bmod \; m_i} \right) $ will cover all possible values in range $ [0, m_i) $. We have $ s+Ap\left({\bmod \; m_i} \right) $ will cover all possible values in range $ [0, m_i) $ as well. As a result, we have $ a_i $ is random in range $ [0, m_i) $.
Thus, the Lemma is proved to be met.
Lemma 2. In the proposed scheme, any $ k_0 $ or more shadow pixels can disclose the secret pixel losslessly.
Proof. Since $ s $ represents the pixel value of secret image, we will prove any $ k_0 $ or more shadows can disclose $ s $ losslessly.
In order to disclose $ s $, we only need to find $ y $ due to $ s \equiv y\left({\bmod \; p} \right) $ or $ s \equiv y\left({\bmod \; p} \right)+p $.
When $ a_{i_1}, a_{i_2 }, \cdots a_{i_{k_0} } $ are given, according to CRT, there exists only solution $ y $ modulo $ N_1 = \prod\nolimits_{j = 1}^{k_0} {m_{i_j } } $ since $ N_1 \ge M_{k_0} $. Finally we can uniquely determine $ y $ and thus, $ s $ based on Steps 4-5 of our Algorithm 2.
Lemma 3. In the proposed scheme, any $ k_0-1 $ or less shadows give no clue about secret.
Proof. When $ {k_0}-1 $ shadow pixels $ a_{i_1}, a_{i_2 }, \cdots a_{i_{{k_0}-1} } $ are given, according to CRT then all we have is $ y_0 $ modulo $ N_2 = \prod\nolimits_{j = 1}^{{k_0} - 1} {m_{i_j } } $, where $ y_0 \in [0, N_2-1] $. On one hand, the true $ y \in [N_{k_0}, M_{k_0}-1] $, which is absolutely different from $ y_0 $. On the other hand, since $ N_{k_0} \ge N_2 $, $ N_{k_0} \le y < M_{k_0} $ and $ \gcd \left({N_2, p} \right) = 1 $, in $ [N_2, M_{k_0}-1] $, $ y_0+b\prod\nolimits_{j = 1}^{{k_0}-1} {m_{i_j} } $ for $ b = 1, 2, \cdots, {m_{i_{k_0}} -1} $ are also the solutions for the collected $ {k_0}-1 $ equations in Eq. (3.1). Thus, there are another $ {m_{i_{k_0}} -1} $ solutions in $ [N_2, M_{k_0}-1] $, other than only one. Thus $ {k_0}-1 $ or less shadows give no clue about secret.
Theorem 1. Our method is a valid $ (k_1, k_2, n) $ ramp SIS construction.
Proof. Based on the above Lemmas, we know for now processing pixel value $ s = S(h, w) $ $ (k_0, n) $ threshold is achieved by our method.
Since $ {{sc}_{1}}, {{sc}_{2}}, \cdots{{sc}_{{n}}} $ are generated according to the secret pixel $ s $ with $ (k_0, n) $ threshold, we can disclose the secret $ s $ when we collect any $ k_0 $ or more shadow pixels.
Since in Step 3 of Algorithm 1, for every processing pixel value $ s = S(h, w) $, a threshold $ k_x $ in $ [k_1, k_2] $ is selected randomly, when we collect more than $ k_1 $ shadows, more secret pixels will be disclosed losslessly so that the progressive quality of disclosed secret image will be gained. On the other hand, when we collect any $ k_2 $ or more shadows, every pixel of the secret image is disclosed losslessly, thus, the secret image is disclosed losslessly. As a result, our method is a valid $ (k_1, k_2, n) $ ramp SIS construction.
In this section, experiments and analyses are taken into account to evaluate the effectiveness of the proposed scheme.
Figure 1 is one experimental result of our proposed $ (k_1, k_2, n) $ ramp CRT-based SIS, where $ p = 128, m_1 = 245, m_2 = 247, m_3 = 249, m_4 = 251, m_5 = 253 $, $ k_1 = 2, k_2 = 4, n = 5 $ and its employed grayscale secret image is in Figure 1(a). Figures 1(b–f) are the generated 5 shadows, which are noise-like. Figures 1(g–j) display the disclosed grayscale secret image with any $ t\left({2 \le t \le 5} \right) $ shadows by our recovery method, where $ S'_{1, 2, \cdots, t} $ is the disclosed secret image $ S' $ from $ SC _{1}, SC_{2}, \cdots, SC_{t} $ and for saving pages we only give the disclosed results with the first $ t $th shadows. When more shadows are used, better disclosed secret image is obtained in $ [k_1, k_2] $, thus, the proposed $ (k_1, k_2, n) $ ramp SIS is progressive in $ [k_1, k_2] $. The disclosed secret images with any $ k_2 $ or more shadows, as Figures 1 (i)-(j), are the same as the original secret image in Figure 1 (a), since $ \sum\limits_{h = 1}^H {\sum\limits_{w = 1}^W {\left| {S(h, w) - S'(h, w)} \right|} } = 0 $.
Furthermore, progressive rate can be adopted to evaluate the progressive effect of the disclosed secret image [51]. In Figure 1, taking PSNR as an example, the progressive rate at $ t = 2 $ is 3.0746 and the progressive rate at $ t = 3 $ is $ + \infty $.
In addition, Figure 2 shows shadows histogram analyses of proposed $ (k_1, k_2, n) $ ramp SIS corresponding to Figure 1. For each shadow, the pixel values are approximately uniformly distributed in range $ [0, m_i-1] $, which tells that each shadow gives no clue about the secret image. In the following experiments, we will omit the shadows histogram analyses for saving pages.
Figure 3 is the further experimental result of our proposed $ (k_1, k_2, n) $ ramp CRT-based SIS, where $ p = 128, m_1 = 245, m_2 = 247, m_3 = 249, m_4 = 251, m_5 = 253 $, $ k_1 = 3, k_2 = 5, n = 5 $ and its employed grayscale secret image is in Figure 3(a). Figures 3(b–f) are the generated 5 shadows, which are noise-like. Figures 3(g–j) display the disclosed grayscale secret image with any $ t\left({2 \le t \le 5} \right) $ shadows by our recovery method. When less than $ k_1 $ shadows are inspected, nothing of the secret image can be obtained. When $ k_1 $ or more shadows are collected, the secret image can be disclosed in a degree. When more shadows are used, better disclosed secret image is obtained as well in $ [k_1, k_2] $, thus, the proposed $ (k_1, k_2, n) $ ramp SIS is progressive in $ [k_1, k_2] $ as well. The disclosed secret images with any $ k_2 $ shadows as Figure 3(j) is the same as the original secret image Figure 3(a) as well.
Based on the above results we conclude that:
$ 1. $ The shadows are noise-like, thus, every single shadow is secure.
$ 2. $ When any $ t < k_1 $ shadows are inspected, there is no information on the secret image is leaked except for image size, which shows security of our method.
$ 3. $ When any $ t (k_1 \le t \le k_2) $ shadows are collected, the secret image will be disclosed by our recovery method in a progressive way.
$ 4. $ When we collect any $ k_2 $ or more shadows, the secret image is disclosed losslessly by our recovery method.
$5. $ $ (k_1, k_2, n) $ ramp SIS is achieved.
Some available parameters of $ {p, m_1, m_2 \cdots, m_n } $ for different participant numbers are suggested in Table 1, some of which are applied to our experiments as well. The user can also search other parameters according to specific applications.
$n$ | $p$ | ${m_1, m_2 \cdots, m_n }$ |
2 | 128 | 253,255 |
2 | 131 | 253,254 |
3 | 128 | 251,253,255 |
3 | 131 | 253,254,255 |
4 | 128 | 247,251,253,255 |
4 | 131 | 251,253,254,255 |
5 | 128 | 245,247,249,251,253 |
5 | 131 | 247,251,253,254,255 |
Herein, we compare the proposed scheme with other related schemes especially VSS [28] and polynomial-based scheme [12], since they are typical SIS schemes. Furthermore, VSS in [28] is progressive without codebook design and pixel expansion based on stacking recovery. Polynomial-based scheme in [12] is fully lossless.
We note that, as stated in section 2.2, in general secret sharing is hard to be directly applied to SIS, thus, we omit the comparisons to ramp secret sharing.
Figure 4 is one experimental result of our proposed $ (k_1, k_2, n) $ ramp CRT-based SIS, where $ p = 131, m_1 = 251, m_2 = 253, m_3 = 254, m_4 = 255 $, $ k_1 = 2, k_2 = 4, n = 4 $ and its employed grayscale secret image is in Figure 4(a). Figures 4(b–e) are the generated 4 shadows, which are noise-like. Figures 4(f–h) display the disclosed grayscale secret image with any $ t\left({2 \le t \le 4} \right) $ shadows by our recovery method. When more shadows are used, better disclosed secret image is obtained as well in $ [k_1, k_2] $, thus, the proposed $ (k_1, k_2, n) $ ramp SIS is progressive in $ [k_1, k_2] $. The disclosed secret image with $ k_2 $ shadows as Figure 4 (h) is the same as the original secret image Figure 4 (a), since $ \sum\limits_{h = 1}^H {\sum\limits_{w = 1}^W {\left| {S(h, w) - S'(h, w)} \right|} } = 0 $ as well.
Figure 5 is further experimental result of our proposed $ (k_1, k_2, n) $ ramp CRT-based SIS, where $ p = 131, m_1 = 251, m_2 = 253, m_3 = 254, m_4 = 255 $, $ k_1 = 2, k_2 = 2, n = 4 $ and its employed grayscale secret image is in Figure 5(a). Figures 5(b–e) are the generated 4 shadows, which are noise-like. Figures 5(f–h) display the disclosed grayscale secret image with any $ t\left({2 \le t \le 4} \right) $ shadows by our recovery method. When two or more shadows are used, the secret image is losslessly disclosed so that our proposed $ (k_1, k_2, n) $ ramp SIS reduces to $ (k, n) $ ramp SIS if $ k_1 = k_2 $.
Then Figure 6 illustrates one experimental result of VSS for $ (k, n) $ threshold in [28], where $ k = 2, n = 4 $ and its employed binary secret image is in Figure 6(a). Figures 6(b–e) are the generated 4 shadows, which are noise-like as well. Figures 6(f–h) display the disclosed grayscale secret image with any $ t\left({2 \le t \le 4} \right) $ shadows by stacking recovery. When 2 or more shadows are used, better disclosed secret image is obtained as well in $ [k, n] $, thus, VSS for $ (k, n) $ threshold in [28] is progressive in $ [k, n] $.
According to Figure 4, Figure 5 and Figure 6, comparisons between VSS and our method are given as follows.
$1. $ Our method is for $ (k_1, k_2, n) $ ramp threshold due to random threshold selection in Step 3 of our method while VSS is only for $ (k, n) $ threshold, where $ (k, n) $ threshold is one special case of our method.
$ 2. $ Our disclosing method is modular arithmetic since CRT while VSS is stacking, thus, our disclosing method needs more computation than VSS.
$ 3. $ The secret image is disclosed in a progressive way by our method when $ t(k_1 \le t \le k_2) $ shadows are collected due to random threshold selection in Step 3 of our method, while VSS is progressive in $ [k, n] $.
$ 4. $ Our method discloses the secret image losslessly when we collect any $ k_2 $ or more shadows since Steps 4–5 of our method, while VSS is lossy.
$ 5. $ Our method is suitable for grayscale secret image as well as possible color secret image due to image characteristic analyses and CRT parameters design, while VSS is for binary secret image.
Figure 7 is one experimental result of $ (k, n) $ threshold polynomial-based SIS [12], where $ k = 2, n = 4 $ and its employed grayscale secret image is in Figure 7(a). Figures 7(b–e) are the generated 4 shadows, which are noise-like. Figures 7(f–h) display the same disclosed grayscale secret images with high-resolution with any $ k = 2 $ or more shadows by Lagrange interpolation.
According to Figure 4, Figure 5 and Figure 7, comparisons between our method and polynomial-based SIS are given as follows.
$ 1. $ Our method is for $ (k_1, k_2, n) $ ramp threshold due to random threshold selection in Step 3 of our method while polynomial-based SIS is only for $ (k, n) $ threshold, where $ (k, n) $ threshold is one special case of our method.
$ 2. $ Our disclosing method is modular arithmetic ($ O(k) $ operations [44]) since CRT while polynomial-based SIS is Lagrange interpolation ($ O(k\log ^2 k) $ operations [44]), thus, our disclosing method needs less computation than polynomial-based SIS.
$3. $ The secret image is disclosed in a progressive way by our method when any $ t(k_1 \le t \le k_2) $ shadows are gained due to random threshold selection in Step 3 of our method, while polynomial-based SIS is "all-or-nothing".
$4. $ In some polynomial-based SIS schemes, it is generally lossy recovery since secret image is decoded by modular 251 which is less than max grayscale value 255. The recovering image will be lossy if the pixel value of the secret image exceeds 251 and some polynomial-based SIS schemes have a little bit of loss. By contrast, our method is lossless because of CRT. We further analyze this issue as follows. In polynomial-based SIS, the primes near 255 are 257 and 251. In most polynomial-based SIS, 251 is used. If 257 is used, we cannot store the i-th shadow pixel for the value of 256; otherwise 251 is used, we cannot disclose the value of the secret pixel greater than 250. Although some methods are given to solve the 251 problem, such as selecting the prime 257 [52], primitive polynomial for $ GF(2^8) $, splitting the secret pixel greater than 250 into two pixels and so on, they are achieved at some other costs. Taking [53] as one example, Huffman coding and image differencing process are employed to reduce the size of each shadow and to avoid auxiliary encryption. Primitive polynomial for $ GF(2^8) $ is adopted to avoid quality degradation. However, primitive polynomial for $ GF(2^8) $ has larger computational complexity.
In addition, actually, when $ k_1 = k_2 = k $, the $ (k_1, k_2, n) $ ramp SIS will be a $ (k, n) $-SIS. Progressiveness is studied in some degree in VSS while that is seldom discussed in polynomial-based SIS. However, VSS is only suitable for binary image rather than grayscale image.
In a word, based on image characteristics and CRT, the proposed $ (k_1, k_2, n) $ ramp SIS has the features of $ (k_1, k_2, n) $ threshold with only modular arithmetic recovery method and no auxiliary encryption, which outperforms conventional $ (k, n) $ threshold SIS.
For the above experiments, the quality evaluation metrics of the disclosed secret image are given in Table 2. According to Table 2, the proposed method achieves progressive characteristic in general $ (k_1, k_2, n) $ threshold when more shadows are collected, which outperforms conventional SIS as well.
Schemes | Metrics | $ t=2 $ | $ t=3 $ | $ t=4 $ | $ t=5 $ |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | PSNR | 10.4435 | $ 13.5181 $ | $ + \infty $ | $ + \infty $ |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | SSIM | 0.0545 | 0.1500 | 1 | 1 |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | UQI | 0.0566 | 0.1609 | 1 | 1 |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | NC | 0.9351 | 0.9679 | 1 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 3 | PSNR | - | 10.2597 | 13.2965 | $ + \infty $ |
Our $ (3, 5, 5) $ ramp SIS in Figure 3 | SSIM | - | 0.1224 | 0.3198 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 1 | UQI | - | 0.1204 | 0.3234 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 1 | NC | - | 0.9133 | 0.9577 | 1 |
Our $ (2, 4, 4) $ ramp SIS in Figure 4 | PSNR | 10.2811 | 13.2348 | $ + \infty $ | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 4 | SSIM | 0.0528 | 0.1403 | 1 | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 1 | UQI | 0.0544 | 0.1511 | 1 | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 1 | NC | 0.9482 | 0.9745 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 5 | PSNR | $ + \infty $ | $ + \infty $ | $ + \infty $ | |
Our $ (2, 2, 4) $ ramp SIS in Figure 5 | SSIM | 1 | 1 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 1 | UQI | 1 | 1 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 1 | NC | 1 | 1 | 1 | - |
$ (2, 4) $ threshold RGVSS in Figure 6 | $ \alpha $ | 0.2886 | 0.5018 | 0.5018 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | PSNR | $ + \infty $ | $ + \infty $ | $ + \infty $ | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | SSIM | 1 | 1 | 1 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | UQI | 1 | 1 | 1 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | NC | 1 | 1 | 1 | - |
In this paper, based on the study of image characteristics, the Chinese remainder theorem (CRT) and secret image sharing (SIS), we proposed $ (k_1, k_2, n) $ ramp SIS. Our method realizes $ (k_1, k_2, n) $ threshold and lossless recovery for grayscale image without auxiliary encryption. When we collect any $ k_1 $ or more shadows, the secret image will be disclosed in a progressive way. On the other hand, when we collect any $ k_2 $ or more shadows, the secret image will be disclosed losslessly. Furthermore, the disclosing method is only modular arithmetic resulting in ability in real-time application. Theoretical analyses and experiments are performed to display the effectiveness of our method. Applying our method to other SIS schemes like polynomial-based SIS and comparing to related ramp secret sharing will be our future work.
The authors would like to thank the anonymous reviewers for their valuable comments. This work is supported by the National Natural Science Foundation of China (Grant Numbers: 61602491, 61501148) and the Key Program of the National University of Defense Technology (Grant Number: ZK-17-02-07).
We have no conflicts of interest to declare.
[1] |
Dupont C, Armant DR, Brenner CA (2009) Epigenetics: Definition, mechanisms and clinical perspective. Semin Reprod Med 27: 351-357. doi: 10.1055/s-0029-1237423
![]() |
[2] |
Dawson MA, Kouzarides T (2012) Cancer epigenetics: From mechanism to therapy. Cell 150: 12-27. doi: 10.1016/j.cell.2012.06.013
![]() |
[3] |
Esteller M (2008) Molecular origins of cancer: Epigenetics in cancer. New Engl J Med 358: 1148-1159+1096. doi: 10.1056/NEJMra072067
![]() |
[4] |
Laird PW (2005) Cancer epigenetics. Hum Mol Genet 14: R65-R76. doi: 10.1093/hmg/ddi113
![]() |
[5] |
Okugawa Y, Grady WM, Goel A (2015) Epigenetic Alterations in Colorectal Cancer: Emerging Biomarkers. Gastroenterology 149: 1204-1225e1212. doi: 10.1053/j.gastro.2015.07.011
![]() |
[6] | Deng D, Liu Z, Du Y (2010) Epigenetic Alterations as Cancer Diagnostic, Prognostic, and Predictive Biomarkers. Adv Genet 71: 126-176. |
[7] |
Herceg Z, Hainaut P (2007) Genetic and epigenetic alterations as biomarkers for cancer detection, diagnosis and prognosis. Mol Oncol 1: 26-41. doi: 10.1016/j.molonc.2007.01.004
![]() |
[8] |
Dekker C (2007) Solid-state nanopores. Nat Nanotechnol 2: 209-215. doi: 10.1038/nnano.2007.27
![]() |
[9] |
Keyser UF (2011) Controlling molecular transport through nanopores. J R Soc Interface 8: 1369-1378. doi: 10.1098/rsif.2011.0222
![]() |
[10] |
Siwy ZS, Howorka S (2010) Engineered voltage-responsive nanopores. Chem Soc Rev 39: 1115-1132. doi: 10.1039/B909105J
![]() |
[11] |
Garaj S, Hubbard W, Reina A, et al. (2010) Graphene as a subnanometre trans-electrode membrane. Nature 467: 190-193. doi: 10.1038/nature09379
![]() |
[12] |
Siwy ZS, Davenport M (2010) Nanopores: Graphene opens up to DNA. Nat Nanotechnol 5: 697-698. doi: 10.1038/nnano.2010.198
![]() |
[13] |
Tada K, Haruyama J, Yang HX, et al. (2011) Graphene magnet realized by hydrogenated graphene nanopore arrays. Appl Phys Lett 99: 183111. doi: 10.1063/1.3653286
![]() |
[14] |
Ding S, Gao C, Gu LQ (2009) Capturing single molecules of immunoglobulin and ricin with an aptamer-encoded glass nanopore. Anal Chem 81: 6649-6655. doi: 10.1021/ac9006705
![]() |
[15] |
Gu LQ, Shim JW (2010) Single molecule sensing by nanopores and nanopore devices. Analyst 135: 441-451. doi: 10.1039/B907735A
![]() |
[16] | Fertig N, Meyer C, Blick RH, et al. (2001) Microstructured glass chip for ion-channel electrophysiology. Phys Rev E Stat Nonlin Soft Matter Phys 64: 409011-409014. |
[17] |
Li J, Stein D, McMullan C, et al. (2001) Ion-beam sculpting at nanometre length scales. Nature 412: 166-169. doi: 10.1038/35084037
![]() |
[18] |
Storm AJ, Chen JH, Ling XS, et al. (2003) Fabrication of solid-state nanopores with single-nanometre precision. Nat Mater 2: 537-540. doi: 10.1038/nmat941
![]() |
[19] |
Kasianowicz JJ, Brandin E, Branton D, et al. (1996) Characterization of individual polynucleotide molecules using a membrane channel. Proc Natl Acad Sci U S A 93: 13770-13773. doi: 10.1073/pnas.93.24.13770
![]() |
[20] |
Laszlo AH, Derrington IM, Brinkerhoff H, et al. (2013) Detection and mapping of 5-methylcytosine and 5-hydroxymethylcytosine with nanopore MspA. Proc Natl Acad Sci U S A 110: 18904-18909. doi: 10.1073/pnas.1310240110
![]() |
[21] | Laszlo AH, Derrington IM, Ross BC, et al. (2014) Decoding long nanopore sequencing reads of natural DNA. Nat Biotechnol 32: 829-833. |
[22] |
Wang Y, Montana V, Grubišić V, et al. (2015) Nanopore sensing of botulinum toxin type B by discriminating an enzymatically cleaved peptide from a synaptic protein synaptobrevin 2 derivative. ACS Appl Mater Inter 7: 184-192. doi: 10.1021/am5056596
![]() |
[23] |
Liu J, Eren E, Vijayaraghavan J, et al. (2012) OccK channels from Pseudomonas aeruginosa exhibit diverse single-channel electrical signatures but conserved anion selectivity. Biochemistry 51: 2319-2330. doi: 10.1021/bi300066w
![]() |
[24] |
Mohammad MM, Iyer R, Howard KR, et al. (2012) Engineering a rigid protein tunnel for biomolecular detection. J Am Chem Soc 134: 9521-9531. doi: 10.1021/ja3043646
![]() |
[25] |
Cheneke BR, van den Berg B, Movileanu L (2015) Quasithermodynamic contributions to the fluctuations of a protein nanopore. ACS Chem Biol 10: 784-794. doi: 10.1021/cb5008025
![]() |
[26] |
Wang HY, Li Y, Qin LX, et al. (2013) Single-molecule DNA detection using a novel SP1 protein nanopore. Chem Commun (Camb) 49: 1741-1743. doi: 10.1039/c3cc38939a
![]() |
[27] |
Wang S, Haque F, Rychahou PG, et al. (2013) Engineered nanopore of phi29 dna-packaging motor for real-time detection of single colon cancer specific antibody in serum. ACS Nano 7: 9814-9822. doi: 10.1021/nn404435v
![]() |
[28] |
Wu D, Bi S, Zhang L, et al. (2014) Single-molecule study of proteins by biological nanopore sensors. Sensors (Basel) 14: 18211-18222. doi: 10.3390/s141018211
![]() |
[29] |
Venkatesan BM, Bashir R (2011) Nanopore sensors for nucleic acid analysis. Nat Nanotechnol 6: 615-624. doi: 10.1038/nnano.2011.129
![]() |
[30] |
Hall AR, Scott A, Rotem D, et al. (2010) Hybrid pore formation by directed insertion of +Ý-haemolysin into solid-state nanopores. Nat Nanotechnol 5: 874-877. doi: 10.1038/nnano.2010.237
![]() |
[31] |
Bell NA, Engst CR, Ablay M, et al. (2012) DNA origami nanopores. Nano Lett 12: 512-517. doi: 10.1021/nl204098n
![]() |
[32] |
Iqbal SM, Akin D, Bashir R (2007) Solid-state nanopore channels with DNA selectivity. Nat Nanotechnol 2: 243-248. doi: 10.1038/nnano.2007.78
![]() |
[33] |
Tinazli A, Tang J, Valiokas R, et al. (2005) High-affinity chelator thiols for switchable and oriented immobilization of histidine-tagged proteins: a generic platform for protein chip technologies. Chemistry 11: 5249-5259. doi: 10.1002/chem.200500154
![]() |
[34] |
Wei R, Pedone D, Zurner A, et al. (2010) Fabrication of metallized nanopores in silicon nitride membranes for single-molecule sensing. Small 6: 1406-1414. doi: 10.1002/smll.201000253
![]() |
[35] |
Yusko EC, Johnson JM, Majd S, et al. (2011) Controlling protein translocation through nanopores with bio-inspired fluid walls. Nat Nanotechnol 6: 253-260. doi: 10.1038/nnano.2011.12
![]() |
[36] | Wang D, Harrer S, Luan B, et al. (2014) Regulating the transport of DNA through Biofriendly Nanochannels in a thin solid membrane. Sci Rep 4: 3985. |
[37] | Branton D, Deamer DW, Marziali A, et al. (2008) The potential and challenges of nanopore sequencing. Nat Nanotechnol 26: 1146-1153. |
[38] |
Cherf GM, Lieberman KR, Rashid H, et al. (2012) Automated forward and reverse ratcheting of DNA in a nanopore at 5-A precision. Nat Biotechnol 30: 344-348. doi: 10.1038/nbt.2147
![]() |
[39] |
Kasianowicz JJ, Brandin E, Branton D, et al. (1996) Characterization of individual polynucleotide molecules using a membrane channel. Proc Natl Acad Sci U S A 93: 13770-13773. doi: 10.1073/pnas.93.24.13770
![]() |
[40] |
Manrao EA, Derrington IM, Laszlo AH, et al. (2012) Reading DNA at single-nucleotide resolution with a mutant MspA nanopore and phi29 DNA polymerase. Nat Biotechnol 30: 349-353. doi: 10.1038/nbt.2171
![]() |
[41] |
An N, Fleming AM, White HS, et al. (2012) Crown ether-electrolyte interactions permit nanopore detection of individual DNA abasic sites in single molecules. Proc Natl Acad Sci U S A 109: 11504-11509. doi: 10.1073/pnas.1201669109
![]() |
[42] |
Wallace EV, Stoddart D, Heron AJ, et al. (2010) Identification of epigenetic DNA modifications with a protein nanopore. Chem Commun(Camb) 46: 8195-8197. doi: 10.1039/c0cc02864a
![]() |
[43] |
Shim J, Kim Y, Humphreys GI, et al. (2015) Nanopore-based assay for detection of methylation in double-stranded DNA fragments. ACS Nano 9: 290-300. doi: 10.1021/nn5045596
![]() |
[44] |
Bayley H, Cremer PS (2001) Stochastic sensors inspired by biology. Nature 413: 226-230. doi: 10.1038/35093038
![]() |
[45] |
Gu LQ, Shim JW (2010) Single molecule sensing by nanopores and nanopore devices. Analyst 135: 441-451. doi: 10.1039/B907735A
![]() |
[46] |
Howorka S, Siwy Z (2009) Nanopore analytics: sensing of single molecules. Chem Soc Rev 38: 2360-2384. doi: 10.1039/b813796j
![]() |
[47] | Luan B, Peng H, Polonsky S, et al. (2010) Base-by-base ratcheting of single stranded DNA through a solid-state nanopore. Phys Rev Lett 104. |
[48] |
Asandei A, Chinappi M, Lee JK, et al. (2015) Placement of oppositely charged aminoacids at a polypeptide termini determines the voltage-controlled braking of polymer transport through nanometer-scale pores. Sci Rep 5: 10419. doi: 10.1038/srep10419
![]() |
[49] | Mereuta L, Roy M, Asandei A, et al. (2014) Slowing down single-molecule trafficking through a protein nanopore reveals intermediates for peptide translocation. Sci Rep 4: 3885. |
[50] |
Deamer D (2010) Nanopore analysis of nucleic acids bound to exonucleases and polymerases. Annu Rev Biophys 39: 79-90. doi: 10.1146/annurev.biophys.093008.131250
![]() |
[51] |
Olasagasti F, Lieberman KR, Benner S, et al. (2010) Replication of individual DNA molecules under electronic control using a protein nanopore. Nat Nanotechnol 5: 798-806. doi: 10.1038/nnano.2010.177
![]() |
[52] |
Chu J, Gonzalez-Lopez M, Cockroft SL, et al. (2010) Real-time monitoring of DNA polymerase function and stepwise single-nucleotide DNA strand translocation through a protein nanopore. Angew Chem Int Ed Engl 49: 10106-10109. doi: 10.1002/anie.201005460
![]() |
[53] |
Benner S, Chen RJ, Wilson NA, et al. (2007) Sequence-specific detection of individual DNA polymerase complexes in real time using a nanopore. Nat Nanotechnol 2: 718-724. doi: 10.1038/nnano.2007.344
![]() |
[54] |
Asandei A, Iftemi S, Mereuta L, et al. (2014) Probing of various physiologically relevant metals: Amyloid-β peptide interactions with a lipid membrane-immobilized protein nanopore. J Membrane Biol 247: 523-530. doi: 10.1007/s00232-014-9662-z
![]() |
[55] |
Asandei A, Schiopu I, Iftemi S, et al. (2013) Investigation of Cu2+ binding to human and rat amyloid fragments Aβ (1-16) with a protein nanopore. Langmuir 29: 15634-15642. doi: 10.1021/la403915t
![]() |
[56] |
Ying YL, Wang HY, Sutherland TC, et al. (2011) Monitoring of an ATP-binding aptamer and its conformational changes using an α-hemolysin nanopore. Small 7: 87-94. doi: 10.1002/smll.201001428
![]() |
[57] |
Clarke J, Wu HC, Jayasinghe L, et al. (2009) Continuous base identification for single-molecule nanopore DNA sequencing. Nat Nanotechnol 4: 265-270. doi: 10.1038/nnano.2009.12
![]() |
[58] |
Branton D, Deamer DW, Marziali A, et al. (2008) The potential and challenges of nanopore sequencing. Nat Biotechnol 26: 1146-1153. doi: 10.1038/nbt.1495
![]() |
[59] |
Bayley H (2006) Sequencing single molecules of DNA. Curr Opin Chem Biol 10: 628-637. doi: 10.1016/j.cbpa.2006.10.040
![]() |
[60] |
Bartel DP (2004) MicroRNAs: Genomics, Biogenesis, Mechanism, and Function. Cell 116: 281-297. doi: 10.1016/S0092-8674(04)00045-5
![]() |
[61] |
Carthew RW, Sontheimer EJ (2009) Origins and Mechanisms of miRNAs and siRNAs. Cell 136: 642-655. doi: 10.1016/j.cell.2009.01.035
![]() |
[62] |
Calin GA, Croce CM (2006) MicroRNA signatures in human cancers. Nat Rev Cancer 6: 857-866. doi: 10.1038/nrc1997
![]() |
[63] |
Chen X, Ba Y, Ma L, et al. (2008) Characterization of microRNAs in serum: A novel class of biomarkers for diagnosis of cancer and other diseases. Cell Res 18: 997-1006. doi: 10.1038/cr.2008.282
![]() |
[64] |
Mitchell PS, Parkin RK, Kroh EM, et al. (2008) Circulating microRNAs as stable blood-based markers for cancer detection. Proc Natl Acad Sci U S A 105: 10513-10518. doi: 10.1073/pnas.0804549105
![]() |
[65] |
Wang Y, Zheng D, Tan Q, et al. (2011) Nanopore-based detection of circulating microRNAs in lung cancer patients. Nat Nanotechnol 6: 668-674. doi: 10.1038/nnano.2011.147
![]() |
[66] |
Tian K, He Z, Wang Y, et al. (2013) Designing a polycationic probe for simultaneous enrichment and detection of microRNAs in a nanopore. ACS Nano 7: 3962-3969. doi: 10.1021/nn305789z
![]() |
[67] |
Zhang X, Wang Y, Fricke BL, et al. (2014) Programming nanopore ion flow for encoded multiplex microRNA detection. ACS Nano 8: 3444-3450. doi: 10.1021/nn406339n
![]() |
[68] |
Cao C, Ying YL, Gu Z, et al. (2014) Enhanced resolution of low molecular weight poly(ethylene glycol) in nanopore analysis. Anal Chem 86: 11946-11950. doi: 10.1021/ac504233s
![]() |
[69] |
Baral A, Kumar P, Pathak R, et al. (2013) Emerging trends in G-quadruplex biology-role in epigenetic and evolutionary events. Mol BioSyst 9: 1568-1575. doi: 10.1039/c3mb25492e
![]() |
[70] |
Frees S, Menendez C, Crum M, et al. (2014) QGRS-Conserve: A computational method for discovering evolutionarily conserved G-quadruplex motifs. Human Genomics 8: 8. doi: 10.1186/1479-7364-8-8
![]() |
[71] |
Paeschke K, Bochman ML, Daniela Garcia P, et al. (2013) Pif1 family helicases suppress genome instability at G-quadruplex motifs. Nature 497: 458-462. doi: 10.1038/nature12149
![]() |
[72] |
Qiu J, Wang M, Zhang Y, et al. (2015) Biological function and medicinal research significance of g-quadruplex interactive proteins. Curr Top Med Chem 15: 1971-1987. doi: 10.2174/1568026615666150515150803
![]() |
[73] |
Fleming AM, Burrows CJ (2013) G-quadruplex folds of the human telomere sequence alter the site reactivity and reaction pathway of guanine oxidation compared to duplex DNA. Chem Res Toxicol 26: 593-607. doi: 10.1021/tx400028y
![]() |
[74] |
An N, Fleming AM, Middleton EG, et al. (2014) Single-molecule investigation of G-quadruplex folds of the human telomere sequence in a protein nanocavity. Proc Natl Acad Sci U S A 111: 14325-14331. doi: 10.1073/pnas.1415944111
![]() |
[75] |
An N, Fleming AM, Burrows CJ (2013) Interactions of the human telomere sequence with the nanocavity of the α-hemolysin ion channel reveal structure-dependent electrical signatures for hybrid folds. J Am Chem Soc 135: 8562-8570. doi: 10.1021/ja400973m
![]() |
[76] |
Wolna AH, Fleming AM, Burrows CJ (2014) Single-molecule analysis of thymine dimer-containing G-quadruplexes formed from the human telomere sequence. Biochemistry 53: 7484-7493. doi: 10.1021/bi501072m
![]() |
[77] |
Shim JW, Gu LQ (2008) Encapsulating a single G-quadruplex aptamer in a protein nanocavity. J Phys Chem B 112: 8354-8360. doi: 10.1021/jp0775911
![]() |
[78] |
Shim JW, Tan Q, Gu LQ (2009) Single-molecule detection of folding and unfolding of the G-quadruplex aptamer in a nanopore nanocavity. Nucleic Acids Res 37: 972-982. doi: 10.1093/nar/gkn968
![]() |
[79] |
Shim J, Gu LQ (2012) Single-molecule investigation of G-quadruplex using a nanopore sensor. Methods 57: 40-46. doi: 10.1016/j.ymeth.2012.03.026
![]() |
[80] | Yang J, Xu ZP, Huang Y, et al. (2004) ATM and ATR: Sensing DNA damage. World J Gastroentero 10: 155-160. |
[81] |
Diculescu VC, Paquim AMC, Brett AMO (2005) Electrochemical DNA sensors for detection of DNA damage. Sensors 5: 377-393. doi: 10.3390/s5060377
![]() |
[82] |
Fojta M (2002) Electrochemical sensors for DNA interactions and damage. Electroanalysis 14: 1449-1463. doi: 10.1002/1521-4109(200211)14:21<1449::AID-ELAN1449>3.0.CO;2-Z
![]() |
[83] |
Paleček E, Bartošík M (2012) Electrochemistry of nucleic acids. Chem Rev 112: 3427-3481. doi: 10.1021/cr200303p
![]() |
[84] |
An N, Fleming AM, White HS, et al. (2015) Nanopore detection of 8-oxoguanine in the human telomere repeat sequence. ACS Nano 9: 4296-4307. doi: 10.1021/acsnano.5b00722
![]() |
[85] |
Boiteux S, Guillet M (2004) Abasic sites in DNA: Repair and biological consequences in Saccharomyces cerevisiae. DNA Repair 3: 1-12. doi: 10.1016/j.dnarep.2003.10.002
![]() |
[86] |
Wilson Iii DM, Barsky D (2001) The major human abasic endonuclease: Formation, consequences and repair of abasic lesions in DNA. Mutat Res-DNA Repair 485: 283-307. doi: 10.1016/S0921-8777(01)00063-5
![]() |
[87] | Reardon JT, Sancar A (2005) Nucleotide Excision Repair. In: Moldave K, editor. Progress in Nucleic Acid Research and Molecular Biology, 183-235. |
[88] |
Gates KS (2009) An overview of chemical processes that damage cellular DNA: Spontaneous hydrolysis, alkylation, and reactions with radicals. Chem Res Toxicol 22: 1747-1760. doi: 10.1021/tx900242k
![]() |
[89] |
Greco NJ, Tor Y (2005) Simple fluorescent pyrimidine analogues detect the presence of DNA abasic sites. J Am Chem Soc 127: 10784-10785. doi: 10.1021/ja052000a
![]() |
[90] |
Lucotti A, Tommasini M, Pezzoli D, et al. (2014) Molecular interactions of DNA with transfectants: A study based on infrared spectroscopy and quantum chemistry as aids to fluorescence spectroscopy and dynamic light scattering analyses. RSC Adv 4: 49620-49627. doi: 10.1039/C4RA08845J
![]() |
[91] |
Sun HB, Qian L, Yokota H (2001) Detection of abasic sites on individual DNA molecules using atomic force microscopy. Anal Chem 73: 2229-2232. doi: 10.1021/ac0013249
![]() |
[92] |
Bowler FR, Diaz-Mochon JJ, Swift MD, et al. (2010) DNA analysis by dynamic chemistry. Angew Chem Int Edit 49: 1809-1812. doi: 10.1002/anie.200905699
![]() |
[93] |
Atamna H, Cheung I, Ames BN (2000) A method for detecting abasic sites in living cells: Age-dependent changes in base excision repair. Proc Natl Acad Sci U S A 97: 686-691. doi: 10.1073/pnas.97.2.686
![]() |
[94] |
Kojima N, Takebayashi T, Mikami A, et al. (2009) Construction of highly reactive probes for abasic site detection by introduction of an aromatic and a guanidine residue into an aminooxy group. J Am Chem Soc 131: 13208-13209. doi: 10.1021/ja904767k
![]() |
[95] |
Zeglis BM, Boland JA, Barton JK (2008) Targeting abasic sites and single base bulges in DNA with metalloinsertors. J Am Chem Soc 130: 7530-7531. doi: 10.1021/ja801479y
![]() |
[96] |
Wang Y, Liu L, Wu C, et al. (2009) Direct detection and quantification of abasic sites for in vivo studies of DNA damage and repair. Nucl Med Biol 36: 975-983. doi: 10.1016/j.nucmedbio.2009.07.007
![]() |
[97] |
Hada M, Sutherland BM (2006) Spectrum of complex DNA damages depends on the incident radiation. Radiat Res 165: 223-230. doi: 10.1667/RR3498.1
![]() |
[98] |
An N, Fleming AM, White HS, et al. (2012) Crown ether-electrolyte interactions permit nanopore detection of individual DNA abasic sites in single molecules. Proc Natl Acad Sci U S A 109: 11504-11509. doi: 10.1073/pnas.1201669109
![]() |
[99] |
Jin Q, Fleming AM, Johnson RP, et al. (2013) Base-excision repair activity of uracil-DNA glycosylase monitored using the latch zone of α-hemolysin. J Am Chem Soc 135: 19347-19353. doi: 10.1021/ja410615d
![]() |
[100] |
Johnson RP, Fleming AM, Jin Q, et al. (2014) Temperature and electrolyte optimization of the α-hemolysin latch sensing zone for detection of base modification in double-stranded DNA. Biophys J 107: 924-931. doi: 10.1016/j.bpj.2014.07.006
![]() |
[101] | Lin YH, Tseng WL (2009) Highly sensitive and selective detection of silver ions and silver nanoparticles in aqueous solution using an oligonucleotide-based fluorogenic probe. Chem Commun (Camb): 6619-6621. |
[102] | Ono A, Cao S, Togashi H, et al. (2008) Specific interactions between silver(I) ions and cytosine-cytosine pairs in DNA duplexes. Chem Commun (Camb): 4825-4827. |
[103] |
Wen Y, Xing F, He S, et al. (2010) A graphene-based fluorescent nanoprobe for silver(I) ions detection by using graphene oxide and a silver-specific oligonucleotide. Chem Commun (Camb) 46: 2596-2598. doi: 10.1039/b924832c
![]() |
[104] |
Torigoe H, Okamoto I, Dairaku T, et al. (2012) Thermodynamic and structural properties of the specific binding between Ag(+) ion and C:C mismatched base pair in duplex DNA to form C-Ag-C metal-mediated base pair. Biochimie 94: 2431-2440. doi: 10.1016/j.biochi.2012.06.024
![]() |
[105] |
Miyake Y, Togashi H, Tashiro M, et al. (2006) MercuryII-mediated formation of thymine-HgII-thymine base pairs in DNA duplexes. J Am Chem Soc 128: 2172-2173. doi: 10.1021/ja056354d
![]() |
[106] |
Tanaka Y, Oda S, Yamaguchi H, et al. (2007) 15N-15N J-coupling across Hg(II): direct observation of Hg(II)-mediated T-T base pairs in a DNA duplex. J Am Chem Soc 129: 244-245. doi: 10.1021/ja065552h
![]() |
[107] |
Torigoe H, Ono A, Kozasa T (2010) Hg(II) ion specifically binds with T:T mismatched base pair in duplex DNA. Chemistry 16: 13218-13225. doi: 10.1002/chem.201001171
![]() |
[108] |
Wen S, Zeng T, Liu L, et al. (2011) Highly sensitive and selective DNA-based detection of mercury(II) with alpha-hemolysin nanopore. J Am Chem Soc 133: 18312-18317. doi: 10.1021/ja206983z
![]() |
[109] |
Ono A, Torigoe H, Tanaka Y, et al. (2011) Binding of metal ions by pyrimidine base pairs in DNA duplexes. Chem Soc Rev 40: 5855-5866. doi: 10.1039/c1cs15149e
![]() |
[110] |
Brena RM, Huang TH, Plass C (2006) Quantitative assessment of DNA methylation: Potential applications for disease diagnosis, classification, and prognosis in clinical settings. J Mol Med (Berl) 84: 365-377. doi: 10.1007/s00109-005-0034-0
![]() |
[111] |
Kriaucionis S, Heintz N (2009) The nuclear DNA base 5-hydroxymethylcytosine is present in Purkinje neurons and the brain. Science 324: 929-930. doi: 10.1126/science.1169786
![]() |
[112] |
Lister R, Pelizzola M, Dowen RH, et al. (2009) Human DNA methylomes at base resolution show widespread epigenomic differences. Nature 462: 315-322. doi: 10.1038/nature08514
![]() |
[113] | Li WW, Gong L, Bayley H (2013) Single-molecule detection of 5-hydroxymethylcytosine in DNA through chemical modification and nanopore analysis. Angew Chem Int Ed 52: 4350-4355. |
[114] | Shim J, Humphreys GI, Venkatesan BM, et al. (2013) Detection and quantification of methylation in DNA using solid-state nanopores. Sci Rep 3: 1389. |
[115] |
Wallace EV, Stoddart D, Heron AJ, et al. (2010) Identification of epigenetic DNA modifications with a protein nanopore. Chem Commun (Camb) 46: 8195-8197. doi: 10.1039/c0cc02864a
![]() |
[116] |
Wanunu M, Cohen-Karni D, Johnson RR, et al. (2011) Discrimination of methylcytosine from hydroxymethylcytosine in DNA molecules. J Am Chem Soc 133: 486-492. doi: 10.1021/ja107836t
![]() |
[117] |
Yu M, Hon GC, Szulwach KE, et al. (2012) Tet-assisted bisulfite sequencing of 5-hydroxymethylcytosine. Nat Protoc 7: 2159-2170. doi: 10.1038/nprot.2012.137
![]() |
[118] |
Yu M, Hon GC, Szulwach KE, et al. (2012) Base-resolution analysis of 5-hydroxymethylcytosine in the mammalian genome. Cell 149: 1368-1380. doi: 10.1016/j.cell.2012.04.027
![]() |
[119] |
Booth MJ, Branco MR, Ficz G, et al. (2012) Quantitative sequencing of 5-methylcytosine and 5-hydroxymethylcytosine at single-base resolution. Science 336: 934-937. doi: 10.1126/science.1220671
![]() |
[120] | Wang Y, Luan BQ, Yang Z, et al. (2014) Single Molecule Investigation of Ag+ Interactions with Single Cytosine-, Methylcytosine- and Hydroxymethylcytosine-Cytosine Mismatches in a Nanopore. Sci Rep 4: 5883. |
[121] |
Torigoe H, Miyakawa Y, Ono A, et al. (2011) Thermodynamic properties of the specific binding between Ag+ ions and C:C mismatched base pairs in duplex DNA. Nucleos Nucleot Nucl 30: 149-167. doi: 10.1080/15257770.2011.553210
![]() |
[122] |
Kistenmacher TJ, Rossi M, Marzilli LG (1979) Crystal and molecular structure of (nitrato)(1-methylcytosine)silver(I): An unusual cross-linked polymer containing a heavy metal and a modified nucleic acid constituent. Inorg Chem 18: 240-244. doi: 10.1021/ic50192a007
![]() |
[123] |
Urata H, Yamaguchi E, Nakamura Y, et al. (2011) Pyrimidine-pyrimidine base pairs stabilized by silver(I) ions. Chem Commun (Camb) 47: 941-943. doi: 10.1039/C0CC04091F
![]() |
[124] |
Wang Y, Ritzo B, Gu L-Q (2015) Silver (i) ions modulate the stability of DNA duplexes containing cytosine, methylcytosine and hydroxymethylcytosine at different salt concentrations. RSC Adv 5: 2655-2658. doi: 10.1039/C4RA14490B
![]() |
[125] |
Egger G, Liang G, Aparicio A, et al. (2004) Epigenetics in human disease and prospects for epigenetic therapy. Nature 429: 457-463. doi: 10.1038/nature02625
![]() |
[126] |
Bestor TH (2000) The DNA methyltransferases of mammals. Hum Mol Genet 9: 2395-2402. doi: 10.1093/hmg/9.16.2395
![]() |
[127] | Kang I, Wang Y, Reagan C, et al. (2013) Designing DNA interstrand lock for locus-specific methylation detection in a nanopore. Sci Rep 3: 2381. |
[128] |
Calin GA, Croce CM (2006) MicroRNA signatures in human cancers. Nat Rev Cancer 6: 857-866. doi: 10.1038/nrc1997
![]() |
[129] |
Vlassov VV, Laktionov PP, Rykova EY (2010) Circulating nucleic acids as a potential source for cancer biomarkers. Curr Mol Med 10: 142-165. doi: 10.2174/156652410790963295
![]() |
[130] |
Mitchell PS, Parkin RK, Kroh EM, et al. (2008) Circulating microRNAs as stable blood-based markers for cancer detection. Proc Natl Acad Sci U S A 105: 10513-10518. doi: 10.1073/pnas.0804549105
![]() |
[131] | Oremek GM, Sapoutzis N (2003) Pro-gastrin-releasing peptide (Pro-GRP), a tumor marker for small cell lung cancer. Anticancer Res 23: 895-898. |
[132] |
Molina R, Auge JM, Bosch X, et al. (2009) Usefulness of serum tumor markers, including progastrin-releasing peptide, in patients with lung cancer: correlation with histology. Tumour Biol 30: 121-129. doi: 10.1159/000224628
![]() |
[133] |
Albrethsen J, Moller CH, Olsen J, et al. (2006) Human neutrophil peptides 1, 2 and 3 are biochemical markers for metastatic colorectal cancer. Eur J Cancer 42: 3057-3064. doi: 10.1016/j.ejca.2006.05.039
![]() |
[134] |
Bassani-Sternberg M, Barnea E, Beer I, et al. (2010) Soluble plasma HLA peptidome as a potential source for cancer biomarkers. Proc Natl Acad Sci U S A 107: 18769-18776. doi: 10.1073/pnas.1008501107
![]() |
[135] |
Stella Tsai CS, Chen HC, Tung JN, et al. (2010) Serum cellular apoptosis susceptibility protein is a potential prognostic marker for metastatic colorectal cancer. Am J Pathol 176: 1619-1628. doi: 10.2353/ajpath.2010.090467
![]() |
[136] |
Stoeva SI, Lee JS, Smith JE, et al. (2006) Multiplexed detection of protein cancer markers with biobarcoded nanoparticle probes. J Am Chem Soc 128: 8378-8379. doi: 10.1021/ja0613106
![]() |
[137] |
Zheng W, He L (2010) Multiplexed detection of protein cancer markers on Au/Ag-barcoded nanorods using fluorescent-conjugated polymers. Anal Bioanal Chem 397: 2261-2270. doi: 10.1007/s00216-010-3834-1
![]() |
[138] | Jin H, Liu GL (2012) Fabrication and optical characterization of light trapping silicon nanopore and nanoscrew devices. Nanotechnology 23. |
[139] | Merchant CA, Drndić M (2012) Graphene nanopore devices for DNA sensing. In: Gracheva ME, editor. Methods in Molecular Biology, 211-226. |
[140] |
Park S, Lim J, Pak YE, et al. (2013) A solid state nanopore device for investigating the magnetic properties of magnetic nanoparticles. Sensors (Basel, Switzerland) 13: 6900-6909. doi: 10.3390/s130606900
![]() |
[141] |
Wu GS, Zhang Y, Si W, et al. (2014) Integrated solid-state nanopore devices for third generation DNA sequencing. Sci China Technol Sc 57: 1925-1935. doi: 10.1007/s11431-014-5644-8
![]() |
[142] | Inoue K, Kawano R, Yasuga H, et al. Logic operation in DNA nano device: Electrical input/output through biological nanopore; 2013; Freiburg. Chemical and Biological Microsystems Society. 1881-1883. |
[143] |
Lim MC, Lee MH, Kim KB, et al. (2015) A mask-free passivation process for low noise nanopore devices. J Nanosci Nanotechno 15: 5971-5977. doi: 10.1166/jnn.2015.10500
![]() |
[144] |
Mulero R, Prabhu AS, Freedman KJ, et al. (2010) Nanopore-Based Devices for Bioanalytical Applications. J Assoc Lab Automat 15: 243-252. doi: 10.1016/j.jala.2010.01.009
![]() |
[145] |
Cockroft SL, Chu J, Amorin M, et al. (2008) A single-molecule nanopore device detects DNA polymerase activity with single-nucleotide resolution. J Am Chem Soc 130: 818-820. doi: 10.1021/ja077082c
![]() |
[146] |
Kawano R, Osaki T, Sasaki H, et al. (2010) A polymer-based nanopore-integrated microfluidic device for generating stable bilayer lipid membranes. Small 6: 2100-2104. doi: 10.1002/smll.201000997
![]() |
[147] |
Shim JW, Gu LQ (2007) Stochastic sensing on a modular chip containing a single-ion channel. Anal Chem 79: 2207-2213. doi: 10.1021/ac0614285
![]() |
[148] |
Kang XF, Cheley S, Rice-Ficht AC, et al. (2007) A storable encapsulated bilayer chip containing a single protein nanopore. J Am Chem Soc 129: 4701-4705. doi: 10.1021/ja068654g
![]() |
[149] |
Eisenstein M (2012) Oxford Nanopore announcement sets sequencing sector abuzz. Nat Biotechnol 30: 295-296. doi: 10.1038/nbt0412-295
![]() |
[150] |
Quick J, Quinlan AR, Loman NJ (2014) A reference bacterial genome dataset generated on the MinIONTM portable single-molecule nanopore sequencer. GigaScience 3: 22. doi: 10.1186/2047-217X-3-22
![]() |
[151] | Ashton PM, Nair S, Dallman T, et al. (2015) MinION nanopore sequencing identifies the position and structure of a bacterial antibiotic resistance island. Nat Biotechnol 33: 296-302. |
[152] | Madoui MA, Engelen S, Cruaud C, et al. (2015) Genome assembly using Nanopore-guided long and error-free DNA reads. BMC Genomics 16. |
[153] |
Loman NJ, Quick J, Simpson JT (2015) A complete bacterial genome assembled de novo using only nanopore sequencing data. Nat Methods 12: 733-735. doi: 10.1038/nmeth.3444
![]() |
[154] | Palshikar P, Sharma A, Chauhan CS, et al. (2013) Biophotonics: A novel approach biomedical diagnosis. Int J Pharm Sci Rev Res 21: 350-354. |
[155] | Liu A, Ye B (2013) Application of gold nanoparticles in biomedical researches and diagnosis. Clin Lab 59: 23-36. |
[156] |
Nahar J, Imam T, Tickle KS, et al. (2012) Computational intelligence for microarray data and biomedical image analysis for the early diagnosis of breast cancer. Expert Syst Appl 39: 12371-12377. doi: 10.1016/j.eswa.2012.04.045
![]() |
[157] |
Kang JW, Lue N, Kong CR, et al. (2011) Combined confocal Raman and quantitative phase microscopy system for biomedical diagnosis. Biomed Opt Express 2: 2484-2492. doi: 10.1364/BOE.2.002484
![]() |
[158] |
Chen KI, Li BR, Chen YT (2011) Silicon nanowire field-effect transistor-based biosensors for biomedical diagnosis and cellular recording investigation. Nano Today 6: 131-154. doi: 10.1016/j.nantod.2011.02.001
![]() |
[159] |
Balas C (2009) Review of biomedical optical imaging - A powerful, non-invasive, non-ionizing technology for improving in vivo diagnosis. Meas Sci Technol 20: 104020. doi: 10.1088/0957-0233/20/10/104020
![]() |
[160] |
Ellis DI, Goodacre R (2006) Metabolic fingerprinting in disease diagnosis: Biomedical applications of infrared and Raman spectroscopy. Analyst 131: 875-885. doi: 10.1039/b602376m
![]() |
[161] |
Bottiroli G, Croce AC (2004) Autofluorescence spectroscopy of cells and tissues as a tool for biomedical diagnosis. Photoch Photobio Sci 3: 189-210. doi: 10.1039/b310627f
![]() |
[162] | Urbanova M, Plzak J, Strnad H, et al. (2010) Circulating nucleic acids as a new diagnostic tool. Cell Mol Biol Lett 15: 242-259. |
[163] |
Liu KJ, Brock MV, Shih Ie M, et al. (2010) Decoding circulating nucleic acids in human serum using microfluidic single molecule spectroscopy. J Am Chem Soc 132: 5793-5798. doi: 10.1021/ja100342q
![]() |
[164] |
Thompson L, Turko I, Murad F (2006) Mass spectrometry-based relative quantification of human neutrophil peptides 1, 2, and 3 from biological samples. Mol Immunol 43: 1485-1489. doi: 10.1016/j.molimm.2005.08.001
![]() |
[165] |
Wanunu M, Dadosh T, Ray V, et al. (2010) Rapid electronic detection of probe-specific microRNAs using thin nanopore sensors. Nat Nanotechnol 5: 807-814. doi: 10.1038/nnano.2010.202
![]() |
[166] |
Squires A, Meller A (2013) DNA Capture and Translocation through Nanoscale Pores-a Fine Balance of Electrophoresis and Electroosmosis. Biophys J 105: 543-544. doi: 10.1016/j.bpj.2013.06.008
![]() |
[167] |
Wanunu M, Morrison W, Rabin Y, et al. (2010) Electrostatic focusing of unlabelled DNA into nanoscale pores using a salt gradient. Nat Nanotechnol 5: 160-165. doi: 10.1038/nnano.2009.379
![]() |
[168] |
Hatlo MM, Panja D, van Roij R (2011) Translocation of DNA molecules through nanopores with salt gradients: the role of osmotic flow. Phys Rev Lett 107: 068101. doi: 10.1103/PhysRevLett.107.068101
![]() |
[169] |
He Y, Tsutsui M, Scheicher RH, et al. (2013) Mechanism of How Salt-Gradient-Induced Charges Affect the Translocation of DNA Molecules through a Nanopore. Biophys J 105: 776-782. doi: 10.1016/j.bpj.2013.05.065
![]() |
[170] |
Chou T (2009) Enhancement of charged macromolecule capture by nanopores in a salt gradient. J Chem Phys 131: 034703. doi: 10.1063/1.3170952
![]() |
1. | Atieh Mokhtari, Mohammad Taheri, 2024, Ramp Progressive Secret Image Sharing Using Ensemble of Simple Methods, 979-8-3315-1127-2, 417, 10.1109/ICCKE65377.2024.10874825 |
$n$ | $p$ | ${m_1, m_2 \cdots, m_n }$ |
2 | 128 | 253,255 |
2 | 131 | 253,254 |
3 | 128 | 251,253,255 |
3 | 131 | 253,254,255 |
4 | 128 | 247,251,253,255 |
4 | 131 | 251,253,254,255 |
5 | 128 | 245,247,249,251,253 |
5 | 131 | 247,251,253,254,255 |
Schemes | Metrics | $ t=2 $ | $ t=3 $ | $ t=4 $ | $ t=5 $ |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | PSNR | 10.4435 | $ 13.5181 $ | $ + \infty $ | $ + \infty $ |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | SSIM | 0.0545 | 0.1500 | 1 | 1 |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | UQI | 0.0566 | 0.1609 | 1 | 1 |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | NC | 0.9351 | 0.9679 | 1 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 3 | PSNR | - | 10.2597 | 13.2965 | $ + \infty $ |
Our $ (3, 5, 5) $ ramp SIS in Figure 3 | SSIM | - | 0.1224 | 0.3198 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 1 | UQI | - | 0.1204 | 0.3234 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 1 | NC | - | 0.9133 | 0.9577 | 1 |
Our $ (2, 4, 4) $ ramp SIS in Figure 4 | PSNR | 10.2811 | 13.2348 | $ + \infty $ | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 4 | SSIM | 0.0528 | 0.1403 | 1 | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 1 | UQI | 0.0544 | 0.1511 | 1 | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 1 | NC | 0.9482 | 0.9745 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 5 | PSNR | $ + \infty $ | $ + \infty $ | $ + \infty $ | |
Our $ (2, 2, 4) $ ramp SIS in Figure 5 | SSIM | 1 | 1 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 1 | UQI | 1 | 1 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 1 | NC | 1 | 1 | 1 | - |
$ (2, 4) $ threshold RGVSS in Figure 6 | $ \alpha $ | 0.2886 | 0.5018 | 0.5018 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | PSNR | $ + \infty $ | $ + \infty $ | $ + \infty $ | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | SSIM | 1 | 1 | 1 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | UQI | 1 | 1 | 1 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | NC | 1 | 1 | 1 | - |
$n$ | $p$ | ${m_1, m_2 \cdots, m_n }$ |
2 | 128 | 253,255 |
2 | 131 | 253,254 |
3 | 128 | 251,253,255 |
3 | 131 | 253,254,255 |
4 | 128 | 247,251,253,255 |
4 | 131 | 251,253,254,255 |
5 | 128 | 245,247,249,251,253 |
5 | 131 | 247,251,253,254,255 |
Schemes | Metrics | $ t=2 $ | $ t=3 $ | $ t=4 $ | $ t=5 $ |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | PSNR | 10.4435 | $ 13.5181 $ | $ + \infty $ | $ + \infty $ |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | SSIM | 0.0545 | 0.1500 | 1 | 1 |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | UQI | 0.0566 | 0.1609 | 1 | 1 |
Our $ (2, 4, 5) $ ramp SIS in Figure 1 | NC | 0.9351 | 0.9679 | 1 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 3 | PSNR | - | 10.2597 | 13.2965 | $ + \infty $ |
Our $ (3, 5, 5) $ ramp SIS in Figure 3 | SSIM | - | 0.1224 | 0.3198 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 1 | UQI | - | 0.1204 | 0.3234 | 1 |
Our $ (3, 5, 5) $ ramp SIS in Figure 1 | NC | - | 0.9133 | 0.9577 | 1 |
Our $ (2, 4, 4) $ ramp SIS in Figure 4 | PSNR | 10.2811 | 13.2348 | $ + \infty $ | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 4 | SSIM | 0.0528 | 0.1403 | 1 | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 1 | UQI | 0.0544 | 0.1511 | 1 | - |
Our $ (2, 4, 4) $ ramp SIS in Figure 1 | NC | 0.9482 | 0.9745 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 5 | PSNR | $ + \infty $ | $ + \infty $ | $ + \infty $ | |
Our $ (2, 2, 4) $ ramp SIS in Figure 5 | SSIM | 1 | 1 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 1 | UQI | 1 | 1 | 1 | - |
Our $ (2, 2, 4) $ ramp SIS in Figure 1 | NC | 1 | 1 | 1 | - |
$ (2, 4) $ threshold RGVSS in Figure 6 | $ \alpha $ | 0.2886 | 0.5018 | 0.5018 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | PSNR | $ + \infty $ | $ + \infty $ | $ + \infty $ | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | SSIM | 1 | 1 | 1 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | UQI | 1 | 1 | 1 | - |
Polynomial-based $ (2, 4) $ threshold SIS in Figure 7 | NC | 1 | 1 | 1 | - |