Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

DOI10.1007/978-3-642-03356-8_30zbMath1252.94065OpenAlexW2138187106MaRDI QIDQ3183582

Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou

Publication date: 20 October 2009

Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_30

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Two-round adaptively secure multiparty computation from standard assumptions, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Constant-round adaptive zero-knowledge proofs for NP, Adaptive security of multi-party protocols, revisited, Efficient one-sided adaptively secure computation, Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS, On the Computational Overhead of MPC with Dishonest Majority, Removing Erasures with Explainable Hash Proof Systems, Generic Construction of UC-Secure Oblivious Transfer, On the power of secure two-party computation, Adaptively secure MPC with sublinear communication complexity, Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption, On the Power of Secure Two-Party Computation, Adaptively Secure Garbled Circuits from One-Way Functions, Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model