Publication:4910741
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2008.1365zbMath1259.68080MaRDI QIDQ4910741
Sergey I. Nikolenko, Arist Kojevnikov
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_04cf.html
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
94A62: Authentication, digital signatures and secret sharing
Related Items
On complete one-way functions, Gate Elimination for Linear Functions and New Feebly Secure Constructions, Algebraic cryptography: new constructions and their security against provable break