We propose a cryptosystem that has an inherent key escrow mechanism. This leads us to propose a session based public verifiable key escrow system that greatly improves the amount of key material the escrow servers has to keep in order to decrypt an encryption. In our scheme the servers will only have a single secret sharing, as opposed to a single key from every escrowed player. This is done wh...

A , (m  ) n threshold secret sharing scheme is a method for distributing a secret amongst a group of participants. In a , (m  ) n threshold secret sharing scheme any m participants recover the secret, but no ) 1 (  m participants can [6]. Each of participants is allocated a share of the secret. The secret can only be reconstructed when the shares are combined together [2]. In this paper, we ...

We first explain the notion of secret sharing and also threshold schemes, which can be implemented with the Shamir’s secret sharing. Subsequently, we review social secret sharing [6,10] and its trust function. In a secret sharing scheme, a secret is shared among a group of players who can later recover the secret. We review the construction of a social secret sharing scheme and its application ...

In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme, based on one-dimensional cellular automata where the number of secrets is not restricted by n or t. We show that our scheme can be used to solve an open problem proposed recently in Alvarez et al. (2008) [G. Alvarez, L. Hernández Encinas, A. Martín del Rey, A multisecret sharing scheme for color images based on ...

Distributed key generation (DKG) has been studied extensively in the cryptographic literature. However, it has never been examined outside of the synchronous setting, and the known DKG protocols cannot guarantee safety or liveness over the Internet. In this work, we present the first realistic DKG protocol for use over the Internet. We propose a practical system model for the Internet and defin...

In the paper we apply graph vertex coloring for verification of secret shares. We start from showing how to convert any graph into the number and vice versa. Next, theoretical result concerning properties of n-colorable graphs is stated and proven. From this result we derive graph coloring check-digit scheme. Feasibility of proposed scheme increases with the size of the number, which digits are...

If phenomenal experience is a physical phenomenon, it must occur at some spatial and temporal location. Can consciousness be situated in such a strong sense? Although the importance of embodiment and situatedness is often mentioned, most neuroscientists and philosophers alike consider phenomenal experience as an outcome of neural activity. In this paper, the question I would raise is whether th...

A (t, n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t − 1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the secret. The other one is a (t, n)-thr...

Password-protected secret sharing (PPSS) schemes allow a user to publicly share its high-entropy secret across different servers and to later recover it by interacting with some of these servers using only his password without requiring any authenticated data. In particular, this secret will remain safe as long as not too many servers get corrupted. However, servers are not always reliable and ...