The power of negations in cryptography

DOI10.1007/978-3-662-46494-6_3zbMATH Open1354.94032OpenAlexW74032123MaRDI QIDQ5261623FDOQ5261623

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

Recommendations

• On negation complexity of injections, surjections and collision-resistance in cryptography
• Cryptographic properties of monotone Boolean functions
• On the nonlinearity of monotone Boolean functions
• Monotone circuits: one-way functions versus pseudorandom generators
• Cryptography in $NC^0$

Mathematics Subject Classification ID

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

Cited In (15)

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

This page was built for publication: The power of negations in cryptography

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