Private Functional Encryption: Indistinguishability-Based Definitions and Constructions From Obfuscation

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-49890-4_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Indistinguishability Obfuscation From Functional Encryption

2015English

Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Functional Encryption for Randomized Functionalities in the Private-Key Setting From Minimal Assumptions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Private Range Query by Perturbation and Matrix Based Encryption

2011English

Attribute-Based Functional Encryption on Lattices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Alternatives to Non-Malleability: Definitions, Constructions, and Applications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Key-Private Proxy Re-Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Deterministic Encryption: Definitional Equivalences and Constructions Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy