Concurrent Secure Computation via Non-Black Box Simulation

DOI10.1007/978-3-662-48000-7_2zbMath1351.94048OpenAlexW1418662826MaRDI QIDQ3457058

Divya Gupta, Vipul Goyal, Amit Sahai

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_2

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Non-black-box simulation in the fully concurrent setting, revisited ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way

Cites Work

• Lower bounds and impossibility results for concurrent self composition
• What Information Is Leaked under Concurrent Composition?
• Concurrently Secure Computation in Constant Rounds
• Impossibility Results for Static Input Secure Computation
• New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation
• Concurrent Blind Signatures Without Random Oracles
• Password-Authenticated Session-Key Generation on the Internet in the Plain Model
• Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
• Resettably Secure Computation
• On Concurrently Secure Computation in the Multiple Ideal Query Model
• Round Optimal Blind Signatures
• Efficient Round Optimal Blind Signatures
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Round-Optimal Composable Blind Signatures in the Common Reference String Model

This page was built for publication: Concurrent Secure Computation via Non-Black Box Simulation