CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption (Q6488388)

From MaRDI portal

Revision as of 11:55, 3 December 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7674491

Language	Label	Description	Also known as
English	CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption	scientific article; zbMATH DE number 7674491

Statements

scholarly article

0 references

CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption (English)

0 references

0 references

0 references

publication date

13 April 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

Disjunctions for Hash Proof Systems: New Constructions and Applications

0 references

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

0 references

Generic transformations of predicate encodings: constructions and applications

0 references

Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation

0 references

Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts

0 references

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions

0 references

Naor-Yung paradigm with shared randomness and applications

0 references

Generalized Identity Based and Broadcast Encryption Schemes

0 references

Functional Encryption: Definitions and Challenges

0 references

Conjunctive, Subset, and Range Queries on Encrypted Data

0 references

Practical fully secure unrestricted inner product functional encryption modulo \(p\)

0 references

Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys

0 references

Doubly spatial encryption from DBDH

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Identity-based broadcast encryption with efficient revocation

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Attribute-Based Encryption for Circuits

0 references

Predicate Encryption for Circuits from LWE

0 references

New Techniques for Noninteractive Zero-Knowledge

0 references

Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR

0 references

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

0 references

Quasi-Adaptive NIZK for Linear Subspaces Revisited

0 references

Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption

0 references

Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model

0 references

Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

0 references

Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

0 references

Function private predicate encryption for low min-entropy predicates

0 references

Noninteractive zero knowledge for NP from (Plain) Learning With Errors

0 references

Efficient Adaptively Secure IBBE From the SXDH Assumption

0 references

A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-90567-5_13

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6488388

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6488388&oldid=38012514"