Feebly secure cryptographic primitives
From MaRDI portal
Publication:1946841
DOI10.1007/s10958-012-1103-xzbMath1262.94023OpenAlexW2056184684WikidataQ57101014 ScholiaQ57101014MaRDI QIDQ1946841
O. Melanich, Edward A. Hirsch, Sergey I. Nikolenko
Publication date: 9 April 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-1103-x
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Feebly secure cryptographic primitives ⋮ Circuit complexity of linear functions: gate elimination and feeble security ⋮ Gate Elimination for Linear Functions and New Feebly Secure Constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Boolean function requiring 3n network size
- One way functions and pseudorandom generators
- Feebly secure cryptographic primitives
- Gate Elimination for Linear Functions and New Feebly Secure Constructions
- A Feebly Secure Trapdoor Function
- A Complete Public-Key Cryptosystem
- Communication Theory of Secrecy Systems*
- New directions in cryptography
- A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
- A method for obtaining digital signatures and public-key cryptosystems
- On the combinational complexity of certain symmetric Boolean functions
- Foundations of Cryptography
- Explicit lower bound of 4.5n - o(n) for boolena circuits
- On Robust Combiners for Oblivious Transfer and Other Primitives
This page was built for publication: Feebly secure cryptographic primitives
