-tolerant agreement, a critical building-block service in robust distributed systems, targeted at the federation model; threshold cryptography improves the basic agreement protocol with proactive, verifiable security and improved resilience to continuous attack. 1

/receiver, but the sender/receiver is an organization. The goal of threshold cryptography is to present practical schemes to solve such problems without the need to use the more general methods of mental games. In this paper we survey some recent research results on this topic. In particular on: DSS based threshold

. Hence an attempt has been made in this paper to identity a suitable asymmetric-threshold based cryptosystems for small MANETs. The study focuses on the comparison of Rivest Shamir Adelman-Threshold Cryptography and Elliptic Curve Cryptography Threshold Cryptography in terms of the performance parameters

In this paper we analyzed the algorithms related to threshold cryptography based protocols in networks security. We showed the hardness of threshold minimum cut problem, revealed its relationship with two other problems. Two approximation algorithms for threshold minimum cut were presented. We also

This paper discusses some issues that arise with securing ad-hoc networks. In particular, the notion of threshold cryptography is explained and its application in ad-hoc networks, with respect to key management, is shown. Furthermore, the concept of Zero Knowledge Proofs, which constitutes a

Abstract. In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present two novel function sharing schemes, one for the RSA signature and the other for the ElGamal decryption functions, based on the Asmuth-Bloom scheme. To the best

sharing schemes have been pro-posed in the literature, with most of them using Shamir secret sharing as the underlying SSS. In this paper, we investigate how threshold cryptography can be conducted with Blakley secret sharing scheme and present a novel function sharing scheme for the RSA cryptosystem

on public key schemes, have been proposed in the literature to meet these security requirements. We propose the use of threshold cryptography and bilinear pairings in order to provide the security requirements that an electronic voting protocol must meet, without requiring the entire infrastructure needed

scheme using threshold cryptography. We describe how the multi-group scheme is adapted to work with secret shares, and compare this scheme with a naïve multi-stream key-management solution by measuring performance across several critical parameters, including tree degree, multi-group size, and number

A threshold cryptosystem or signature scheme is a system with n participants where an honest majority can successfully decrypt a message or issue a signature, but where the security and functionality properties of the system are retained even as the adversary corrupts up to t players. We present