Reactive garbling: foundation, instantiation, application
From MaRDI portal
Publication:2953804
Recommendations
Cites work
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Amortizing Garbled Circuits
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Faster maliciously secure two-party computation using the GPU
- Founding Cryptography on Oblivious Transfer – Efficiently
- Garbled RAM revisited
- How to garble RAM programs?
- LEGO for Two-Party Secure Computation
- MiniLEGO: efficient secure two-party computation from general assumptions
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- One-Time Programs
- Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(3)
This page was built for publication: Reactive garbling: foundation, instantiation, application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953804)