FE and iO for Turing machines from minimal assumptions
type: Item
instance of: scholarly article
title: FE and iO for Turing machines from minimal assumptions
zbMATH Open document ID: 1430.94053
DOI: 10.1007/978-3-030-03810-6_18
author: Shweta Agrawal
author: Monosij Maitra
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6989752
zbMATH Keywords: indistinguishability obfuscation (iO)
zbMATH Keywords: functional encryption (FE) schemes
zbMATH Keywords: Turing machine model
MaRDI profile type: Publication
full work available at URL: 978-3-030-03810-6 18
OpenAlex ID: W2810344228
cites work: Reusable Garbled Deterministic Finite Automata from Learning With Errors
cites work: From Selective to Adaptive Security in Functional Encryption
cites work: Delegating RAM Computations with Adaptive Soundness and Privacy
cites work: Indistinguishability Obfuscation from Compact Functional Encryption
cites work: Indistinguishability obfuscation for Turing machines: constant overhead and amortization
cites work: Functional Encryption for Turing Machines
cites work: Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
cites work: How to Garble Arithmetic Circuits
cites work: Multi-input Functional Encryption for Unbounded Arity Functions
cites work: Q4783716
cites work: Succinct Randomized Encodings and their Applications
cites work: From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
cites work: Indistinguishability Obfuscation from Functional Encryption
cites work: Functional Encryption: Definitions and Challenges
cites work: Constrained Pseudorandom Functions and Their Applications
cites work: Functional Signatures and Pseudorandom Functions
cites work: Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
cites work: Fully succinct garbled RAM
cites work: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
cites work: Obfuscation of Probabilistic Circuits and Applications
cites work: Watermarking cryptographic capabilities
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
cites work: Breaking the Sub-Exponential Barrier in Obfustopia
cites work: Single-Key to Multi-Key Functional Encryption with Polynomial Loss
cites work: Garbled RAM Revisited
cites work: Q3729902
cites work: Multi-input Functional Encryption
cites work: How to Run Turing Machines on Encrypted Data
cites work: Adaptively indistinguishable garbled circuits
cites work: Obfustopia built on secret-key functional encryption
cites work: Simple and generic constructions of succinct functional encryption
cites work: From Minicrypt to Obfustopia via Private-Key Functional Encryption
cites work: Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
cites work: Compactness vs Collusion Resistance in Functional Encryption
cites work: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
cites work: Output-Compressing Randomized Encodings and Applications
cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
cites work: Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
cites work: How to Garble RAM Programs?
cites work: Fuzzy Identity-Based Encryption
cites work: How to use indistinguishability obfuscation
description: scientific article; zbMATH DE number 6989752