Ring-based identity based encryption -- asymptotically shorter MPK and tighter security

DOI10.1007/978-3-030-90456-2_6OpenAlexW3213318819MaRDI QIDQ2697891

Parhat Abla, Han Wang, Zhedong Wang, Feng-Hao Liu

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_6

zbMATH Keywords

packing/unpacking GSW-style encodingsring learning with errors assumption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Lattice-based programmable hash functions and applications

Uses Software

• ring-LWE

Cites Work

• 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
• On the concrete hardness of learning with errors
• Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• On the bit security of cryptographic primitives
• Anonymous IBE, leakage resilience and circular security from new assumptions
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• From selective IBE to full IBE and selective HIBE
• On the untapped potential of encoding predicates by arithmetic circuits and their applications
• Advances in cryptology -- EUROCRYPT 2018. 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 -- May 3, 2018. Proceedings. Part I
• Riding on Asymmetry: Efficient ABE for Branching Programs
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• 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
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Practical Identity-Based Encryption Without Random Oracles
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• Efficient Public Key Encryption Based on Ideal Lattices
• Log Depth Circuits for Division and Related Problems
• A Toolkit for Ring-LWE Cryptography
• Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
• On lattices, learning with errors, random linear codes, and cryptography
• Verifiable random functions from non-interactive witness-indistinguishable proofs

This page was built for publication: Ring-based identity based encryption -- asymptotically shorter MPK and tighter security