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

Springer eBooks

On Secure Multi-party Computation in Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang

Published Aug 9, 2007• 14 citations
Publisher
DOI
10.1007/978-3-540-74143-5_33

Related papers

Active Security in Multiparty Computation over Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld

Lecture notes in computer science•Jan 1, 2012•5 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•31 citations

A New Approach to Black-Box Concurrent Secure Computation

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey

Lecture notes in computer science•Jan 1, 2018•7 citations

Black-box non-black-box zero knowledge

Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro +1 more

Motivated by theoretical and practical interest, the challenging task of designing cryptographic protocols having only black-box access to primitives has generated various breakthroughs in the last decade. Despite such positive results, even though nowadays we know black-box constructions for secure two-party and multi-party computation even in constant rounds, there still are in Cryptography several constructions that critically require non-black-box use of primitives in order to securely realize some fundamental tasks. As such, the study of the gap between black-box and nonblack-box constructions still includes major open questions.

ACM Symposium on Theory of Computing (STOC)•May 31, 2014•32 citations

Secure multi-party computation problems and their applications

Wenliang Kevin Du, Mikhail J. Atallah

New Security Paradigms Workshop•Jan 1, 2001•19 citations
Motivated by theoretical and practical interest, the challenging task of designing cryptographic protocols having only black-box access to primitives has generated various breakthroughs in the last decade. Despite such positive results, even though nowadays we know black-box constructions for secure two-party and multi-party computation even in constant rounds, there still are in Cryptography several constructions that critically require non-black-box use of primitives in order to securely realize some fundamental tasks. As such, the study of the gap between black-box and nonblack-box constructions still includes major open questions.