Cryptography from Learning Parity with Noise (Q2891361)

From MaRDI portal

Revision as of 09:03, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Cryptography from Learning Parity with Noise	scientific article

Statements

scholarly article

0 references

Cryptography from Learning Parity with Noise (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-27660-6_9

0 references

Krzysztof Pietrzak

0 references

SOFSEM 2012: Theory and Practice of Computer Science

0 references

publication date

15 June 2012

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-27660-6_9

0 references

0 references

Public-key cryptography from different assumptions

0 references

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

0 references

New Algorithms for Learning in Presence of Errors

0 references

0 references

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

0 references

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

0 references

Bonsai Trees, or How to Delegate a Lattice Basis

0 references

The Twin Diffie-Hellman Problem and Applications

0 references

Rapid Multiplication of Rectangular Matrices

0 references

Message Authentication, Revisited

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Fully homomorphic encryption using ideal lattices

0 references

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

: Increasing the Security and Efficiency of

0 references

How to Encrypt with the LPN Problem

0 references

0 references

A Pseudorandom Generator from any One-way Function

0 references

Lapin: An Efficient Authentication Protocol Based on Ring-LPN

0 references

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

0 references

Authenticating Pervasive Devices with Human Protocols

0 references

Efficient Authentication from Hard Learning Problems

0 references

Parallel and concurrent security of the HB and \(HB^{+}\) protocols

0 references

An Improved LPN Algorithm

0 references

SWIFFT: A Modest Proposal for FFT Hashing

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

How to Construct Pseudorandom Permutations from Pseudorandom Functions

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

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

0 references

Synthesizers and their application to the parallel construction of pseudo-random functions

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

0 references

A new NP-complete problem and public-key identification

0 references

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

0 references

0 references

A new identification scheme based on syndrome decoding

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2891361

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