Efficient Two-Party Secure Computation on Committed Inputs

DOI10.1007/978-3-540-72540-4_6zbMath1141.94358OpenAlexW2153235002MaRDI QIDQ5429385

Stanislaw Jarecki, Vitaly Shmatikov

Publication date: 29 November 2007

Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (23)

Efficient set intersection with simulation-based security ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Rate-limited secure function evaluation ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Generalizing Efficient Multiparty Computation ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Fair Traceable Multi-Group Signatures ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Secure linear system computation in the presence of malicious adversaries ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries

This page was built for publication: Efficient Two-Party Secure Computation on Committed Inputs