Lecture notes in computer science

Concurrently Composable Security with Shielded Super-Polynomial Simulators

Brandon Broadnax, Nico Döttling, Gunnar Hartung, Jörn Müller‐Quade, Matthias Nagel

Published Jan 1, 2017• 18 citations

Related papers

Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation

Amit Agarwal, James Bartusek, Vipul Goyal +2 more

Concurrently Composable Non-interactive Secure Computation

Andrew Morgan, Rafael Pass

Simulatable Security and Polynomially Bounded Concurrent Composition.

Dennis Hofheinz, Dominique Unruh

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

Vipul Goyal, Huijia Lin, Omkant Pandey +2 more

Concurrent Secure Computation via Non-Black Box Simulation

Vipul Goyal, Divya Gupta, Amit Sahai