Result 1 to 20 of 21 total
Multi-image encryption by circular random grids. (English)
Inf. Sci. 189, 255-265 (2012).
1
Verifiable multi-secret sharing based on LFSR sequences. (English)
Theor. Comput. Sci. 445, 52-62 (2012).
2
An ideal multi-secret sharing scheme based on MSP. (English)
Inf. Sci. 181, No. 7, 1403-1409 (2011).
3
Visual cryptography on graphs. (English)
J. Comb. Optim. 21, No. 1, 47-66 (2011).
4
A verifiable multi-secret-sharing scheme based on homogeneous linear recursion. (Chinese)
Acta Sci. Nat. Univ. Pekin. 46, No. 5, 709-714 (2010).
5
A verifiable multiple secrets sharing scheme based on Hermite interpolation polynomial. (Chinese)
J. Math., Wuhan Univ. 29, No. 3, 367-372 (2009).
6
Verifiable hierarchical threshold multi-secret sharing scheme. (Chinese)
J. Comput. Appl. 29, No. 1, 172-174 (2009).
7
On general construction for extended visual cryptography schemes. (English)
Pattern Recognition 42, No. 11, 3071-3082 (2009).
8
A verifiable threshold multi-secret sharing scheme. (Chinese)
J. Harbin Inst. Technol. 40, No. 9, 1462-1465 (2008).
9
A new image hiding scheme based on multi-secret sharing. (Chinese)
J. Comput. Appl. 28, No. 4, 902-905 (2008).
10
New schemes for sharing points on an elliptic curve. (English)
Comput. Math. Appl. 56, No. 6, 1556-1561 (2008).
11
New efficient and practical verifiable multi-secret sharing schemes. (English)
Inf. Sci. 178, No. 9, 2262-2274 (2008).
12
Sharing multiple secrets in visual cryptography. (English)
Pattern Recognition 40, No. 12, 3633-3651 (2007).
13
Linear multi-secret sharing schemes. (English)
Sci. China, Ser. F 48, No. 1, 125-136 (2005).
14
A new efficient $(t,n)$ verifiable multi-secret sharing (VMSS) based on YCH scheme. (English)
Appl. Math. Comput. 168, No. 1, 135-140 (2005).
15
A new $(t,n)$ multi-secret sharing scheme based on Shamir’s secret sharing. (English)
Appl. Math. Comput. 167, No. 2, 840-848 (2005).
16
A scheme for threshold multi-secret sharing. (English)
Appl. Math. Comput. 166, No. 1, 1-14 (2005).
17
Sharing one secret vs. sharing many secrets. (English)
Theor. Comput. Sci. 295, No. 1-3, 123-140 (2003).
18
Sharing one secret vs. sharing many secrets: Tight bounds for the max improvement ratio. (English)
Sgall, Jiří (ed.) et al., Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2136, 292-303 (2001).
19
Multi-secret sharing schemes. (English)
Desmedt, Yvo G. (ed.), Advances in cryptology - CRYPTO ’94. 14th annual international cryptology conference, Santa Barbara, CA, USA, August 21-25, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 839, 150-163 (1994).
20
Result 1 to 20 of 21 total
Start
Contact
Print
General Help
