Related papers: A secret sharing scheme using groups
When using Online Social Networks, users often share information with different social groups. When considering the backgrounds of the groups there is often no or little intersection within the members. This means that a user who shares…
A first multi-proxy multi-signcryption scheme from pairings, which efficiently combines a multi-proxy multi-signature scheme with a signcryption, is proposed. Its security is analyzed in detail. In our scheme, a proxy signcrypter group…
Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its…
Secure E-voting is a challenging protocol. Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature .But most of them need complicated homomorphic encryption which involves complicated…
Group authentication is a method of confirmation that a set of users belong to a group and of distributing a common key among them. Unlike the standard authentication schemes where one central authority authenticates users one by one, group…
Quantum secret sharing is a method for sharing a secret quantum state among a number of individuals such that certain authorized subsets of participants can recover the secret shared state by collaboration and other subsets cannot. In this…
Recommendation systems have received considerable attention in the recent decades. Yet with the development of information technology and social media, the risk in revealing private data to service providers has been a growing concern to…
We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a…
A general proof of the security against eavesdropping of a previously introduced protocol for two-party quantum key distribution based on entanglement swapping [Phys. Rev. A {\bf 61}, 052312 (2000)] is provided. In addition, the protocol is…
This paper proposes a privacy-preserving algorithm to solve the average consensus problem based on Shamir's secret sharing scheme, in which a network of agents reach an agreement on their states without exposing their individual state until…
A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…
We construct general schemes for multi-partite quantum secret sharing using multi-level systems, and find that the consistent conditions for valid measurements can be summarized in two simple algebraic conditions. The scheme using the very…
Messaging between two parties and in the group setting has enjoyed widespread attention both in practice, and, more recently, from the cryptographic community. One of the main challenges in the area is constructing secure (end-to-end…
We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of…
In this paper, we propose two cryptosystems based on group rings and existing cryptosystem. First one is Elliptic ElGamal type group ring public key cryptosystem whose security is greater than security of cryptosystems based on elliptic…
We propose here a quantum secret sharing scheme that works for both quantum and classical secrets. The proposed scheme is based on both entanglement swapping and teleportation together. It allows sender to encrypt his/her secret and…
In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over…
In 1991 the first public key protocol involving automaton groups has been proposed. In this paper we give a survey about algorithmic problems around automaton groups which may have potential applications in cryptography. We then present a…
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold…