A simple construction of iO for Turing machines
type: Item
instance of: scholarly article
title: A simple construction of iO for Turing machines
zbMATH Open document ID: 1430.94069
DOI: 10.1007/978-3-030-03810-6_16
author: Sanjam Garg
author: Akshayaram Srinivasan
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6989750
zbMATH Keywords: simple construction of indistinguishability obfuscation
zbMATH Keywords: Turing machines
MaRDI profile type: Publication
full work available at URL: 978-3-030-03810-6 16
OpenAlex ID: W2894216532
cites work: Indistinguishability Obfuscation from Compact Functional Encryption
cites work: Succinct garbling schemes from functional encryption through a local simulation paradigm
cites work: Garbled Circuits as Randomized Encodings of Functions: a Primer
cites work: On the (im)possibility of obfuscating programs
cites work: Functional Signatures and Pseudorandom Functions
cites work: Succinct Randomized Encodings and their Applications
cites work: Anonymous IBE, leakage resilience and circular security from new assumptions
cites work: Indistinguishability Obfuscation from Functional Encryption
cites work: Constrained Pseudorandom Functions and Their Applications
cites work: Laconic oblivious transfer and its applications
cites work: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
cites work: Identity-based encryption from the Diffie-Hellman assumption
cites work: New constructions of identity-based and key-dependent message secure encryption schemes
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Two-Round Secure MPC from Indistinguishability Obfuscation
cites work: Q3729902
cites work: Witness encryption and its applications
cites work: Breaking the Sub-Exponential Barrier in Obfustopia
cites work: Adaptively secure garbling with near optimal online complexity
cites work: Adaptively Secure Garbled Circuits from One-Way Functions
cites work: On the Communication Complexity of Secure Function Evaluation with Long Output
cites work: Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
cites work: A proof of security of Yao's protocol for two-party computation
cites work: New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
cites work: Relations Among Complexity Measures
cites work: How to use indistinguishability obfuscation
description: scientific article; zbMATH DE number 6989750