Reactive garbling: foundation, instantiation, application
From MaRDI portal
Publication:2953804
DOI10.1007/978-3-662-53890-6_34zbMATH Open1407.94145OpenAlexW2554297914MaRDI QIDQ2953804FDOQ2953804
Authors: Jesper Buus Nielsen, Samuel Ranellucci 
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_34
Recommendations
Cites Work
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- 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
- LEGO for Two-Party Secure Computation
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Amortizing Garbled Circuits
- One-Time Programs
- How to garble RAM programs?
- Garbled RAM revisited
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- MiniLEGO: efficient secure two-party computation from general assumptions
- Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
Cited In (3)
Uses Software
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)
