A Feebly Secure Trapdoor Function
From MaRDI portal
Publication:3392948
DOI10.1007/978-3-642-03351-3_14zbMATH Open1248.94069DBLPconf/csr/HirschN09OpenAlexW2134739432WikidataQ57101107 ScholiaQ57101107MaRDI QIDQ3392948FDOQ3392948
Authors: Edward A. Hirsch, Sergey Nikolenko 
Publication date: 18 August 2009
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_14
Recommendations
- Feebly secure cryptographic primitives
- Circuit complexity of linear functions: gate elimination and feeble security
- Absolute results concerning one-way functions and their applications
- Gate elimination for linear functions and new feebly secure constructions
- Trapdoor functions from the computational Diffie-Hellman assumption
Cites Work
- Title not available (Why is that?)
- Foundations of Cryptography
- One way functions and pseudorandom generators
- Title not available (Why is that?)
- A Boolean function requiring 3n network size
- A Complete Public-Key Cryptosystem
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Title not available (Why is that?)
Cited In (5)
- Cryptographic analysis of all \(4 \times 4\)-bit s-boxes
- Algebraic cryptography: new constructions and their security against provable break
- Gate elimination for linear functions and new feebly secure constructions
- Circuit complexity of linear functions: gate elimination and feeble security
- Feebly secure cryptographic primitives
This page was built for publication: A Feebly Secure Trapdoor Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392948)
