Threshold changeable secret sharing schemes revisited

By Zhifang Zhang, Y. Chee, San Ling, Mulan Liu, Huaxiong Wang. 2012

43 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Rawad Bitar
2. Salim el Rouayheb
3. Jörg Kliewer
4. Jehoshua Bruck
5. Michael Langberg
6. Wentao Huang
7. Dan Feldman

In Computer Vision and Pattern Recognition

1. Dan Feldman
2. Andreas Krause
3. Mario Lucic

Citations in the corpus

• Communication Efficient Secret Sharing (2015, background): “A secret sharing scheme is perfect if a subset of parties is either authorized or blocked, i.e., A∪B = 2{1,...,n}.”
• Staircase codes for secret sharing with optimal communication and read overheads (2015, background): “[13] constructed CESS codes for the same parameters over GF (q), where q > n.”