Predicate encryption from bilinear maps and one-sided probabilistic rank

DOI10.1007/978-3-030-36030-6_7zbMath1455.94105OpenAlexW2990150172MaRDI QIDQ2175910

Robin Hui, Josh Alman

Publication date: 30 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_7

zbMATH Keywords

bilinear mapspredicate encryptionprobabilistic rank

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• The complexity of Boolean functions in different characteristics
• Representing Boolean functions as polynomials modulo composite numbers
• The landscape of communication complexity classes
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back
• Order-Revealing Encryption and the Hardness of Private Learning
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Predicate Encryption for Circuits from LWE
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Predicate Privacy in Encryption Systems
• New algorithms and lower bounds for circuits with linear threshold gates
• Probabilistic rank and matrix rigidity
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Efficient Construction of Rigid Matrices Using an NP Oracle

This page was built for publication: Predicate encryption from bilinear maps and one-sided probabilistic rank