Pages that link to "Item:Q5259583"
From MaRDI portal
The following pages link to How to use indistinguishability obfuscation (Q5259583):
Displaying 50 items.
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035) (← links)
- Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- A Plausibly Deniable Encryption Scheme Utilizing PUF’s Thermo-Sensitivity (Q3297484) (← links)
- Watermarking Cryptographic Capabilities (Q4561266) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- (Q4638057) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Witness Maps and Applications (Q5041158) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) (Q5056035) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Universal Samplers with Fast Verification (Q5738767) (← links)
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (Q5738789) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Cryptography with Updates (Q5738983) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT (Q5918347) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation (Q5919024) (← links)
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions (Q5919680) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Symmetric Key Exchange with Full Forward Security and Robust Synchronization (Q6045078) (← links)
- Explainable arguments (Q6045191) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more (Q6108972) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Adaptive multiparty NIKE (Q6114272) (← links)
