How to avoid obfuscation using witness PRFs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722681 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- A one round protocol for tripartite Diffie-Hellman
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Constrained pseudorandom functions and their applications
- Cutting-edge cryptography through the lens of secret sharing
- Functional signatures and pseudorandom functions
- How to Generate and Use Universal Samplers
- How to avoid obfuscation using witness PRFs
- How to obfuscate programs directly
- How to run Turing machines on encrypted data
- How to share a secret
- How to use indistinguishability obfuscation
- Implementing candidate graded encoding schemes from ideal lattices
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Low overhead broadcast encryption from multilinear maps
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Obfuscating circuits via composite-order graded encoding
- On extractability obfuscation
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Practical multilinear maps over the integers
- Protecting obfuscation against algebraic attacks
- Publicly evaluable pseudorandom functions and their applications
- Secret-sharing for \(\mathbf {NP}\)
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Two-round secure MPC from indistinguishability obfuscation
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Witness encryption and its applications
- Witness encryption from instance independent assumptions
Cited in
(26)- Offline witness encryption with semi-adaptive security
- The magic of ELFs
- Cutting-edge cryptography through the lens of secret sharing
- How to build time-lock encryption
- Cutting-edge cryptography through the lens of secret sharing
- Witness encryption from smooth projective hashing system
- How to avoid obfuscation using witness PRFs
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- A map of witness maps: new definitions and connections
- Succinct witness encryption for batch languages and applications
- Identity-based encryption in DDH hard groups
- Offline witness encryption
- Predictable arguments of knowledge
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- The Magic of ELFs
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Cryptography with updates
- Witness maps and applications
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
- Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Unique NIZKs and steganography detection
- Offline witness encryption from witness PRF and randomized encoding in CRS model
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Adaptively sound zero-knowledge SNARKs for UP
- Semi-adaptively secure offline witness encryption from puncturable witness PRF
This page was built for publication: How to avoid obfuscation using witness PRFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799104)
