Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
From MaRDI portal
Publication:2901362
DOI10.1007/978-3-642-25513-7_11zbMATH Open1307.94082OpenAlexW50248066MaRDI QIDQ2901362FDOQ2901362
Authors: Tatsuaki Okamoto, Katsuyuki Takashima 
Publication date: 20 July 2012
Published in: Cryptology and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25513-7_11
Recommendations
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- Non-zero inner product encryption with short ciphertexts and private keys
- More efficient constructions for inner-product encryption
- Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation
- Fully secure unbounded zero inner product encryption with short ciphertexts and keys
Cited In (19)
- Compact (targeted homomorphic) inner product encryption from LWE
- Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
- Non-zero inner product encryption with short ciphertexts and private keys
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Improved (hierarchical) inner-product encryption from lattices
- Efficient fully CCA-secure predicate encryptions from pair encodings
- Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation
- Pattern matching in encrypted stream from inner product encryption
- More efficient constructions for inner-product encryption
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- Anonymous HIBE with short ciphertexts: full security in prime order groups
- Functional encryption for public-attribute inner products: achieving constant-size ciphertexts with adaptive security or support for negation
- A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups
- Fully secure unbounded zero inner product encryption with short ciphertexts and keys
- An algebraic framework for Diffie-Hellman assumptions
This page was built for publication: Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901362)
