Efficient covert two-party computation

DOI10.1007/978-3-319-76578-5_22MaRDI QIDQ1749305zbMATH OpenOpenAlexFDO

Authors Stanislaw Jarecki

Publication date 16 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76578-5_22

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Covert two-party computation
• On the round complexity of covert computation
• Efficient Concurrent Covert Computation of String Equality and Set Intersection
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Fast cut-and-choose-based protocols for malicious and covert adversaries

Cited in

(18)

• Covert authentication from lattices
• Efficient two-party exponentiation from quotient transfer
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Covert security with public verifiability: faster, leaner, and simpler
• Covert computation in self-assembled circuits
• Public verifiability in the covert model (almost) for free
• On the round complexity of covert computation
• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• On the feasibility of consistent computations
• Covert two-party computation
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Efficient multiparty computation for arithmetic circuits against a covert majority
• Covert computation in self-assembled circuits
• Practical covert authentication
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
• Short concurrent covert authenticated key exchange (short cAKE)
• Locally covert learning

This page was built for publication: Efficient covert two-party computation

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