Adaptive Universal Composability Framework for Server-Aided Threshold Signature
نویسندگان
چکیده
The threshold signature scheme is a protocol that allows any subset of t parties out of n to generate a signature. Since the t members can cooperate together to compute the secret key, we introduce the server-aided threshold signature, which provides controllability for activating the signing function in a certain enhanced way. In this study, we present a server-aided threshold RSA signature protocol against the adaptive attacks. We give the universally composable secure model for the server-aided threshold signature primitive and prove that the proposed protocol is claimed to be well-formed, correct and unforgeability. As a separate contribution we also prove that it is also secure in the adaptive universal composability framework. After the discussion about the security and the performance, we claim that the protocol is practical and efficient.
منابع مشابه
Virtual Smart Cards: How to Sign with a Password and a Server
An important shortcoming of client-side cryptography on consumer devices is the poor protection of secret keys. Encrypting the keys under a human-memorizable password hardly offers any protection when the device is stolen. Trusted hardware tokens such as smart cards can provide strong protection of keys but are cumbersome to use. We consider the case where secret keys are used for digital signa...
متن کاملA Novel Universally Composable Threshold Signature Protocol for Mobile Ad-Hoc Network
Mobile ad-hoc network has received a lot of attention recently, adapting threshold signature schemes to work in such environments is challenging. In this study, we propose a novel threshold RSA signature protocol. The proposed protocol is suitable for the mobile ad-hoc networks, for it is completely non-interactive and has simple algorithm. Furthermore, we will give the concrete analysis of the...
متن کاملServer-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model
We consider secure two-party computation in the client-server model. In our scenario, two adversaries operate separately but simultaneously, each of them corrupting one of the parties and a restricted subset of servers that they interact with. We model security in this setting via the local universal composability framework introduced by Canetti and Vald and show that informationtheoretically s...
متن کاملAn optimistic fair exchange protocol and its security in the universal composability framework
Fair exchange protocols allow both or neither of two parties to obtain the other’s items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by prescribing three forms of signatures, namely presignature, post-signature and notarised signature. We set an expiration date for presignature, and t...
متن کاملAdaptive Oblivious Transfer and Generalization
Oblivious Transfer (OT) protocols were introduced in the seminal paper of Rabin, and allow a user to retrieve a given number of lines (usually one) in a database, without revealing which ones to the server. The server is ensured that only this given number of lines can be accessed per interaction, and so the others are protected; while the user is ensured that the server does not learn the numb...
متن کامل