Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Sharing many secrets with computational provable security

Autor
Herranz, J.; Ruiz, A.; Saez, G.
Tipus d'activitat
Article en revista
Revista
Information processing letters
Data de publicació
2013-07
Volum
113
Número
14-16
Pàgina inicial
572
Pàgina final
579
DOI
https://doi.org/10.1016/j.ipl.2013.05.003 Obrir en finestra nova
Resum
We propose in this work two new multi-secret sharing schemes, that allow to distribute l different secrets among a set P={P1,…,Pn}P={P1,…,Pn} of players, each one according to a (possibly different) access structure. The two schemes are proved to enjoy computational security, by reduction to the semantic security of the underlying symmetric encryption scheme. The two security proofs are in the standard model and provide the exact relation between the security of the involved primitives. As f...
Paraules clau
Multi-secret Sharing Schemes, Provable Security, Symmetric Encryption, Cryptography
Grup de recerca
MAK - Matemàtica Aplicada a la Criptografia

Participants