<--- Back to Details
First PageDocument Content
Cryptographic protocols / Logic gates / Theoretical computer science / Electromagnetism / Circuit complexity / Electronics / Garbled circuit / Secure multi-party computation / Digital electronics / Secure two-party computation / XOR gate / Electronic circuit
Date: 2017-12-30 21:51:59
Cryptographic protocols
Logic gates
Theoretical computer science
Electromagnetism
Circuit complexity
Electronics
Garbled circuit
Secure multi-party computation
Digital electronics
Secure two-party computation
XOR gate
Electronic circuit

DUPLO: Unifying Cut-and-Choose for Garbled Circuits

Add to Reading List

Source URL: acmccs.github.io

Download Document from Source Website

File Size: 1,30 MB

Share Document on Facebook

Similar Documents

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation

DocID: 1xUAz - View Document

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY

DocID: 1vhtk - View Document

LEGO for Two Party Secure Computation Jesper Buus Nielsen and Claudio Orlandi BRICS, Department of Computer Science, Aarhus Universitet, ˚ Abogade 34, 8200 ˚ Arhus, Denmark

LEGO for Two Party Secure Computation Jesper Buus Nielsen and Claudio Orlandi BRICS, Department of Computer Science, Aarhus Universitet, ˚ Abogade 34, 8200 ˚ Arhus, Denmark

DocID: 1tquI - View Document

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries∗ Yehuda Lindell† Benny Pinkas‡

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries∗ Yehuda Lindell† Benny Pinkas‡

DocID: 1tjRM - View Document

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer∗ Yehuda Lindell† Benny Pinkas‡

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer∗ Yehuda Lindell† Benny Pinkas‡

DocID: 1tjPL - View Document