{ "name": "Secret sharing schemes", "order": 34, "challenges": [ { "id": "59a5801209a6acac5983b699", "title": "Introduction: Shamir Threshold Scheme", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b303", "title": "A simplified (t,t)-threshold scheme", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b304", "title": "Access structures and general secret sharing", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b305", "title": "Monotone circuit construction", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b306", "title": "Formal definitions", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b307", "title": "Information rate and construction of efficient schemes", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b308", "title": "Vector space construction", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b309", "title": "An upper bound on the information rate", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] }, { "id": "59a5801209a6acac5983b310", "title": "The decomposition construction", "description": [ "" ], "challengeSeed": [ "" ], "tests": [ "" ] } ] }