Abstract
ABSTRACT In a verifiable secret sharing (VSS) scheme, each participant can check cheating by the dealer or the other participants. In this work, we construct a VSS scheme with the strongest level of computational security and prove its security in the standard model. This scheme is secure against active attack and does not use bilinear pairing and hash function.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Information Security Journal: A Global Perspective
Paper Title
Journal
Date
