Tightly secure inner product functional encryption: multi-input and function-hiding constructions

DOI10.1016/J.TCS.2020.05.008MaRDI QIDQ5896157zbMATH OpenOpenAlexWikidataFDO

Authors Junichi Tomida

Publication date 3 August 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.05.008

zbMATH Keywords

inner productfunctional encryptiontight securitymulti-inputfunction-hiding

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Tightly secure inner product functional encryption: multi-input and function-hiding constructions
• Tightly CCA-secure inner product functional encryption scheme
• Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
• Multi-input inner-product functional encryption from pairings
• Achieving IND-CCA Security for Functional Encryption for Inner Products

Cites work

• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• A Framework for Identity-Based Encryption with Almost Tight Security
• A punctured programming approach to adaptively secure functional encryption
• Adaptive partitioning
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• An algebraic framework for Diffie-Hellman assumptions
• Candidate Multilinear Maps from Ideal Lattices
• Compact structure-preserving signatures with almost tight security
• Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
• Efficient functional encryption for inner-product values with full-hiding security
• Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
• Fully secure functional encryption for inner products, from standard assumptions
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Function-hiding inner product encryption
• Function-hiding inner product encryption is practical
• Function-private functional encryption in the private-key setting
• Functional encryption for inner product with full function privacy
• Functional encryption without obfuscation
• Functional encryption: definitions and challenges
• Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
• Kurosawa-Desmedt meets tight security
• Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
• Multi-input functional encryption
• Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
• Multi-input functional encryption for unbounded arity functions
• Multi-input inner-product functional encryption from pairings
• Practical fully secure unrestricted inner product functional encryption modulo \(p\)
• Practical functional encryption for quadratic functions with applications to predicate encryption
• Simple functional encryption schemes for inner products
• Subgroup security in pairing-based cryptography
• Synthesizers and their application to the parallel construction of pseudo-random functions
• Tight adaptively secure broadcast encryption with short ciphertexts and keys
• Tightly CCA-secure encryption without pairings
• Tightly Secure Signatures and Public-Key Encryption

Cited in

(12)

• Post-quantum secure inner product functional encryption using multivariate public key cryptography
• Tightly secure inner product functional encryption: multi-input and function-hiding constructions
• Multi-client inner-product functional encryption in the random-oracle model
• Hierarchical identity-based inner product functional encryption
• Unbounded inner product functional encryption from bilinear maps
• Efficient lattice-based inner-product functional encryption
• Unbounded inner-product functional encryption with succinct keys
• Tightly CCA-secure inner product functional encryption scheme
• Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
• Multi-client inner product encryption: function-hiding instantiations without random oracles
• Achieving IND-CCA Security for Functional Encryption for Inner Products
• Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption

This page was built for publication: Tightly secure inner product functional encryption: multi-input and function-hiding constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896157)