A combinatorial approach to threshold schemes
SIAM Journal on Discrete Mathematics
Strongly ideal secret sharing schemes
Journal of Cryptology
A perfect threshold secret sharing scheme to identify cheaters
Designs, Codes and Cryptography
On the Dealer‘s Randomness Required in Secret Sharing Schemes
Designs, Codes and Cryptography
Anonymous secret sharing schemes
Discrete Applied Mathematics
Communications of the ACM
On the bound for anonymous secret sharing schemes
Discrete Applied Mathematics
Secret Sharing in Multilevel and Compartmented Groups
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Providing Anonymity in Unconditionally Secure Secret Sharing Schemes
Designs, Codes and Cryptography
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
Ideal Multipartite Secret Sharing Schemes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Anonymous secret sharing schemes allow a secret to be recovered from shares regardless of the identity of shareholders. Besides being interesting in its own right, this property is especially appealing to guarantee the anonymity of participants when secret sharing is used as a building block of more general distributed protocols (e.g. to anonymously share the secret key corresponding to a public key). However, current constructions of anonymous secret sharing schemes are not very efficient (because of the number of shares that every participant must hold) and existing bounds do not leave much room for optimism. In this paper we propose to weaken the anonymity condition to partial anonymity, where by partial anonymity we mean that the identity of the participant is not made public, but he is known to belong to some subset. That is, the search for a participant narrows down to one in a set of possible candidates. Furthermore, we propose a general construction of partial anonymous secret sharing schemes.