Lossy cryptography from code-based assumptions

DOI10.1007/978-3-031-68382-4_2MaRDI QIDQ6652889

Quang Dao, Aayush Jain

Publication date: 13 December 2024

zbMATH Keywords

worst-case complexity chosen-ciphertext security trapdoor functions lossiness hardness of lattice problems

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

A direct key recovery attack on SIDH
Breaking SIDH in polynomial time
Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
Oblivious transfer with constant computational overhead
Correlated pseudorandomness from expand-accumulate codes
New constructions of collapsing hashes
Statistically sender-private OT from LPN and derandomization
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Correlated pseudorandomness from the hardness of quasi-abelian decoding
Expand-convolute codes for pseudorandom correlation generators from LPN
A simple and sharper proof of the hypergraph Moore bound
Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
Searching for ELFs in the cryptographic forest
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Smooth projective hashing and two-message oblivious transfer
On the security of Goldreich's one-way function
Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
Quantum FHE (almost) as secure as classical
Anonymous IBE, leakage resilience and circular security from new assumptions
All-but-many lossy trapdoor functions from lattices and applications
All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
Secure arithmetic computation with constant computational overhead
Laconic oblivious transfer and its applications
LPN decoded
On the concrete security of Goldreich's pseudorandom generator
CSIDH: an efficient post-quantum commutative group action
McEliece public key cryptosystems using algebraic-geometric codes
Extracting randomness from extractor-dependent sources
Low error efficient computational extractors in the CRS model
Incompressible encodings
Efficient pseudorandom correlation generators from ring-LPN
Two-round oblivious transfer from CDH or LPN
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
Collision resistant hashing from sub-exponential learning parity with noise
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
CSI-FiSh: efficient isogeny based signatures through class group computations
Worst-case hardness for LPN and cryptographic hashing via code smoothing
Efficient pseudorandom correlation generators: silent OT extension and more
How to mask the structure of codes for a cryptographic use
Cryptographic group actions and applications
Efficient oblivious transfer protocols
Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes
Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
The Magic of ELFs
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
Public-key cryptography from different assumptions
Lossy Functions Do Not Amplify Well
A Dichotomy for Local Small-Bias Generators
All-But-Many Lossy Trapdoor Functions
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Really Fast Syndrome-Based Hashing
New Algorithms for Learning in Presence of Errors
Wild McEliece
Collision-Free Hashing from Lattice Problems
Candidate One-Way Functions Based on Expander Graphs
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
Wild McEliece Incognito
Predicate Encryption for Circuits from LWE
SWIFFT: A Modest Proposal for FFT Hashing
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
Lossy trapdoor functions and their applications
Trapdoors for hard lattices and new cryptographic constructions
On Ideal Lattices and Learning with Errors over Rings
Efficient Lattice (H)IBE in the Standard Model
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
Relations between average case complexity and approximation complexity
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
A Framework for Efficient and Composable Oblivious Transfer
Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
On the Security of Goldreich’s One-Way Function
Hedged Public-Key Encryption: How to Protect against Bad Randomness
A public-key cryptosystem based on binary Reed-Muller codes
On the edge-independence number and edge-covering number for regular graphs
Is code equivalence easy to decide?
A Statistical Decoding Algorithm for General Linear Block Codes
IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes
Sum of squares lower bounds for refuting any CSP
Witness Maps and Applications
LESS is More: Code-Based Signatures Without Syndromes
Fully homomorphic encryption using ideal lattices
Collusion resistant traitor tracing from learning with errors
Algebraic attacks against random local functions and their countermeasures
Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
Simple Chosen-Ciphertext Security from Low-Noise LPN
Pseudorandom generators with long stretch and low locality from random local one-way functions
Polynomial Time Attack on Wild McEliece over Quadratic Extensions
Cryptanalysis of the Sidelnikov Cryptosystem
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Efficient Fully Homomorphic Encryption from (Standard) LWE
Attribute-based encryption for circuits
Class of constructive asymptotically good algebraic codes
Noise-tolerant learning, the parity problem, and the statistical query model
On lattices, learning with errors, random linear codes, and cryptography
Actively secure arithmetic computation and VOLE with constant computational overhead
Indistinguishability obfuscation from well-founded assumptions
Pseudorandom correlation functions from variable-density LPN, revisited
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
An efficient key recovery attack on SIDH