Impossibility results for static input secure computation

DOI10.1007/978-3-642-32009-5_25MaRDI QIDQ2914274zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32009-5_25

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1418289
• On the limitations of universally composable two-party computation without set-up assumptions
• Cross-domain secure computation
• New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
• Bounded-concurrent secure two-party computation without setup assumptions

Cited in

(6)

• Concurrent secure computation with optimal query complexity
• Cross-domain secure computation
• New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
• On Input Indistinguishable Proof Systems
• Concurrent secure computation via non-black box simulation
• On constant-round concurrent zero-knowledge from a knowledge assumption

This page was built for publication: Impossibility results for static input secure computation

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