The Power of Negations in Cryptography

DOI10.1007/978-3-662-46494-6_3zbMath1354.94032OpenAlexW74032123MaRDI QIDQ5261623

Igor C. Oliveira, Alon Rosen, Tal Malkin, Siyao Guo

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_3

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography ⋮ Constructions for quantum indistinguishability obfuscation ⋮ On the Complexity of Multivalued Logic Functions over Some Infinite Basis ⋮ Lower bounds for Boolean circuits of bounded negation width ⋮ Asymptotics of growth for non-monotone complexity of multi-valued logic function systems ⋮ Circular security is complete for KDM security ⋮ Unnamed Item ⋮ ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS ⋮ The minimum number of negations in circuits for systems of multi-valued functions ⋮ Negation-limited formulas ⋮ Lower Bounds for DeMorgan Circuits of Bounded Negation Width ⋮ Exact value of the nonmonotone complexity of Boolean functions ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity ⋮ Unnamed Item

This page was built for publication: The Power of Negations in Cryptography