Theory of Cryptography
From MaRDI portal
Publication:5711666
DOI10.1007/b106171zbMath1079.94531OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711666
Enav Weinreb, Tamir Tassa, Amos Beimel
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106171
Related Items (11)
Distributive weighted threshold secret sharing schemes ⋮ Three hierarchies of simple games parameterized by ``resource parameters ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Hierarchical modeling of aggregate mining conflict in Ontario, Canada ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Any 2-asummable bipartite function is weighted threshold ⋮ Realizing secret sharing with general access structure ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ Multipartite secret sharing by bivariate interpolation ⋮ Monotone circuits for monotone weighted threshold functions ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
This page was built for publication: Theory of Cryptography