Practical Two-Party Computation Based on the Conditional Gate

DOI10.1007/978-3-540-30539-2_10zbMath1094.94522OpenAlexW1853639762MaRDI QIDQ5465807

Pim Tuyls, Berry Schoenmakers

Publication date: 12 August 2005

Published in: Advances in Cryptology - ASIACRYPT 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30539-2_10

Mathematics Subject Classification ID

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

Related Items (10)

Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Secure multi-party computation protocol for sequencing problem ⋮ Constant-round client-aided secure comparison protocol ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ An Efficient Protocol for Fair Secure Two-Party Computation ⋮ The price of active security in cryptographic protocols

This page was built for publication: Practical Two-Party Computation Based on the Conditional Gate