Cryptology ePrint Archive: Report 2012/652
Available versions in chronological order
20121121:184259 (posted 21-Nov-2012 18:42:59 UTC)
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Vipul Goyal and Omkant Pandey and Amit Sahai
Publication Info: Manuscript
20130217:034653 (posted 17-Feb-2013 03:46:53 UTC)
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Huijia Lin and Vipul Goyal and Omkant Pandey and Rafael Pass and Amit Sahai
Publication Info: Manuscript
20130217:035310 (posted 17-Feb-2013 03:53:10 UTC)
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Huijia Lin and Vipul Goyal and Omkant Pandey and Rafael Pass and Amit Sahai
Publication Info: Manuscript
20130217:035608 (posted 17-Feb-2013 03:56:08 UTC)
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Huijia Lin and Vipul Goyal and Omkant Pandey and Rafael Pass and Amit Sahai
Publication Info: Manuscript
20130217:041721 (posted 17-Feb-2013 04:17:21 UTC)
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Vipul Goyal and Huijia Lin and Omkant Pandey and Rafael Pass and Amit Sahai
Publication Info: Manuscript
[
Cryptology ePrint archive
]