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

A New Approach to Black-Box Concurrent Secure Computation

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey

Published Jan 1, 2018• 6 citations
Publisher
DOI
10.1007/978-3-319-78375-8_19

Related papers

Concurrent Secure Computation via Non-Black Box Simulation

Vipul Goyal, Divya Gupta, Amit Sahai

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

Black-Box Constructions of Bounded-Concurrent Secure Computation

Sanjam Garg, Xiao Rong Liang, Omkant Pandey +1 more

Lecture notes in computer science•Jan 1, 2020•3 citations

The Round Complexity of Black-Box Post-quantum Secure Computation

Rohit Chatterjee, Xiao Rong Liang, Omkant Pandey +1 more

arXiv:2502.13830•Lecture notes in computer science•Jan 1, 2025•1 citation

On Secure Multi-party Computation in Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld +1 more

Springer eBooks•Aug 9, 2007•14 citations

Active Security in Multiparty Computation over Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld

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

Concurrent Secure Computation via Non-Black Box Simulation

Vipul Goyal, Divya Gupta, Amit Sahai

Recently, Goyal (STOC’13) proposed a new non-black-box simulation techniques for fully concurrent zero knowledge with straight-line simulation. Unfortunately, so far this technique is limited to the setting of concurrent zero knowledge. The goal of this paper is to study what can be achieved in the setting of concurrent secure computation using non-black-box simulation techniques, building upon the work of Goyal. The main contribution of our work is a secure computation protocol in the fully concurrent setting with a straight-line simulator, that allows us to achieve several new results: • We give first positive results for concurrent blind signatures and verifiable random functions in the plain model as per the ideal/real world security definition. Our positive result is somewhat surprising in light of the impossibility result of Lindell (STOC’03) for black-box simulation. We circumvent this impossibility using non-black-box simulation. This gives us a quite natural example of a functionality in concurrent setting which is impossible to realize using black-box simulation but can be securely realized using non-black-box simulation.

•Jan 1, 2015•0 citations
Recently, Goyal (STOC’13) proposed a new non-black-box simulation techniques for fully concurrent zero knowledge with straight-line simulation. Unfortunately, so far this technique is limited to the setting of concurrent zero knowledge. The goal of this paper is to study what can be achieved in the setting of concurrent secure computation using non-black-box simulation techniques, building upon the work of Goyal. The main contribution of our work is a secure computation protocol in the fully concurrent setting with a straight-line simulator, that allows us to achieve several new results: • We give first positive results for concurrent blind signatures and verifiable random functions in the plain model as per the ideal/real world security definition. Our positive result is somewhat surprising in light of the impossibility result of Lindell (STOC’03) for black-box simulation. We circumvent this impossibility using non-black-box simulation. This gives us a quite natural example of a functionality in concurrent setting which is impossible to realize using black-box simulation but can be securely realized using non-black-box simulation.