Lossy cryptography from code-based assumptions
From MaRDI portal
Publication:6652889
DOI10.1007/978-3-031-68382-4_2MaRDI QIDQ6652889FDOQ6652889
Authors: Quang Dao, Aayush Jain 
Publication date: 13 December 2024
Recommendations
- Collision resistant hashing from sub-exponential learning parity with noise
- Lossy Trapdoor Functions and Their Applications
- Cryptography from learning parity with noise
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- More constructions of lossy and correlation-secure trapdoor functions
chosen-ciphertext securityworst-case complexitytrapdoor functionslossinesshardness of lattice problems
Cites Work
- Correlated pseudorandomness from expand-accumulate codes
- New constructions of collapsing hashes
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Statistically sender-private OT from LPN and derandomization
- Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Oblivious transfer with constant computational overhead
- 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
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- SWIFFT: A Modest Proposal for FFT Hashing
- Title not available (Why is that?)
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Relations between average case complexity and approximation complexity
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient lattice (H)IBE in the standard model
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to mask the structure of codes for a cryptographic use
- Efficient oblivious transfer protocols
- New Algorithms for Learning in Presence of Errors
- Wild McEliece Incognito
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Title not available (Why is that?)
- On the edge-independence number and edge-covering number for regular graphs
- Title not available (Why is that?)
- IND-CCA secure cryptography based on a variant of the LPN problem
- Simple chosen-ciphertext security from low-noise LPN
- Noise-tolerant learning, the parity problem, and the statistical query model
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- A Framework for Efficient and Composable Oblivious Transfer
- All-but-many lossy trapdoor functions
- Attribute-based encryption for circuits
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Public-key cryptography from different assumptions
- Candidate one-way functions based on expander graphs
- Cryptography with constant computational overhead
- 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
- Title not available (Why is that?)
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- A dichotomy for local small-bias generators
- Lossy trapdoor functions and their applications
- Title not available (Why is that?)
- Wild McEliece
- A public-key cryptosystem based on binary Reed-Muller codes
- Polynomial time attack on wild McEliece over quadratic extensions
- Cryptanalysis of the Sidelnikov Cryptosystem
- Smooth projective hashing and two-message oblivious transfer
- On the Security of Goldreich’s One-Way Function
- Title not available (Why is that?)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Class of constructive asymptotically good algebraic codes
- Collision-free hashing from lattice problems
- Cryptanalysis of the McEliece public key cryptosystem based on polar codes
- An efficient attack of a McEliece cryptosystem variant based on convolutional codes
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Hedged public-key encryption: how to protect against bad randomness
- Pseudorandom correlation functions from variable-density LPN, revisited
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- McEliece public key cryptosystems using algebraic-geometric codes
- Quantum FHE (almost) as secure as classical
- Laconic oblivious transfer and its applications
- CSIDH: an efficient post-quantum commutative group action
- LPN decoded
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- CSI-FiSh: efficient isogeny based signatures through class group computations
- All-but-many lossy trapdoor functions from lattices and applications
- Is code equivalence easy to decide?
- Title not available (Why is that?)
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Secure arithmetic computation with constant computational overhead
- Collusion resistant traitor tracing from learning with errors
- The Magic of ELFs
- Collision resistant hashing from sub-exponential learning parity with noise
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Predicate encryption for circuits from LWE
- Sum of squares lower bounds for refuting any CSP
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Instantiability of RSA-OAEP under chosen-plaintext attack
- On the concrete security of Goldreich's pseudorandom generator
- A Statistical Decoding Algorithm for General Linear Block Codes
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- LESS is more: code-based signatures without syndromes
- Extracting randomness from extractor-dependent sources
- Low error efficient computational extractors in the CRS model
- Efficient pseudorandom correlation generators from ring-LPN
- Two-round oblivious transfer from CDH or LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Cryptographic group actions and applications
- Low-complexity cryptographic hash functions
- Algebraic attacks against random local functions and their countermeasures
- Witness maps and applications
- Incompressible encodings
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Indistinguishability obfuscation from well-founded assumptions
- Lossy functions do not amplify well
- Really fast syndrome-based hashing
- Breaking SIDH in polynomial time
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Lossy cryptography from code-based assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652889)
