Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
From MaRDI portal
Publication:5451068
DOI10.1007/11593447_8zbMath1154.94463OpenAlexW1948381900MaRDI QIDQ5451068
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_8
Related Items (8)
Secure Two-Party Computation: A Visual Way ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Statistical security in two-party computation revisited ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Secure computation without computers ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ Multiparty quantum private comparison based on quantum walks ⋮ Hashing Garbled Circuits for Free
This page was built for publication: Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
