Result 1 to 20 of 23 total
Ideal multipartite secret sharing schemes. (English)
J. Cryptology 25, No. 3, 434-463 (2012).
1
Optimal complexity of secret sharing schemes with four minimal qualified subsets. (English)
Des. Codes Cryptography 61, No. 2, 167-186 (2011).
2
On secret sharing schemes, matroids and polymatroids. (English)
J. Math. Cryptol. 4, No. 2, 95-120 (2010).
3
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. (English)
Des. Codes Cryptography 52, No. 1, 1-14 (2009).
4
On the diameter of matroid ports. (English)
Electron. J. Comb. 15, No. 1, Research Paper N27, 9 p. (2008).
5
On codes, matroids, and secure multiparty computation from linear secret-sharing schemes. (English)
IEEE Trans. Inf. Theory 54, No. 6, 2644-2657 (2008).
6
A note on secret sharing schemes with three homogeneous access structure. (English)
Inf. Process. Lett. 102, No. 4, 133-137 (2007).
7
Ideal multipartite secret sharing schemes. (English)
Naor, Moni (ed.), Advances in cryptology ‒ EUROCRYPT 2007. 26th annual international conference on the theory and applications of cryptographic techniques, Barcelona, Spain, May 20‒24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72539-8/pbk). Lecture Notes in Computer Science 4515, 448-465 (2007).
8
On secret sharing schemes, matroids and polymatroids. (English)
Vadhan, Salil P. (ed.), Theory of cryptography. 4th theory of cryptography conference, TCC 2007, Amsterdam, The Netherlands, February 21‒24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70935-0/pbk). Lecture Notes in Computer Science 4392, 273-290 (2007).
9
Ideal multipartite secret sharing schemes (English)
EUROCRYPT, 448-465 (2007).
10
On secret sharing schemes, matroids and polymatroids (English)
TCC, 273-290 (2007).
11
Matroid ports and access structures of ideal secret sharing schemes. (Spanish)
Martínez Moro, Edgar (ed.), V jornadas de matemática discreta y algorítmica. Valladolid: Universidade de Valladolid, Secretariado de Publicaciones e Intercambio Editorial (ISBN 978-84-8448-380-9/pbk). Ciencias (Valladolid) 23, 343-350 (2006).
12
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. (English)
De Prisco, Roberto (ed.) et al., Security and cryptography for networks. 5th international conference, SCN 2006, Maiori, Italy, September 6‒8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38080-1/pbk). Lecture Notes in Computer Science 4116, 201-215 (2006).
13
Secret sharing schemes on access structures with intersection number equal to one. (English)
Discrete Appl. Math. 154, No. 3, 552-563 (2006).
14
Ideal multipartite secret sharing schemes (English)
IACR Cryptology ePrint Archive 2006, 292 (2006).
15
On secret sharing schemes, matroids and polymatroids (English)
IACR Cryptology ePrint Archive 2006, 77 (2006).
16
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (English)
SCN, 201-215 (2006).
17
On codes, matroids and secure multi-party computation from linear secret sharing schemes. (English)
Shoup, Victor (ed.), Advances in cryptology ‒ CRYPTO 2005. 25th annual international cryptology conference, Santa Barbara, CA, USA, August 14‒18, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28114-2/pbk). Lecture Notes in Computer Science 3621, 327-343 (2005).
18
Secret sharing schemes with three or four minimal qualified subsets. (English)
Des. Codes Cryptography 34, No. 1, 17-34 (2005).
19
On codes, matroids and secure multi-party computation from linear secret sharing schemes (English)
CRYPTO, 327-343 (2005).
20
Result 1 to 20 of 23 total
Start
Contact
Print
General Help
