How to Avoid Obfuscation Using Witness PRFs
From MaRDI portal
Publication:2799104
DOI10.1007/978-3-662-49099-0_16zbMath1382.94170OpenAlexW2293622464MaRDI QIDQ2799104
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_16
Related Items
Cutting-edge cryptography through the lens of secret sharing, A map of witness maps: new definitions and connections, Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation, Multiparty non-interactive key exchange and more from isogenies on elliptic curves, Identity-based encryption in DDH hard groups, Witness encryption from smooth projective hashing system, Offline witness encryption with semi-adaptive security, Predictable Arguments of Knowledge, Cryptography with Updates, Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs, How to build time-lock encryption, How to Avoid Obfuscation Using Witness PRFs, Cutting-Edge Cryptography Through the Lens of Secret Sharing, Offline Witness Encryption, The magic of ELFs, The Magic of ELFs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A one round protocol for tripartite Diffie-Hellman
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- How to Avoid Obfuscation Using Witness PRFs
- Cutting-Edge Cryptography Through the Lens of Secret Sharing
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Practical Multilinear Maps over the Integers
- How to Run Turing Machines on Encrypted Data
- Constrained Pseudorandom Functions and Their Applications
- Low Overhead Broadcast Encryption from Multilinear Maps
- Witness Encryption from Instance Independent Assumptions
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Publicly Evaluable Pseudorandom Functions and Their Applications
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Secret-Sharing for NP
- How to Obfuscate Programs Directly
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- How to Generate and Use Universal Samplers
- How to share a secret
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- Obfuscating Circuits via Composite-Order Graded Encoding
- Functional Signatures and Pseudorandom Functions
- Protecting Obfuscation against Algebraic Attacks
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Witness encryption and its applications
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Extractability Obfuscation
- Two-Round Secure MPC from Indistinguishability Obfuscation
