Lecture notes in computer science

Optimal Parameters for Efficient Two-Party Computation Protocols

Chaya Ganesh, Chandrasekharan Pandu Rangan

Published Jan 1, 2012• 0 citations

DOI: 10.1007/978-3-642-30955-7_12

Related papers

Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

Thomas H. Schneider

Aug 4, 201225 citations

An Efficient Protocol for Fair Secure Two-Party Computation

Mehmet Sabır Kiraz, Berry Schoenmakers

Lecture notes in computer scienceApr 4, 200815 citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Lecture notes in computer scienceJan 1, 2007431 citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Journal of CryptologyApr 9, 201451 citations

Efficient Round-Optimal Secure Two-Party Computation from Sigma-protocol

Yonglong Tang, Chunming Tang

In this paper, based on Sigma-protocol on HC (a NP-complete language), we firstly construct a Sigma-protocol for any NP language thm1 ∧ thm2, then transfer it into a non-interactive protocol from a hash function and a pseudo-random generator. Finally, we construct an efficient round-optimal secure two-party computation protocol from our non-interactive protocols.

Apr 1, 20100 citations

Round Optimal Two-Party Computation

Michele Ciampi, Luisa Siniscalchi

Information security and cryptographyAug 21, 20250 citations