Practical Two-Party Computation Based on the Conditional Gate

DOI10.1007/978-3-540-30539-2_10MaRDI QIDQ5465807zbMATH OpenOpenAlexFDO

Authors Berry Schoenmakers, Pim Tuyls

Publication date 12 August 2005

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1808209
• Improved Garbled Circuit: Free XOR Gates and Applications
• Secure two-party computation is practical
• Efficient computations over encrypted data blocks
• A new approach to practical active-secure two-party computation

Cited in

(13)

• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• The price of active security in cryptographic protocols
• Constant-round client-aided secure comparison protocol
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Efficient computations over encrypted data blocks
• A secure and efficient protocol for electronic treasury auctions
• Client-aided two-party secure interval test protocol
• Secure multi-party computation protocol for sequencing problem
• Efficient Binary Conversion for Paillier Encrypted Values
• An Efficient Protocol for Fair Secure Two-Party Computation
• Information Security and Cryptology - ICISC 2005
• The price of active security in cryptographic protocols

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

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