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 Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima

Published Jan 1, 2014• 31 citations
Publisher
DOI
10.1007/978-3-662-44381-1_20

Related papers

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

Susumu Kiyoshima

Journal of Cryptology•Feb 5, 2018•0 citations

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

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

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

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

On Secure Multi-party Computation in Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld +1 more

Springer eBooks•Aug 9, 2007•14 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

Black-Box Constructions of Composable Protocols without Set-Up

Huijia Lin, Rafael Pass

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