Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
From MaRDI portal
Publication:3183587
DOI10.1007/978-3-642-03356-8_35zbMath1252.94044OpenAlexW2113333997MaRDI QIDQ3183587
David Cash, Benny Applebaum, Amit Sahai, Chris Peikert
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_35
Related Items
On homomorphic secret sharing from polynomial-modulus LWE ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Unidirectional updatable encryption and proxy re-encryption from DDH ⋮ Homomorphic encryption: a mathematical survey ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Candidate witness encryption from lattice techniques ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ Public key authenticated encryption with keyword search from LWE ⋮ Lattice-based cryptography: a survey ⋮ Quantum search-to-decision reduction for the LWE problem ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ A lower bound for proving hardness of learning with rounding with polynomial modulus ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ On solving LPN using BKW and variants, Implementation and analysis ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Cryptography from Learning Parity with Noise ⋮ Polly cracker, revisited ⋮ The KDM-CCA Security of REACT ⋮ Compact Lossy and All-but-One Trapdoor Functions from Lattice ⋮ Garbling XOR gates ``for free in the standard model ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Multi-key FHE from LWE, Revisited ⋮ Attribute-based conditional proxy re-encryption in the standard model under LWE ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Making the BKW algorithm practical for LWE ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Delegating quantum computation in the quantum random oracle model ⋮ CPA-to-CCA transformation for KDM security ⋮ Compressible FHE with applications to PIR ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ FHEW with Efficient Multibit Bootstrapping ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ On the hardness of module learning with errors with short distributions ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ A Homomorphic Proxy Re-encryption from Lattices ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ On the asymptotic complexity of solving LWE ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ Covert learning: how to learn with an untrusted intermediary ⋮ Updatable public key encryption in the standard model ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Solving the learning parity with noise's open question ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Analysis of Error Terms of Signatures Based on Learning with Errors ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Efficient public-key encryption with equality test from lattices ⋮ A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor ⋮ HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption ⋮ A simple provably secure AKE from the LWE problem ⋮ Packed Ciphertexts in LWE-Based Homomorphic Encryption ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Post-Quantum Forward-Secure Onion Routing ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ Lattice-based identity-based resplittable threshold public key encryption scheme ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Security of signature schemes in the presence of key-dependent messages ⋮ Key-dependent message security: generic amplification and completeness ⋮ Integer Version of Ring-LWE and Its Applications ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ The Geometry of Lattice Cryptography ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Generalized Learning Problems and Applications to Non-commutative Cryptography ⋮ On the success probability of solving unique SVP via BKZ ⋮ On the integer polynomial learning with errors problem ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ Quantum-resistant identity-based signature with message recovery and proxy delegation ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Bounded KDM Security from iO and OWF ⋮ FHE Circuit Privacy Almost for Free ⋮ Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE ⋮ Circular Security Separations for Arbitrary Length Cycles from LWE ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Unnamed Item ⋮ On Symmetric Encryption and Point Obfuscation ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ Incompressible encodings ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile ⋮ Worst-case to average-case reductions for module lattices ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Pseudorandom Functions: Three Decades Later ⋮ Homomorphic Encryption ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Towards efficient LPN-based symmetric encryption ⋮ Hardness of LWE on general entropic distributions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus ⋮ Two-round oblivious transfer from CDH or LPN
