|
Títol:
|
On the computational security of a distributed key distribution scheme
|
|
Autor/a:
|
Daza, Vanesa; Herranz Sotoca, Javier; Sáez Moreno, Germán
|
|
Altres autors:
|
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
|
Abstract:
|
In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme [ 11] which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in [ 24] which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss. |
|
Abstract:
|
Peer Reviewed |
|
Matèries:
|
-Information and Communication Applications, Inc.
-Cryptography
-Key distribution
-Secret sharing schemes
-Provable security
-Comunicació
-Informació
-Classificació AMS::94 Information And Communication, Circuits::94A Communication, information |
|
Drets:
|
|
|
Tipus de document:
|
Article |
|
Publicat per:
|
IEEE
|
|
Compartir:
|
|
