| Summary: | 碩士 === 國立交通大學 === 資訊管理研究所 === 83 === Secret sharing has been a popular research topic in the field
of cryptography, and many schemes have been proposed to solve
the problem. This thesis defines a new problem which could be
considered belonging to the domain of secret sharing. Imaging
the following scenario, a person wants to distribute N secrets
to N subscribers, but no two subscribers get the same secret
value. Moreover, each subscriber only knows what secret value
he acquires, but has no idea of the relationship between other
secrets and who has acquired which secret. The target of this
thesis is to propose a protocol for distributing secrets.
Hierarchical structure and blind signature are two important
concepts used in designing this protocol. The thesis also
analyzes the computational comple- xity in respect of
transmission times and encryption/decryp- tion times. Last, the
security of this protocol and possible cooperative attack are
discussed.
|
|---|
