scientific article; zbMATH DE number 1024063

Michael Kearns, Richard J. Lipton, Merrick L. Furst, Avrim L. Blum

Publication date: 17 September 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

On solving LPN using BKW and variants, Implementation and analysis, Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Cryptography from Learning Parity with Noise, Exploring crypto dark matter: new simple PRF candidates and their applications, Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)], Garbling XOR gates ``for free in the standard model, Fast Pseudorandom Functions Based on Expander Graphs, Bloom Filters in Adversarial Environments, Making the BKW algorithm practical for LWE, An approach for stream ciphers design based on joint computing over random and secret data, Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\), On the nonlinearity of monotone Boolean functions, Permuted puzzles and cryptographic hardness, FHEW with Efficient Multibit Bootstrapping, Actively secure half-gates with minimum overhead under duplex networks, Sublinear-communication secure multiparty computation does not require FHE, Homomorphic encryption: a mathematical survey, A non-heuristic approach to time-space tradeoffs and optimizations for BKW, Computational wiretap coding from indistinguishability obfuscation, Multikey Fully Homomorphic Encryption and Applications, Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms, Correlated pseudorandomness from expand-accumulate codes, Statistically sender-private OT from LPN and derandomization, Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\), Efficient authentication from hard learning problems, Expand-convolute codes for pseudorandom correlation generators from LPN, Indistinguishability obfuscation, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), How to Encrypt with the LPN Problem, Separating Models of Learning with Faulty Teachers, BKW meets Fourier new algorithms for LPN with sparse parities, Covert learning: how to learn with an untrusted intermediary, Solving the learning parity with noise's open question, Computational fuzzy extractors, Agnostic Learning from Tolerant Natural Proofs, A family of trapdoor ciphers, CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN, New Algorithms for Learning in Presence of Errors, Unnamed Item, TinyKeys: a new approach to efficient multi-party computation, Parallel and Concurrent Security of the HB and HB + Protocols, On the Fourier spectrum of symmetric Boolean functions, Unnamed Item, Two-Round Man-in-the-Middle Security from LPN, Perfect Structure on the Edge of Chaos, An improved algorithm for learning sparse parities in the presence of noise, Parallel and concurrent security of the HB and \(HB^{+}\) protocols, Separating models of learning with faulty teachers, Breaking the circuit size barrier for secure computation under quasi-polynomial LPN, Large scale, actively secure computation from LPN and free-XOR garbled circuits, Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems, Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security, Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts, Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN, Cryptography with constant input locality, Synthesizers and their application to the parallel construction of pseudo-random functions, Oblivious Transfer Based on the McEliece Assumptions, Efficient pseudorandom correlation generators from ring-LPN, Unnamed Item, The Complexity of Public-Key Cryptography, Pseudorandom Functions: Three Decades Later, Homomorphic Encryption, Towards efficient LPN-based symmetric encryption