Concurrent Secure Computation with Optimal Query Complexity

DOI10.1007/978-3-662-48000-7_3zbMath1351.94032OpenAlexW1428002948MaRDI QIDQ3457059

Abhishek Jain, Vipul Goyal, Ran Canetti

Publication date: 10 December 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Concurrently Composable Security with Shielded Super-Polynomial Simulators

Cites Work

• Session-key generation using human passwords only
• Concurrent zero knowledge, revisited
• What Information Is Leaked under Concurrent Composition?
• Concurrently Secure Computation in Constant Rounds
• Impossibility Results for Static Input Secure Computation
• Password-Authenticated Session-Key Generation on the Internet in the Plain Model
• On Concurrently Secure Computation in the Multiple Ideal Query Model
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Precise Concurrent Zero Knowledge

This page was built for publication: Concurrent Secure Computation with Optimal Query Complexity