Simplifying Design and Analysis of Complex Predicate Encryption Schemes (Q5738892)

scientific article; zbMATH DE number 6729680

Language	Label	Description	Also known as
English	Simplifying Design and Analysis of Complex Predicate Encryption Schemes	scientific article; zbMATH DE number 6729680

Statements

instance of

scholarly article

0 references

title

Simplifying Design and Analysis of Complex Predicate Encryption Schemes (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-56620-7_22

0 references

cites work

A Study of Pair Encodings: Predicate Encryption in Prime Order Groups

0 references

Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More

0 references

Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings

0 references

Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs

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

Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings

0 references

Secret-Sharing Schemes: A Survey

0 references

Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption

0 references

Conjunctive, Subset, and Range Queries on Encrypted Data

0 references

Attribute-Based Functional Encryption on Lattices

0 references

Multi-authority Attribute Based Encryption

0 references

Improved Dual System ABE in Prime-Order Groups via Predicate Encodings

0 references

Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula

0 references

Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Functional Encryption Without Obfuscation

0 references

Attribute-based encryption for circuits

0 references

Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations

0 references

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

0 references

Bilinear Entropy Expansion from the Decisional Linear Assumption

0 references

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

0 references

Decentralizing Attribute-Based Encryption

0 references

Unbounded HIBE and Attribute-Based Encryption

0 references

New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques

0 references

Fully Secure Unbounded Inner-Product and Attribute-Based Encryption

0 references

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption

0 references

Fuzzy Identity-Based Encryption

0 references

Predicate Privacy in Encryption Systems

0 references

Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

0 references

Functional Encryption for Regular Languages

0 references

A Punctured Programming Approach to Adaptively Secure Functional Encryption

0 references

Dual System Encryption via Predicate Encodings

0 references

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

0 references

Identifiers

zbMATH Open document ID

1411.94045

0 references

DOI

10.1007/978-3-319-56620-7_22

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738892