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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-46497-7_14
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Key-Private Proxy Re-Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Building Key-Private Public-Key Encryption Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Witness Encryption From Instance Independent Assumptions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities With Local Computation

2008English

Public-Key Encryption in a Multi-User Setting: Security Proofs and Improvements

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Continuously Non-Malleable Codes in the Split-State Model From Minimal Assumptions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Indistinguishability Obfuscation From Functional Encryption

2015English

Multi-Client Functional Encryption for Linear Functions in the Standard Model From LWE

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy