分野別セミナー

Secret sharing scheme is a corner stone of secure distributed computation. Shamir and Blakley independently addressed this problem in 1979 when they introduced the concept of the threshold secret sharing. In the basic form of secret sharing schemes, it was assumed that everyone involved with the protocol is semi-honest. But for the real life scenario, this assumption may not hold good due to the presence of adversary. This idea leads to the development of secret sharing under various adversarial models. It may happen that some participants behave maliciously during the execution of the protocol. This observation led to robust and cheating identifiable secret sharing schemes. Here, we discuss about brief history and recent constructions of robust and cheating identifiable secret sharing schemes.





This visit is supported by the JSPS-DST Strategic Japanese-Indian Cooperative Programme on Multidisciplinary Research Field.
http://itslab.csce.kyushu-u.ac.jp/jsps/new/indexd236.html?page_id=12