Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits

DOI10.1007/978-3-642-32928-9_12zbMath1300.68025OpenAlexW2120113619MaRDI QIDQ2912796

Ranjit Kumaresan, Vladimir Kolesnikov

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32928-9_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost

This page was built for publication: Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits