Black-box constructions for secure computation
From MaRDI portal
Publication:2931374
DOI10.1145/1132516.1132531zbMath1301.94116MaRDI QIDQ2931374
Yuval Ishai, Yehuda Lindell, Eyal Kushilevitz, Erez Petrank
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132531
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
94A62: Authentication, digital signatures and secret sharing
Related Items
Semi-honest to Malicious Oblivious Transfer—The Black-Box Way, Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols