Practical fully secure unrestricted inner product functional encryption modulo \(p\)
type: Item
instance of: scholarly article
title: Practical fully secure unrestricted inner product functional encryption modulo \(p\)
zbMATH Open document ID: 1446.94112
DOI: 10.1007/978-3-030-03329-3_25
author: Guilhem Castagnos
author: Fabien Laguillaumie
author: Ida Tucker
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005598
zbMATH Keywords: inner product functional encryption
zbMATH Keywords: adaptive security
zbMATH Keywords: Diffie-Hellman assumptions
MaRDI profile type: Publication
full work available at URL: 978-3-030-03329-3 25
OpenAlex ID: W2893016992
cites work: Simple Functional Encryption Schemes for Inner Products
cites work: From Selective to Adaptive Security in Functional Encryption
cites work: Q4847920
cites work: Functional Encryption: New Perspectives and Lower Bounds
cites work: Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
cites work: CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Verifiable Functional Encryption
cites work: Functional Encryption: Definitions and Challenges
cites work: Encryption switching protocols revisited: switching modulo \(p\)
cites work: On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
cites work: Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
cites work: Q4249317
cites work: Q4737235
cites work: Advances in Cryptology - CRYPTO 2003
cites work: On the Achievability of Simulation-Based Security for Functional Encryption
cites work: Functional Encryption Without Obfuscation
cites work: Public Key Cryptography - PKC 2005
cites work: How to Run Turing Machines on Encrypted Data
cites work: Reusable garbled circuits and succinct functional encryption
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Functional Encryption with Bounded Collusions via Multi-party Computation
cites work: Extended-DDH and Lossy Trapdoor Functions
cites work: Computing discrete logarithms in quadratic orders
cites work: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
cites work: A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
cites work: Q4789130
cites work: Q3497177
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Identity-Based Cryptosystems and Signature Schemes
cites work: Fuzzy Identity-Based Encryption
cites work: A Punctured Programming Approach to Adaptively Secure Functional Encryption
description: scientific article; zbMATH DE number 7005598