On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure | Zendy

Ventzislav Nikov | Zendy; ⋆Svetla Nikova | Zendy; Bart Preneel | Zendy; Joos Vandewalle | Zendy

Open Access

On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure

Author(s) -

Ventzislav Nikov,

⋆Svetla Nikova,

Bart Preneel,

Joos Vandewalle

Publication year - 2002

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-00263-4

DOI - 10.1007/3-540-36231-2_33

Subject(s) - verifiable secret sharing , computer science , key distribution , secret sharing , access structure , key (lock) , server , computer network , adversary , computer security , scheme (mathematics) , distributed computing , set (abstract data type) , public key cryptography , cryptography , encryption , mathematics , mathematical analysis , programming language

A Key Distribution Center of a network is a server enabling private communications within groups of users. A Distributed Key Distribution Center is a set of servers that jointly realizes a Key Distribution Center. In this paper we build a robust Distributed Key Distribution Center Scheme secure against active and mobile adversary. We consider a general access structure for the set of servers and for the adversary access structure. We also revise the unconditionally secure Verifiable Secret Sharing Schemes from [11, 10, 19, 22] proposing a modified version which is proactively secure.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research