Research Journal of Applied Sciences Engineering and Technology

Adaptive Universal Composability Framework for Server-Aided Threshold Signature

Xuan Hong, Luqun Li

Published Jan 1, 2013• 0 citations

Abstract

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.

DOI: 10.19026/rjaset.5.5116

Related papers

Universal composable threshold signature

Qiang Li

Threshold signature allowed any subset of t parties generating a signature,but that disallowed the creation of a valid signature if fewer than t parties participate in the protocol.Since the security of threshold signature was only con-sidered in a single instance before,the universal composability framework was introduced.The framework with its secu-rity preserving composition property allowed for modular design and analysis of the threshold signature.The defined ideal functionality of threshold signature is proved equals to the standard security notion of threshold signature.Further-more,how to applying the ideal functionality is described.The proposed threshold signature protocol and proactive threshold signature protocol are not only provably secure,but also universally composable.

Journal of CommunicationsJan 1, 20090 citations

Universally Composable Server-Supported Signatures for Smartphones

Nikita Snetkov, Jelizaveta Vakarjuk, Peeter Laud

Smart-ID is a signing and authentication service available to residents of Belgium, Estonia, Iceland, Latvia and Lithuania. Such smartphone-based signing service delivers the usability of software keys with security guarantees of ID-cards by relying on a remote server to compensate for weak device protection. Security of current Smart-ID relies on multi-prime server-supported RSA, password-authenticated key shares and clone detection mechanism. Unfortunately, the security properties of the underlying protocol (Buldas et al. ESORICS 2017) have been specified only in “game-based” manner. In other words, there are no guarantees for the protocol being secure in concurrent setting. We remedy this shortcoming by presenting two ideal functionalities ℱ gSpl and ℱ Sig Spl for server-supported signing in Universal Composability model. We show that improved RSA server-supported protocol realizes ℱ gSpl and give practical example of server-supported ECDSA protocol realizing ℱ ECDSA Spl .

IACR Communications in CryptologyMay 4, 20263 citations

Efficient and adaptively secure cryptographic primitives---designing for composability

Aggelos Kiayias, Hong-Sheng Zhou

We study efficient protocol constructions against adaptive corruption in the universal composition framework. For standard cryptographic tasks, we propose a new framework to design efficiently two-party secure function evaluation protocols, and then apply it to oblivious transfer and obtain the first practical such constructions. Regarding reactive cryptographic tasks, we present a framework for designing blind signatures, and construct the first practical protocols for this task. ^

Jan 1, 20100 citations

Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography

Masayuki Abe, Masayuki Abe, Serge Fehr

Abstract. We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the nonerasure model, and at the same time completely avoids the use of interactive zero-knowledge proofs. As a consequence, the protocol can be proven secure in a universally-composable (UC) like framework which prohibits rewinding. We prove the security in what we call the singleinconsistent-player UC model, which guarantees arbitrary composition as long as all protocols are executed by the same players. As an application, we propose a fully UC threshold Schnorr signature scheme. Our results are based on a new adaptively-secure Feldman VSS scheme. Although adaptive security was already addressed by Feldman in the original paper, the scheme requires secure communication, secure erasure, and either a linear number of rounds or digital signatures to resolve disputes. Our scheme overcomes all of these shortcomings, but on the other hand requires some restriction on the corruption behavior of the adversary, which however disappears in some applications including our new DLKG protocol. We also propose several new adaptively-secure protocols, which may find other applications, like a sender non-committing encryption scheme, a distributed trapdoor-key generation protocol for Pedersen’s commitment scheme, or distributed-verifier proofs for proving relations among commitments or even any NP relations in general. 1

Jan 1, 20040 citations

Efficient Lattice-Based Threshold Signatures With Functional Interchangeability

Guofeng Tang, Bo Pang, Long Chen +1 more

A threshold signature scheme distributes the ability to generate signatures through distributed key generation and signing protocols. A threshold signature scheme should be functionally interchangeable, meaning that a signature produced by a threshold scheme should be verifiable by the same algorithm used for non-threshold signatures. To resist future attacks from quantum adversaries, lattice-based threshold signatures are desirable. However, the performance of existing lattice-based threshold signing protocols is still far from practical. This paper presents the first lattice-basedt-out-of-nthreshold signature scheme with functional interchangeability that has been implemented. To build ant-out-of-naccess structure for arbitraryt≤n, we first present a novelt-out-of-nversion of the SPDZ MPC protocol. For high concrete efficiency, we avoid using the MPC protocol to evaluate hash operations. Moreover, we design an efficient distributed rejection sampling protocol. As a consequence, the online phase of our distributed signing protocol takes only 0.5 seconds in the two-party setting and 7.3 seconds in the 12-party setting according to our implementation. As a byproduct, our scheme also presents a periodic key refreshment mechanism and offers proactive security.

IEEE Transactions on Information Forensics and SecurityJan 1, 202324 citations

Server-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model

Ignacio Cascudo, Ivan Damg, Oriol Farr +1 more

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 secure two-party computation is possible if and only if there is always at least one server which remains uncorrupted. Moreover, in our protocols each of the servers only needs to communicate with the two clients, i.e. no messages are exchanged directly between servers. This communication pattern is minimal.

Jan 1, 20141 citation