Results 261 to 270 of about 20,623 (302)
Some of the next articles are maybe not open access.
Visual secret sharing for multiple secrets
Pattern Recognition, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsien-Chu Wu +2 more
exaly +2 more sources
, 1995 We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly to the current participants.
Christian Cachin
openaire +2 more sources
Secret Sharing System and Secret Sharing Matrix
2009 International Conference on Computational Intelligence and Security, 2009To make the secret sharing management more effective and safe, based on the (k, n) threshold secret sharing scheme, this article propose a new concept of generalized (k, n)-secret sharing matrix, and proposed a more safe (t, k, n) threshold secret sharing scheme by generalizing the (t, k, n) threshold secret sharing matrix.
Guangliang Liu +3 more
openaire +1 more source
Designs, Codes and Cryptography, 1998
Traditional approaches to the secret sharing problem are focused to the problem of how to divide a secret into shares distributed among a set of users in such a way that only a qualified subset of users can reconstruct the secret while any unqualified group of users have no information about the secret.
He Jingmin, Ed Dawson
openaire +1 more source
Traditional approaches to the secret sharing problem are focused to the problem of how to divide a secret into shares distributed among a set of users in such a way that only a qualified subset of users can reconstruct the secret while any unqualified group of users have no information about the secret.
He Jingmin, Ed Dawson
openaire +1 more source
Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +2 more
openaire +2 more sources
2020
Generating additive secret shares of a shuffled dataset - such that neither party knows the order in which it is permuted - is a fundamental building block in many protocols, such as secure collaborative filtering, oblivious sorting, and secure function evaluation on set intersection.
Melissa Chase +2 more
openaire +2 more sources
Generating additive secret shares of a shuffled dataset - such that neither party knows the order in which it is permuted - is a fundamental building block in many protocols, such as secure collaborative filtering, oblivious sorting, and secure function evaluation on set intersection.
Melissa Chase +2 more
openaire +2 more sources
IEEE Transactions on Information Forensics and Security, 2021
Secret sharing, a well-known cryptographic technique, introduced 40 years ago as a private and reliable variant of classical storage, has now become a major cryptographic primitive with numerous real-world applications. In this paper we consider the digital forensics aspects of secret sharing. We investigate the problem of framing which occurs when a
Yvo Desmedt +2 more
openaire +1 more source
Secret sharing, a well-known cryptographic technique, introduced 40 years ago as a private and reliable variant of classical storage, has now become a major cryptographic primitive with numerous real-world applications. In this paper we consider the digital forensics aspects of secret sharing. We investigate the problem of framing which occurs when a
Yvo Desmedt +2 more
openaire +1 more source
Probability of shares in secret sharing schemes
Information Processing Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +2 more
openaire +2 more sources
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2018
Confidentiality is a fundamental goal in many security contexts. Deception is another goal in which the intention is to mislead adversaries, for example by planting false information in a system. In this paper, we consider an approach that combines confidentiality and deception using secret sharing, which has traditionally been used strictly for ...
Lei Zhang, Douglas M. Blough
openaire +1 more source
Confidentiality is a fundamental goal in many security contexts. Deception is another goal in which the intention is to mislead adversaries, for example by planting false information in a system. In this paper, we consider an approach that combines confidentiality and deception using secret sharing, which has traditionally been used strictly for ...
Lei Zhang, Douglas M. Blough
openaire +1 more source
Computers & Graphics, 2002
Abstract In this paper, we propose a method such that a secret image is shared by n shadow images, and any r shadow images (r⩽n) of them can be used to restore the whole secret image. The size of each shadow image is smaller than the secret image in our method.
Chih-Ching Thien, Ja-Chen Lin
openaire +1 more source
Abstract In this paper, we propose a method such that a secret image is shared by n shadow images, and any r shadow images (r⩽n) of them can be used to restore the whole secret image. The size of each shadow image is smaller than the secret image in our method.
Chih-Ching Thien, Ja-Chen Lin
openaire +1 more source