Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai

Published Jan 1, 2015• 27 citations
Publisher
DOI
10.1007/978-3-662-46494-6_12

Related papers

Concurrently Composable Non-interactive Secure Computation

Andrew Morgan, Rafael Pass

Lecture notes in computer science•Jan 1, 2022•0 citations

Concurrently Secure Computation in Constant Rounds

Sanjam Garg, Vipul Goyal, Abhishek Jain +1 more

Lecture notes in computer science•Jan 1, 2012•50 citations

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

Dana Dachman-Soled, Jonathan I. Katz, Vanishree Rao

Lecture notes in computer science•Jan 1, 2015•44 citations

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima

Journal of Cryptology•Feb 5, 2018•0 citations

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima

Lecture notes in computer science•Jan 1, 2014•27 citations

Round-Efficient Composable Two-Party Quantum Computation

Vipul Goyal, Xiao Rong Liang, Omkant Pandey +2 more

Lecture notes in computer science•Dec 7, 2025•0 citations