Pages that link to "Item:Q3183587"
From MaRDI portal
The following pages link to Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (Q3183587):
Displayed 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Polly cracker, revisited (Q285245) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model (Q893865) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Reproducible circularly secure bit encryption: applications and realizations (Q1698399) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption (Q1746967) (← links)
- A simple provably secure AKE from the LWE problem (Q1992397) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks (Q2061928) (← links)
- Incompressible encodings (Q2096497) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Attribute-based conditional proxy re-encryption in the standard model under LWE (Q2148755) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts (Q2167708) (← links)
- Delegating quantum computation in the quantum random oracle model (Q2175931) (← links)
- CPA-to-CCA transformation for KDM security (Q2175934) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- KDM security for identity-based encryption: constructions and separations (Q2215124) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Efficient public-key encryption with equality test from lattices (Q2235763) (← links)
- Quantum-resistant identity-based signature with message recovery and proxy delegation (Q2311060) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Solving the learning parity with noise's open question (Q2444770) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Covert learning: how to learn with an untrusted intermediary (Q2697884) (← links)
