Boolean arithmetic over F₂ from group commutators
From MaRDI portal
Publication:7356261
Cites work
- A Property of Finite Simple Non-Abelian Groups
- Communication Complexity in Algebraic Two-Party Protocols
- Computing Algebraic Formulas Using a Constant Number of Registers
- Homomorphic cryptosystems and their applications.
- On compression functions over groups with applications to homomorphic encryption
- On non-Abelian homomorphic public-key cryptosystems
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- Realizing complex boolean functions with simple groups
- The Ore conjecture.
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
This page was built for publication: Boolean arithmetic over \(\mathbb{F}_2\) from group commutators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356261)