New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation

DOI10.1007/978-3-642-32009-5_26zbMath1297.94041OpenAlexW2401711873MaRDI QIDQ2914275

Vipul Goyal, Manoj Prabhakaran, Shweta Agrawal, Abhishek Jain, Amit Sahai

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_26

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Concurrent Secure Computation via Non-Black Box Simulation ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption