Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN	scientific article

Statements

scholarly article

0 references

Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (English)

0 references

0 references

0 references

Advances in Cryptology – CRYPTO 2016

0 references

publication date

30 November 2016

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-53018-4_9

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

Cryptography with Constant Input Locality

0 references

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding

0 references

On the inherent intractability of certain coding problems (Corresp.)

0 references

Smaller Decoding Exponents: Ball-Collision Decoding

0 references

0 references

Noise-tolerant learning, the parity problem, and the statistical query model

0 references

Chosen‐Ciphertext Security from Identity‐Based Encryption

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

0 references

Two-Round Man-in-the-Middle Security from LPN

0 references

On the Amortized Complexity of Zero-Knowledge Protocols

0 references

Universally Composable Oblivious Transfer Based on a Variant of LPN

0 references

On cryptography with auxiliary input

0 references

Message Authentication, Revisited

0 references

Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification

0 references

IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

0 references

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

0 references

A Pseudorandom Generator from any One-way Function

0 references

0 references

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

0 references

Authenticating Pervasive Devices with Human Protocols

0 references

Class of constructive asymptotically good algebraic codes

0 references

Parallel and Concurrent Security of the HB and HB + Protocols

0 references

Theory of Cryptography

0 references

Simple Chosen-Ciphertext Security from Low-Noise LPN

0 references

Efficient Authentication from Hard Learning Problems

0 references

An Improved LPN Algorithm

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs

0 references

Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Cryptography from Learning Parity with Noise

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Chosen-Ciphertext Security via Correlated Products

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-53018-4_9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2835589

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2835589&oldid=36290712"