Practice-oriented instances of deterministic LPN

Cites work

: Increasing the Security and Efficiency of
\textsc{Ascon} MAC, PRF, and short-input PRF. Lightweight, fast, and efficient pseudorandom functions
\textsc{Ascon} v1.2: lightweight authenticated encryption and hashing
\textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
A MAC mode for lightweight block ciphers
Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
An average-case depth hierarchy theorem for Boolean circuits
Applied cryptography and network security. 6th international conference, ACNS 2008, New York, NY, USA, June 3--6, 2008. Proceedings
Authenticating Pervasive Devices with Human Protocols
Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
Correlated pseudorandom functions from variable-density LPN
Cryptography from learning parity with noise
Efficient design strategies based on the \textsf{AES} round function
Exploring crypto dark matter: new simple PRF candidates and their applications
Fast AES implementation using ARMv8 ASIMD without cryptography extension
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
How to Encrypt with the LPN Problem
scientific article; zbMATH DE number 1024063 (Why is no real title available?)
scientific article; zbMATH DE number 2081058 (Why is no real title available?)
scientific article; zbMATH DE number 1559516 (Why is no real title available?)
Implementing GCM on ARMv8
IND-CCA secure cryptography based on a variant of the LPN problem
Key homomorphic PRFs and their applications
Lapin: an efficient authentication protocol based on ring-LPN
Large scale, actively secure computation from LPN and free-XOR garbled circuits
Learning with rounding, revisited. New reduction, properties and applications
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
LPN decoded
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Noise-tolerant learning, the parity problem, and the statistical query model
On lattices, learning with errors, random linear codes, and cryptography
Pseudorandom functions and lattices
Pseudorandom functions: three decades later
Robust authenticated-encryption AEZ and the problem that it solves
Secure arithmetic computation with constant computational overhead
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
Simpira v2: a family of efficient permutations using the AES round function
SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
Sok: vector OLE-based zero-knowledge protocols
The advantage of truncated permutations
The influence of large coalitions

This page was built for publication: Practice-oriented instances of deterministic LPN

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411909)