Lossy cryptography from code-based assumptions
From MaRDI portal
Publication:6652889
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
Cites work
- scientific article; zbMATH DE number 3912273 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- A Statistical Decoding Algorithm for General Linear Block Codes
- A dichotomy for local small-bias generators
- A direct key recovery attack on SIDH
- A public-key cryptosystem based on binary Reed-Muller codes
- A simple and sharper proof of the hypergraph Moore bound
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Algebraic attacks against random local functions and their countermeasures
- Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
- All-but-many lossy trapdoor functions
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- All-but-many lossy trapdoor functions from lattices and applications
- An efficient attack of a McEliece cryptosystem variant based on convolutional codes
- An efficient key recovery attack on SIDH
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Attribute-based encryption for circuits
- Breaking SIDH in polynomial time
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Candidate one-way functions based on expander graphs
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Class of constructive asymptotically good algebraic codes
- Collision resistant hashing from sub-exponential learning parity with noise
- Collision-free hashing from lattice problems
- Collusion resistant traitor tracing from learning with errors
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Cryptanalysis of the McEliece public key cryptosystem based on polar codes
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Cryptographic group actions and applications
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Cryptography with constant computational overhead
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient lattice (H)IBE in the standard model
- Efficient oblivious transfer protocols
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Extracting randomness from extractor-dependent sources
- Fully homomorphic encryption using ideal lattices
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Hedged public-key encryption: how to protect against bad randomness
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to mask the structure of codes for a cryptographic use
- IND-CCA secure cryptography based on a variant of the LPN problem
- Incompressible encodings
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Is code equivalence easy to decide?
- LESS is more: code-based signatures without syndromes
- LPN decoded
- Laconic oblivious transfer and its applications
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Lossy functions do not amplify well
- Lossy trapdoor functions and their applications
- Low error efficient computational extractors in the CRS model
- Low-complexity cryptographic hash functions
- McEliece public key cryptosystems using algebraic-geometric codes
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- New Algorithms for Learning in Presence of Errors
- New constructions of collapsing hashes
- Noise-tolerant learning, the parity problem, and the statistical query model
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Oblivious transfer with constant computational overhead
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the Security of Goldreich’s One-Way Function
- On the concrete security of Goldreich's pseudorandom generator
- On the edge-independence number and edge-covering number for regular graphs
- On the security of Goldreich's one-way function
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Polynomial time attack on wild McEliece over quadratic extensions
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Predicate encryption for circuits from LWE
- Pseudorandom correlation functions from variable-density LPN, revisited
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Public-key cryptography from different assumptions
- Quantum FHE (almost) as secure as classical
- Really fast syndrome-based hashing
- Relations between average case complexity and approximation complexity
- SWIFFT: A Modest Proposal for FFT Hashing
- Searching for ELFs in the cryptographic forest
- Secure arithmetic computation with constant computational overhead
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Simple chosen-ciphertext security from low-noise LPN
- Smooth projective hashing and two-message oblivious transfer
- Statistically sender-private OT from LPN and derandomization
- Sum of squares lower bounds for refuting any CSP
- The Magic of ELFs
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two-round oblivious transfer from CDH or LPN
- Wild McEliece
- Wild McEliece Incognito
- Witness maps and applications
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
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)
