On the feasibility of consistent computations

DOI10.1007/978-3-642-13013-7_6MaRDI QIDQ3562890zbMATH OpenOpenAlexFDO

Authors Sven Laur, Helger Lipmaa

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_6

zbMATH Keywords

consistencyoblivious transferequivocal and extractable commitmentprivate inference control

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Efficient covert two-party computation
• From Passive to Covert Security at Low Cost

Cited in

(6)

• scientific article; zbMATH DE number 1897131 (Why is no real title available?)
• ASPECTS OF PERSISTENT COMPUTATIONS
• Succinct NP Proofs from an Extractability Assumption
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Computing weak consistency in polynomial time (extended abstract)

This page was built for publication: On the feasibility of consistent computations

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