Pages that link to "Item:Q5465807"

The following pages link to Practical Two-Party Computation Based on the Conditional Gate (Q5465807):

Displaying 11 items.

• Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
• Secure multi-party computation protocol for sequencing problem (Q350932) (← links)
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
• The price of active security in cryptographic protocols (Q2119012) (← links)
• Constant-round client-aided secure comparison protocol (Q2167759) (← links)
• Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
• A Secure and Efficient Protocol for Electronic Treasury Auctions (Q2947111) (← links)
• Client-Aided Two-Party Secure Interval Test Protocol (Q3297629) (← links)
• Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
• An Efficient Protocol for Fair Secure Two-Party Computation (Q5458934) (← links)
• The price of active security in cryptographic protocols (Q6595846) (← links)