Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

DOI10.1007/978-3-662-53890-6_23zbMath1407.94126OpenAlexW2899523861MaRDI QIDQ2953793

Shota Yamada, Shuichi Katsumata

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_23

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (23)

Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Adaptively secure distributed PRFs from LWE ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ Efficient lattice-based inner-product functional encryption ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Lattice-based programmable hash functions and applications ⋮ 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 ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Compact Hierarchical IBE from Lattices in the Standard Model ⋮ Efficient public-key encryption with equality test from lattices ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Identity-based encryption with security against the KGC: a formal model and its instantiations ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance

Uses Software

• FHEW
• ring-LWE

Cites Work

• Unnamed Item
• Worst-case to average-case reductions for module lattices
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Improved Short Lattice Signatures in the Standard Model
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Efficient Identity-Based Encryption over NTRU Lattices
• Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Identity-Based Cryptosystems and Signature Schemes
• Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffie-Hellman
• CCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• On Ideal Lattices and Learning with Errors over Rings
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Practical Identity-Based Encryption Without Random Oracles
• Generalized Identity Based and Broadcast Encryption Schemes
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters
• Improved (Hierarchical) Inner-Product Encryption from Lattices
• A Toolkit for Ring-LWE Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps