A Framework for Universally Composable Non-Committing Blind Signatures.

Masayuki Abe, Miyako Ohkubo

Published Jan 1, 2009• 0 citations

Abstract

A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. This paper shows that even non-committing variants of UC blind signature functionality can not be realized in the plain model. We characterize UC non-committing blind signatures in the common reference string model by presenting equivalent stand-alone security notions under static corruption. Usefulness of the characterization is demonstrated by showing that Fischlin’s basic stand-alone blind signature scheme can be transformed into a UC non-committing blind signature protocol without using extra cryptographic components. We extend the results to the adaptive corruption model and present analogous notions, theorems, and constructions both in the erasure model and the non-erasure model.

Related papers

A framework for universally composable non-committing blind signatures

Masayuki Abe, Miyako Ohkubo

This paper studies non-committing type of universally composable (UC) blind signature protocols where an adversary does not necessarily commit to a message when requesting a signature. An ordinary UC blind signature functionality requires users to commit to the message to be blindly signed. It is thereby impossible to realise in the plain model. This paper first shows that even non-committing variants cannot be realised in the plain model. We then characterise UC non-committing blind signatures in the common reference string model by presenting equivalent stand-alone security notions under static corruption. The usefulness of the characterisation is demonstrated by showing that Fischlin’s basic stand-alone blind signature scheme can be transformed into a UC non-committing blind signature protocol without using extra cryptographic components. We extend the results to the adaptive corruption model and present analogous notions, theorems, and constructions both in the erasure model and the non-erasure model.

International Journal of Applied CryptographyJan 1, 20129 citations

Universally Composable Blind Signatures in the Plain Model

Aslak Bakke Buan, Kristian Gjøsteen, Lillian Kråkmo

In the universal composability framework, we define an ideal functionality for blind signatures, as an alternative to a functionality recently proposed by Fischlin. Fischlin proves that his functionality cannot be realized in the plain model, but this result does not apply to our functionality. We show that our functionality is realized in the plain model by a blind signature protocol if and only if the corresponding blind signature scheme is secure with respect to blindness and non-forgeability, as defined by Juels, Luby and Ostrovsky.

Jan 1, 20066 citations

UC-Secure Non-interactive Public-Key Encryption

Jan L. Camenisch, Anja Lehmann, Gregory Neven +1 more

The universal composability (UC) framework enables the modular design of cryptographic protocols by allowing arbitrary compositions of lower-level building blocks. Public-key encryption is unarguably a very important such building block. However, so far no UC-functionality exists that offers non-interactive encryption necessary for modular protocol construction. We provide an ideal functionality for non-committing encryption (i.e., public-key encryption secure against adaptive corruptions) with locally generated, and therefore non-interactive, ciphertexts. As a sanity check, we also provide a property-based security notion that we prove to be equivalent to the UC notion. We then show that the encryption scheme of Camenisch et al. (SCN '16) based on trapdoor permutations securely implements our notion in the random-oracle model without assuming secure erasures. This is the best one can hope to achieve as standard-model constructions do not exist due to the uninstantiability of round-optimal adaptively secure message transfer in the standard model (Nielsen, Crypto '02). We illustrate the modular reusability of our functionality by constructing the first non-interactive signcryption scheme secure against adaptive corruptions without secure erasures in the UC framework.

IEEE Computer Security Foundations Workshop (CSFW)Aug 1, 20177 citations

UNIVERSALLY COMPOSABLE BLIND SIGNATURE FUNCTIONALITY

Shirley Cheung, C. H. LEE, Yunlei Zhao

Blind signatures play a critical role in digital cash systems. In this paper, we investigate the blind signature functionality in the framework of universally composable (UC) security — the strongest security guarantees up to now for cryptographic protocols over the Internet. We present the universally composable blind signature functionality, [Formula: see text]. Our approach is based on a new UC signature functionality [Formula: see text], which is a modified version of the original signature functionality [Formula: see text] presented by Canetti. We also prove that [Formula: see text] and [Formula: see text] are actually equivalent with respect to non-adaptive adversaries. Our result is of both theoretical and practical consequence to future research studies and practical implementations of digital cash systems with universally composable security.

International Journal of Information Technology & Decision MakingDec 1, 20040 citations

Highly-Efficient Universally-Composable Commitments based on the DDH Assumption.

Yehuda Lindell

Universal composability (or UC security) provides very strong security guarantees for protocols that run in complex real-world environments. In particular, security is guaranteed to hold when the protocol is run concurrently many times with other secure and possibly insecure protocols. Commitment schemes are a basic building block in many cryptographic constructions, and as such universally composable commitments are of great importance in constructing UC-secure protocols. In this paper, we construct highly efficient UC-secure commitments from the standard DDH assumption, in the common reference string model. Our commitment stage is non-interactive, has a common reference string with O(1) group elements, and has complexity of O(1) exponentiations for committing to a group element (to be more exact, the effective cost is that of 23 1 exponentiations overall, for both the commit and decommit stages). We present 3 a construction that is secure in the presence of static adversaries, and a construction that is secure in the presence of adaptive adversaries with erasures, where the latter construction has an effective additional cost of just 5 1 3 exponentiations. 1

Jan 1, 20110 citations

Universally Composable Commitments.

Ran Canetti, Marc Fischlin

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

Jan 1, 20012 citations