Improved (Hierarchical) Inner-Product Encryption from Lattices
From MaRDI portal
Publication:4916012
DOI10.1007/978-3-642-36362-7_15zbMath1314.94097OpenAlexW174561455MaRDI QIDQ4916012
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_15
latticespredicate encryptionlearning with errorspseudo-commutativity(hierarchical) inner-product encryptionfull-rank difference encoding
Related Items
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ A generic construction of CCA-secure attribute-based encryption with equality test ⋮ Spatial encryption revisited: from delegatable multiple inner product encryption and more ⋮ Vector and functional commitments from lattices ⋮ Compact (Targeted Homomorphic) Inner Product Encryption from LWE ⋮ Compact Inner Product Encryption from LWE ⋮ Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
Cites Work
- Unnamed Item
- Unnamed Item
- Public key cryptography -- PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21--23, 2012. Proceedings
- 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
- Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- Wildcarded identity-based encryption
- Inner-product encryption under standard assumptions
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- (Leveled) fully homomorphic encryption without bootstrapping
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
- Circular and KDM Security for Identity-Based Encryption
- Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
- Revocable Identity-Based Encryption from Lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice-Based Hierarchical Inner Product Encryption
- A Group Signature Scheme from Lattice Assumptions
- Functional Encryption for Inner Product Predicates from Learning with Errors
- On the Amortized Complexity of Zero-Knowledge Protocols
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
- 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
- An Efficient and Parallel Gaussian Sampler for Lattices
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Identity-Based Encryption Gone Wild
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Generalized Identity Based and Broadcast Encryption Schemes
- Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards
- Hierarchical Predicate Encryption for Inner-Products
- Attribute-Based Functional Encryption on Lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Generating Shorter Bases for Hard Random Lattices
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Improved (Hierarchical) Inner-Product Encryption from Lattices
