摘要: We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The guarantees that protocols behave like an ideal service, even when concurrently composed with arbitrary set of protocols. This is strong guarantee: it implies maintained unbounded number copies the scheme are running concurrently, non-malleability (not only respect to other same protocol but protocols), provides resilience selective decommitment, and more. Unfortunately, two-party UC do not exist in plain model. However, we construct uc based on general complexity assumptions, common reference string model where all parties have access taken from predetermined distribution. non-interactive, sense both opening phases consist single message committer receiver.