Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More

DOI10.1007/978-3-030-45374-9_22zbMath1501.94047OpenAlexW3023305517MaRDI QIDQ5041173

Feng-Hao Liu, Zhedong Wang, Qiqi Lai

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_22

zbMATH Keywords

super-polynomial modulus restriction

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in cryptology -- ASIACRYPT 2016. 22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4-8, 2016. Proceedings. Part II
• Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
• Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• All-but-many lossy trapdoor functions from lattices and applications
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I
• Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
• Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
• On the Hardness of Learning with Rounding over Small Modulus
• Extended Nested Dual System Groups, Revisited
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• A Framework for Identity-Based Encryption with Almost Tight Security
• Tightly CCA-Secure Encryption Without Pairings
• Learning with Rounding, Revisited
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Key Homomorphic PRFs and Their Applications
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Pseudorandomness
• Faster Bootstrapping with Polynomial Error
• New and Improved Key-Homomorphic Pseudorandom Functions
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Tightly Secure Signatures and Public-Key Encryption
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Identity-Based Cryptosystems and Signature Schemes
• Lattice-based FHE as secure as PKE
• Efficient Pseudorandom Functions via On-the-Fly Adaptation
• Efficient Lattice (H)IBE in the Standard Model
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Efficient Cryptosystems from 2 k -th Power Residue Symbols
• Pseudorandom Functions: Three Decades Later
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Efficient Identity-Based Encryption Without Random Oracles
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More