Tightly CCA-secure inner product functional encryption scheme

DOI10.1016/j.tcs.2021.10.008zbMath1481.94114OpenAlexW3211179957WikidataQ121815698 ScholiaQ121815698MaRDI QIDQ2055966

Shuai Han, Shengli Liu, Xiang-Yu Liu, Da-Wu Gu

Publication date: 1 December 2021

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

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

zbMATH Keywords

multi-user settingfunction privacytight securityinner product functional encryptionCCA security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Fine-grained verifier NIZK and its applications

Cites Work

• Unnamed Item
• Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
• Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
• Practical functional encryption for quadratic functions with applications to predicate encryption
• Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Efficient functional encryption for inner-product values with full-hiding security
• Shorter QA-NIZK and SPS with tighter security
• Functional Encryption for Inner Product with Full Function Privacy
• Functional Encryption Without Obfuscation
• Function-Hiding Inner Product Encryption
• Compactly Hiding Linear Spans
• Tightly CCA-Secure Encryption Without Pairings
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• An Algebraic Framework for Diffie-Hellman Assumptions
• Simple Functional Encryption Schemes for Inner Products
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Achieving IND-CCA Security for Functional Encryption for Inner Products
• Functional Encryption: Definitions and Challenges
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
• Identity-Based Encryption from the Weil Pairing
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Candidate Multilinear Maps from Ideal Lattices
• A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
• Multi-input Functional Encryption
• Reusable garbled circuits and succinct functional encryption
• CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
• Multi-input Inner-Product Functional Encryption from Pairings
• Tightly secure inner product functional encryption: multi-input and function-hiding constructions
• Tightly secure inner product functional encryption: multi-input and function-hiding constructions

This page was built for publication: Tightly CCA-secure inner product functional encryption scheme