scientific article; zbMATH DE number 2081058
From MaRDI portal
Publication:4474165
zbMath1062.94549MaRDI QIDQ4474165
Nicholas J. Hopper, Manuel Blum
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480052.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On solving LPN using BKW and variants, Implementation and analysis ⋮ The Cryptographic Power of Random Selection ⋮ Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Cryptography from Learning Parity with Noise ⋮ An approach for stream ciphers design based on joint computing over random and secret data ⋮ Authentication in the bounded storage model ⋮ When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ Learning parities in the mistake-bound model ⋮ Efficient authentication from hard learning problems ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ How to Encrypt with the LPN Problem ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ Solving the learning parity with noise's open question ⋮ Security and Trust in Sensor Networks ⋮ Agnostic Learning from Tolerant Natural Proofs ⋮ New Algorithms for Learning in Presence of Errors ⋮ Computing low-weight discrete logarithms ⋮ Secure computation without computers ⋮ Parallel and Concurrent Security of the HB and HB + Protocols ⋮ On the Security of HB# against a Man-in-the-Middle Attack ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ Improved learning of \(k\)-parities ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ A protocol for provably secure authentication of a tiny entity to a high performance computing one ⋮ Solving LPN using covering codes ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Cryptography with constant input locality ⋮ BehavioCog: An Observation Resistant Authentication Scheme ⋮ Unnamed Item ⋮ Towards efficient LPN-based symmetric encryption
