Pages that link to "Item:Q3179366"
From MaRDI portal
The following pages link to Adaptive Security of Yao’s Garbled Circuits (Q3179366):
Displaying 18 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Security analysis and improvements for the IETF MLS standard for group messaging (Q2096486) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin (Q2188962) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Sequential Circuit Design for Embedded Cryptographic Applications Resilient to Adversarial Faults (Q4589533) (← links)
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing (Q4911582) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Bounded Collusion ABE for TMs from IBE (Q6041291) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
