Adaptive security of practical garbling schemes
From MaRDI portal
Publication:2152063
DOI10.1007/978-3-030-65277-7_33zbMath1492.94125OpenAlexW2982334420MaRDI QIDQ2152063
Zahra Jafargholi, Sabine Oechsner
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_33
Related Items (4)
Limits on the adaptive security of Yao's garbling ⋮ Adaptive security of practical garbling schemes ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ On treewidth, separators and Yao's garbling
Cites Work
- A proof of security of Yao's protocol for two-party computation
- Adaptively secure garbling with near optimal online complexity
- Adaptively indistinguishable garbled circuits
- Adaptive security of practical garbling schemes
- Fast garbling of circuits under standard assumptions
- Functional Encryption for Turing Machines
- Adaptively Secure Garbled Circuits from One-Way Functions
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- Instantiating Random Oracles via UCEs
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- On the Security of the “Free-XOR” Technique
- Two Halves Make a Whole
- Adaptive Security of Yao’s Garbled Circuits
- Improved Garbled Circuit: Free XOR Gates and Applications
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- One-Time Programs
- Secure Two-Party Computation Is Practical
- Garbling XOR Gates “For Free” in the Standard Model
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
This page was built for publication: Adaptive security of practical garbling schemes
