Pages that link to "Item:Q4911582"
From MaRDI portal
The following pages link to Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing (Q4911582):
Displaying 29 items.
- Adaptively secure garbling with near optimal online complexity (Q1648850) (← links)
- Adaptively indistinguishable garbled circuits (Q1690262) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Adaptive Security of Yao’s Garbled Circuits (Q3179366) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs (Q6660545) (← links)
