Pages that link to "Item:Q5021129"

The following pages link to Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129):

Displayed 15 items.

• Perfect secure computation in two rounds (Q1629404) ‎ (← links)
• Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) ‎ (← links)
• A simple construction of iO for Turing machines (Q1631340) ‎ (← links)
• Impossibility of quantum virtual black-box obfuscation of classical circuits (Q2120091) ‎ (← links)
• A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) ‎ (← links)
• Adaptively secure garbling schemes for parallel computations (Q2175942) ‎ (← links)
• On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) ‎ (← links)
• On actively-secure elementary MPC reductions (Q2695655) ‎ (← links)
• A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine (Q3297645) ‎ (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) ‎ (← links)
• Perfect Secure Computation in Two Rounds (Q5149757) ‎ (← links)
• The communication complexity of private simultaneous messages, revisited (Q5918864) ‎ (← links)
• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) ‎ (← links)
• Additive randomized encodings and their applications (Q6186592) ‎ (← links)
• A framework for statistically sender private OT with optimal rate (Q6186604) ‎ (← links)