A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models

@inproceedings{Kiyoshima2017AUA,
  title={A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models},
  author={Susumu Kiyoshima and Huijia Lin and Muthuramakrishnan Venkitasubramaniam},
  booktitle={TCC},
  year={2017}
}
We present a unified framework for obtaining black-box constructions of Universal Composable (UC) protocol in trusted setup models. Our result is analogous to the unified framework of Lin, Pass, and Venkitasubramaniam [STOC’09, Asiacrypt’12] that, however, only yields non-black-box constructions of UC protocols. Our unified framework shows that to obtain black-box constructions of UC protocols, it suffices to implement a special purpose commitment scheme that is, in particular, concurrently… 
5 Citations
Improved Black-Box Constructions of Composable Secure Computation
TLDR
The gap between black-box and non-black-box constructions of composable secure multiparty computation in the plain model under the minimal assumption of semi-honest oblivious transfer is closed by constructing constant-round 1-1 CCA-secure commitments assuming only blackbox access to one-way functions.
On Black-Box Complexity of Universally Composable Security in the CRS Model
TLDR
A thorough study in various corruption modelings while focusing on achieving security in the common reference string CRS model is presented, obtaining the first black-box constructions of adaptive UC secure computation assuming only trapdoor simulatable public-key encryption as well as a variety of concrete assumptions.
From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-theoretic
TLDR
An information-theoretic transformation from any 2-round OT protocol into a 4-round (which is known to be optimal) OT protocol with simulation-based security in the presence of malicious adversaries, which yields a cubic improvement in communication complexity over the best previously known transformation.
A novel approach to public-coin concurrent zero-knowledge and applications on resettable security
TLDR
This paper presents a new construction of the simultaneous resettable zero-knowledge argument system and recovers any previous state needed for the probabilistically checkable proof (PCP) from the current committed state of the public-coin CZK argument system.
On Black-Box Complexity of Universally Composable Security in the CRS Model
TLDR
A thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model is presented, obtaining the first black-box constructions of adaptive UC secure computation assuming only (trapdoor) simulatable public-key encryption.

References

SHOWING 1-10 OF 50 REFERENCES
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
TLDR
A new setup assumption is proposed -- more along the lines of a physical assumption regarding the existence of tamper-proof hardware -- which also suffices to circumvent the impossibility result mentioned above.
New notions of security: achieving universal composability without trusted setup
TLDR
This work proposes a modification to the framework of Universally Composable (UC) security, and argues the meaningfulness of the new notion, which in particular subsumes many of the traditional notions of security.
A unified framework for concurrent security: universal composability from stand-alone non-malleability
TLDR
A unified framework for obtaining Universally Composable (UC) protocols by relying on stand-alone secure non-malleable commitments and shows that UC security where the adversary is a uniform PPT but the simulator is allowed to be a non-uniform PPT is possible without any trusted set-up.
A Unified Framework for UC from Only OT
TLDR
This work weakens the hardness assumption underlying the unified framework to only the existence of a stand-alone secure semi-honest Oblivious Transfer (OT) protocol, and results in the first construction of constant-round secure computation protocols that satisfy a meaningful notions of concurrent security based on tight assumptions.
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
TLDR
A new formulation of tamper-proof hardware in the Global Universal Composable GUC framework is put forth and it is shown how to realize arbitrary functionalities in the two-party setting with GUC security in two rounds under the minimal assumption of One-Way Functions OWFs.
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
TLDR
This paper constructs UC commitment protocols for "David" and "Goliath": a version of the protocol that is secure for computationally unbounded parties, and a more efficient version that makes computational assumptions only about David (the authors require only the existence of a one-way function).
Black-Box Constructions of Composable Protocols without Set-Up
We present the first black-box construction of a secure multi-party computation protocol that satisfies a meaningful notion of concurrent security in the plain model without any set-up, and without
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
TLDR
New constructions for UC secure computation using tamper proof hardware (in a stronger model) are presented, which represent an improvement over the results of Katz in several directions using substantially different techniques.
Generalized Environmental Security from Number Theoretic Assumptions
TLDR
This paper provides gES protocols for general secure computation, based on a new, concrete number theoretic assumption called the relativized discrete log assumption (rDLA), and provides secure protocols for functionalities in the (limited) client-server framework of [PS05], replacing their hash function assumption with the standard discrete log assumptions.
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption
  • Yehuda Lindell
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2011
TLDR
This paper constructs highly efficient UC-secure commitments from the standard DDH assumption, in the common reference string model, where the latter construction has an effective additional cost of just 5 1/3 exponentiations.
...
...