The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
From MaRDI portal
Publication:5041157
DOI10.1007/978-3-030-45374-9_7zbMath1500.94014OpenAlexW3023322255MaRDI QIDQ5041157
Geoffroy Couteau, Dennis Hofheinz, Thomas Agrikola
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_7
Related Items (2)
Instantiability of classical random-oracle-model encryption transforms ⋮ Universal proxy re-encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- A generic approach to constructing and proving verifiable random functions
- Graded encoding schemes from obfuscation
- Universal proxy re-encryption
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Spooky Encryption and Its Applications
- The Magic of ELFs
- Constrained Pseudorandom Functions and Their Applications
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- On Virtual Grey Box Obfuscation for General Circuits
- Function Secret Sharing
- How to Obfuscate Programs Directly
- Standard Security Does Not Imply Indistinguishability Under Selective Opening
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- Short and Stateless Signatures from the RSA Assumption
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Indistinguishability Obfuscation from Compact Functional Encryption
- Bounded Key-Dependent Message Security
- On obfuscating point functions
- Perfect Non-interactive Zero Knowledge for NP
- Obfuscation for Cryptographic Purposes
- On Best-Possible Obfuscation
- Securely Obfuscating Re-encryption
- Programmable Hash Functions and Their Applications
- Circular-Secure Encryption from Decision Diffie-Hellman
- A Pseudorandom Generator from any One-way Function
- Indistinguishability Obfuscation from Functional Encryption
- How to use indistinguishability obfuscation
- Obfuscation of Probabilistic Circuits and Applications
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Breaking the Sub-Exponential Barrier in Obfustopia
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Functional Signatures and Pseudorandom Functions
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- New Negative Results on Differing-Inputs Obfuscation
- On Extractability Obfuscation
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
