Monotone circuits for monotone weighted threshold functions

DOI10.1016/J.IPL.2005.09.008MaRDI QIDQ1044746zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Enav Weinreb

Publication date 18 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.09.008

zbMATH Keywords

computational complexitycryptographyparallel algorithmstheory of computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4179276
• Efficient monotone circuits for threshold functions
• Towards breaking the exponential barrier for general secret sharing
• Weighted threshold secret sharing schemes
• Characterizing Ideal Weighted Threshold Secret Sharing

Cites work

• How to share a secret
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 46318 (Why is no real title available?)
• scientific article; zbMATH DE number 3214539 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• Majority Gate Networks
• Majority gates vs. general weighted threshold gates
• Mathematical Foundations of Computer Science 2005
• Monotone Boolean formulas can approximate monotone linear threshold functions
• On the Size of Weights for Threshold Gates
• Parallel computation with threshold functions
• Progress in Cryptology - INDOCRYPT 2003
• Relating monotone formula size and monotone depth of Boolean functions
• Short monotone formulae for the majority function
• Simulating Threshold Circuits by Majority Circuits
• Theory of Cryptography
• Weighted threshold secret sharing schemes

Cited in

(20)

• Efficient monotone circuits for threshold functions
• On the characterization of weighted simple games
• Strengthening convex relaxations of 0/1-sets using Boolean formulas
• Any 2-asummable bipartite function is weighted threshold
• Decomposing 1-Sperner hypergraphs
• Practical (fully) distributed signatures provably secure in the standard model
• Secret-Sharing Schemes: A Survey
• How to share a secret
• Ideal hierarchical secret sharing schemes
• Improved approximation of linear threshold functions
• Monotone circuits for matching require linear depth
• Small extended formulation for knapsack cover inequalities from monotone circuits
• Positive neural networks in discrete time implement monotone-regular behaviors
• Cryptography with weights: MPC, encryption and signatures
• The complexity of game isomorphism
• Distributed randomness using weighted VUFs
• Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
• Swiper: a new paradigm for efficient weighted distributed protocols
• On the optimization of bipartite secret sharing schemes
• Some results of Maria Serna on strategic games: complexity of equilibria and models

This page was built for publication: Monotone circuits for monotone weighted threshold functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044746)