Functional Encryption for Turing Machines (Q2796122)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Functional Encryption for Turing Machines	scientific article

Statements

scholarly article

0 references

Functional Encryption for Turing Machines (English)

0 references

0 references

Prabhanjan V. Ananth

0 references

Theory of Cryptography

0 references

publication date

23 March 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-49096-9_6

0 references

From Selective to Adaptive Security in Functional Encryption

0 references

Functional Encryption: New Perspectives and Lower Bounds

0 references

Computationally private randomizing polynomials and their applications

0 references

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys

0 references

Indistinguishability Obfuscation from Compact Functional Encryption

0 references

On Extractability Obfuscation

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

On the (im)possibility of obfuscating programs

0 references

Protecting Obfuscation against Algebraic Attacks

0 references

Succinct Randomized Encodings and their Applications

0 references

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing

0 references

Function-Private Functional Encryption in the Private-Key Setting

0 references

Functional Encryption: Definitions and Challenges

0 references

Indistinguishability Obfuscation: From Approximate to Exact

0 references

Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part II

0 references

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs

0 references

On the Achievability of Simulation-Based Security for Functional Encryption

0 references

Multi-input Functional Encryption

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Reusable garbled circuits and succinct functional encryption

0 references

Functional Encryption with Bounded Collusions via Multi-party Computation

0 references

Public-Coin Differing-Inputs Obfuscation and Its Applications

0 references

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory

0 references

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

0 references

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key

0 references

Fuzzy Identity-Based Encryption

0 references

A Punctured Programming Approach to Adaptively Secure Functional Encryption

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-49096-9_6

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2796122

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2796122&oldid=36237239"