Reactive Garbling: Foundation, Instantiation, Application

DOI10.1007/978-3-662-53890-6_34zbMath1407.94145OpenAlexW2554297914MaRDI QIDQ2953804

Samuel Ranellucci, Jesper Buus Nielsen

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

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• MiniLEGO

Cites Work

• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
• Amortizing Garbled Circuits
• Faster Maliciously Secure Two-Party Computation Using the GPU
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• One-Time Programs
• Founding Cryptography on Oblivious Transfer – Efficiently
• LEGO for Two-Party Secure Computation
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
• How to Garble RAM Programs?
• Garbled RAM Revisited

This page was built for publication: Reactive Garbling: Foundation, Instantiation, Application