scientific article; zbMATH DE number 812038
From MaRDI portal
Publication:4853712
zbMath0826.94018MaRDI QIDQ4853712
Gustavus J. Simmons, Wen-Ai Jackson
Publication date: 2 November 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Secret-sharing schemes for very dense graphs ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ Public key encryption with distributed keyword search ⋮ Boolean operations-based visual secret sharing for general access structures ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Restricted adaptive oblivious transfer ⋮ On Linear Secret Sharing for Connectivity in Directed Graphs ⋮ Secret sharing schemes for infinite sets of participants: a new design technique ⋮ Probabilistic secret sharing ⋮ Secret-Sharing Schemes: A Survey ⋮ Fully dynamic secret sharing schemes ⋮ Lower bounds for monotone span programs ⋮ Incidence structures applied to cryptography ⋮ Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\) ⋮ An explication of secret sharing schemes ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Three-level secret sharing schemes from the twisted cubic ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ Shared generation of pseudo-random functions ⋮ Graph decompositions and secret sharing schemes ⋮ Geometric secret sharing schemes and their duals ⋮ Weighted decomposition construction for perfect secret sharing schemes
This page was built for publication:
