In the traditional scenario in cryptography there is one sender, one receiver and an active or
passive eavesdropper who is an opponent. Depending from the application the sender or …

Motivated by the goal of securely searching and updating distributed data, we introduce and
study the notion of function secret sharing (FSS). This new notion is a natural generalization …

We develop a general approach to adding a threshold functionality to a large class of (non-
threshold) cryptographic schemes. A threshold functionality enables a secret key to be split …

A pseudorandom function F:\mathcalK*\mathcalX→\mathcalY is said to be key homomorphic
if given F (k 1, x) and F (k 2, x) there is an efficient algorithm to compute F (k 1⊕ k 2, x) …

More than ten years have elapsed since the rst completeness theorems for two-party and
multi-party fault-tolerant computation have been announced (by Yao and Goldreich, Micali …

We present an RSA threshold signature scheme. The scheme enjoys the following
properties: 1. it is unforgeable and robust in the random oracle model, assuming the RSA …

Secret sharing schemes protect secrets by distributing them over different locations (share
holders). In particular, in k out of n threshold schemes, security is assured if throughout the …

We describe efficient constructions for various cryptographic primitives in private-key as well
as public-key cryptography. Our main results are two new constructions of pseudo-random …

We discuss the widely increasing range of applications of a cryptographic technique called
multi-party computation. For many decades, this was perceived to be of purely theoretical …

Simplified VSS and fast-track multiparty computations with applications to threshold
cryptography Page 1 Simplified VSS and Fast-track Multiparty Computations with …