One-Sided Adaptively Secure Two-Party Computation

DOI10.1007/978-3-642-54242-8_16MaRDI QIDQ5746345zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Arpita Patra

Publication date 18 February 2014

Published in Theory of Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

oblivious transfernon-committing encryptionadaptively secure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient one-sided adaptively secure computation
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure Two-Party Computation with Erasures
• Two-round adaptively secure multiparty computation from standard assumptions
• scientific article; zbMATH DE number 1256784
• scientific article; zbMATH DE number 1304080
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

Cited in

(8)

• On black-box complexity of universally composable security in the CRS model
• Efficient oblivious transfer for one-sided active adaptive adversaries
• Adaptive security with quasi-optimal rate
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• On Adaptively Secure Multiparty Computation with a Short CRS
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Efficient one-sided adaptively secure computation

This page was built for publication: One-Sided Adaptively Secure Two-Party Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746345)