Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Annual International Cryptology Conference

• Publication date

  2016-08-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-53018-4_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

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

  2016cited by this paper
• Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification

  2015cited by this paper
• How Practical is Public-Key Encryption Based on LPN and Ring-LPN ?

  2014cited by this paper
• Simple Chosen-Ciphertext Security from Low-Noise LPN

  2014influential reference
• Universally Composable Oblivious Transfer Based on a Variant of LPN

  2014cited by this paper
• Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs

  2013cited by this paper
• Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding

  2012cited by this paper
• IND-CCA Secure Cryptography Based on a Variant of the LPN Problem

  2012cited by this paper
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

  2012cited by this paper
• Message Authentication, Revisited

  2012cited by this paper
• Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

  2012cited by this paper
• Cryptography from Learning Parity with Noise

  2012cited by this paper
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$

  2011cited by this paper
• Improved Generalized Birthday Attack

  2011cited by this paper
• Efficient Authentication from Hard Learning Problems

  2011cited by this paper
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

  2011cited by this paper
• Smaller decoding exponents: ball-collision decoding

  2011cited by this paper
• Robustness of the Learning with Errors Assumption

  2010cited by this paper
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

  2009cited by this paper
• Chosen-Ciphertext Security via Correlated Products

  2009cited by this paper
• Amortized complexity of zero knowledge protocols

  2009cited by this paper
• The LPN Problem with Auxiliary Input

  2009cited by this paper
• Concatenated codes

  2009cited by this paper
• On cryptography with auxiliary input

  2009influential reference
• Trapdoors for hard lattices and new cryptographic constructions

  2008cited by this paper
• Cryptography with Constant Input Locality

  2007cited by this paper
• Chosen-Ciphertext Security from Tag-Based Encryption

  2006cited by this paper
• Parallel and Concurrent Security of the HB and HB+ Protocols

  2006cited by this paper
• An Improved LPN Algorithm

  2006cited by this paper
• New Results for Learning Noisy Parities and Halfspaces

  2006cited by this paper
• The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem

  2005cited by this paper
• Authenticating Pervasive Devices with Human Protocols

  2005cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005cited by this paper
• Chosen-Ciphertext Security from Identity-Based Encryption

  2004cited by this paper
• More on Average Case vs Approximation Complexity

  2003cited by this paper
• Secure Human Identification Protocols

  2001cited by this paper
• The relationship between public key encryption and oblivious transfer

  2000influential reference
• Noise-tolerant learning, the parity problem, and the statistical query model

  2000cited by this paper
• A Pseudorandom Generator from any One-way Function

  1999cited by this paper
• Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security

  1999cited by this paper
• 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

  1998cited by this paper
• Cryptographic Primitives Based on Hard Learning Problems

  1993cited by this paper
• Concrete mathematics - a foundation for computer science

  1991cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990cited by this paper
• Proceedings of the twenty-first annual ACM symposium on Theory of computing

  1989cited by this paper
• A method for finding codewords of small weight

  1989cited by this paper
• A hard-core predicate for all one-way functions

  1989cited by this paper
• Universal one-way hash functions and their cryptographic applications

  1989cited by this paper
• Construction of a pseudo-random generator from any one-way function

  1989cited by this paper
• On the inherent intractability of certain coding problems (Corresp.)

  1978cited by this paper
• Class of constructive asymptotically good algebraic codes

  1972cited by this paper

• Trapdoor Hash Functions and PIR from Low-Noise LPN

  2025cites this paper
• Hardness and Algorithms for Batch LPN under Dependent Noise

  2025cites this paper
• Public Key Encryption with Equality Test from Tag-Based Encryption

  2025cites this paper
• Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK

  2025cites this paper
• Post-quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich's LPN

  2025cites this paper
• On Learning Parities with Dependent Noise

  2024cites this paper
• Non-interactive Zero-Knowledge from LPN and MQ

  2024cites this paper
• Reduce and Prange: Revisiting Prange's Information Set Decoding for LPN and RSD

  2024cites this paper
• Theoretical Limits of Provable Security Against Model Extraction by Efficient Observational Defenses

  2023cites this paper
• Towards Topology-Hiding Computation from Oblivious Transfer

  2023cites this paper
• Practically Solving LPN in High Noise Regimes Faster Using Neural Networks

  2023cites this paper
• The Hardness of LPN over Any Integer Ring and Field for PCG Applications

  2022cites this paper
• CCA Security and Trapdoor Functions via Key-Dependent-Message Security

  2022cites this paper
• Attacks on the Firekite cipher

  2022cites this paper
• Low-Complexity Weak Pseudorandom Functions in AC 0[ MOD 2]

  2021cites this paper
• Chosen-Ciphertext Secure Key Encapsulation Mechanism in the Standard Model

  2021cites this paper
• The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its Application

  2021cites this paper
• Towards Efficient LPN-Based Symmetric Encryption

  2021cites this paper
• Covert Learning: How to Learn with an Untrusted Intermediary

  2021cites this paper
• Lockable Obfuscation from Circularly Insecure Fully Homomorphic Encryption

  2021cites this paper
• A New Security Notion for PKC in the Standard Model: Weaker, Simpler, and Still Realizing Secure Channels

  2021influential citation
• Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN

  2020cites this paper
• Functional encryption with application to machine learning: simple conversions from generic functions to quadratic functions

  2020cites this paper
• Receiver Selective Opening CCA Secure Public Key Encryption from Various Assumptions

  2020cites this paper
• Practical CCA-Secure Functional Encryptions for Deterministic Functions

  2020cites this paper
• Efficient oblivious transfer construction via multiple bits dual-mode cryptosystem for secure selection in the cloud

  2019cites this paper
• On Perfect Correctness in (Lockable) Obfuscation

  2019cites this paper
• Collision Resistant Hashing from Sub-exponential Learning Parity with Noise

  2019cites this paper
• CPA-to-CCA Transformation for KDM Security

  2019cites this paper
• CCA Security and Trapdoor Functions via Key-Dependent-Message Security

  2019cites this paper
• New Techniques for Obfuscating Conjunctions

  2019cites this paper
• CCA Secure Multi-recipient KEM from LPN

  2018cites this paper
• Simpler CCA Secure PKE from LPN Problem Without Double-Trapdoor

  2018cites this paper
• New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes

  2018cites this paper
• k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

  2018cites this paper
• On the Hardness of Learning Parity with Noise over Rings

  2018cites this paper
• KDM-Secure Public-Key Encryption from Constant-Noise LPN

  2017cites this paper
• Collision Resistant Hashing from Learning Parity with Noise

  2017cites this paper
• k-Round MPC from k-Round OT via Garbled Interactive Circuits

  2017cites this paper
• Leakage Resilient Leveled <inline-formula><tex-math notation="LaTeX">$\mathsf {FHE}$</tex-math><alternatives><mml:math><mml:mi mathvariant="sans-serif">FHE</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq1-2726554.gif"/></alternatives></inline-formula> on Multiple Bits Message

  2017influential citation
• On the Hardness of Sparsely Learning Parity with Noise

  2017cites this paper
• On the Robustness of Learning Parity with Noise

  2016cites this paper
• Progress in Cryptology – INDOCRYPT 2016

  2016cites this paper
• Reduce and Prange: Revisiting Prange’s ISD for Solving LPN/RSD over Large Fields

  year unknowncites this paper