Amplifying the security of functional encryption, unconditionally
type: Item
instance of: scholarly article
title: Amplifying the security of functional encryption, unconditionally
zbMATH Open document ID: 1504.94151
DOI: 10.1007/978-3-030-56784-2_24
author: Aayush Jain
author: Alexis Korb
author: Nathan Manohar
author: Amit Sahai
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614556
zbMATH Keywords: security amplification of parallel repetitions
zbMATH Keywords: set homomorphic secret sharing
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 24
OpenAlex ID: W3048817357
cites work: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
cites work: From FE combiners to secure MPC and back
cites work: From Selective to Adaptive Security in Functional Encryption
cites work: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
cites work: Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
cites work: Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
cites work: Indistinguishability Obfuscation from Compact Functional Encryption
cites work: Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
cites work: Q4633934
cites work: Verifiable random functions from non-interactive witness-indistinguishable proofs
cites work: From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
cites work: Indistinguishability Obfuscation from Functional Encryption
cites work: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
cites work: Functional Encryption: Definitions and Challenges
cites work: Theory of Cryptography
cites work: On the complexity of simulating auxiliary input
cites work: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Obfuscation Combiners
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Functional Encryption Without Obfuscation
cites work: Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
cites work: Breaking the Sub-Exponential Barrier in Obfustopia
cites work: Reusable garbled circuits and succinct functional encryption
cites work: Predicate Encryption for Circuits from LWE
cites work: A generic approach to constructing and proving verifiable random functions
cites work: Simultaneous amplification: the case of non-interactive zero-knowledge
cites work: OT-Combiners via Secure Computation
cites work: An Efficient Parallel Repetition Theorem
cites work: Adaptively Secure Garbled Circuits from One-Way Functions
cites work: Key agreement from weak bit agreement
cites work: One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
cites work: Q4252738
cites work: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
cites work: Combiners for functional encryption, unconditionally
cites work: How to Fake Auxiliary Input
cites work: Obfustopia built on secret-key functional encryption
cites work: Boosting and hard-core set construction
cites work: From Minicrypt to Obfustopia via Private-Key Functional Encryption
cites work: Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
cites work: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
cites work: Amplification of Chosen-Ciphertext Security
cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
cites work: Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
cites work: A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
cites work: Robuster Combiners for Oblivious Transfer
cites work: Q3549641
cites work: How to use indistinguishability obfuscation
cites work: Fuzzy Identity-Based Encryption
cites work: Efficiently Simulating High Min-entropy Sources in the Presence of Side Information
cites work: Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
cites work: A Uniform Min-Max Theorem with Applications in Cryptography
cites work: Oblivious-Transfer Amplification
cites work: Oblivious Transfer from Weak Noisy Channels
description: scientific article; zbMATH DE number 7614556