Results 11 to 20 of about 578 (210)
A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parties can efficiently reconstruct the secret while any "unqualified" subset of parties cannot efficiently learn anything about the secret.
Ilan Komargodski, Moni Naor, Eylon Yogev
openaire +3 more sources
On the size of shares for secret sharing schemes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. M. Capocelli +3 more
openaire +4 more sources
Is quantum secret sharing different to the sharing of a quantum secret? [PDF]
We present an experimental scheme to perform continuous variable (2,3) threshold quantum secret sharing on the quadratures amplitudes of bright light beams. It requires a pair of entangled light beams and an electro-optic feedforward loop for the reconstruction of the secret.
Lance, A. M. +5 more
openaire +2 more sources
Secret Sharing with Binary Shares
Published ...
Fuchun Lin +4 more
openaire +7 more sources
A Note on Multiple Secret Sharing Using Chinese Remainder Theorem and Exclusive-OR
This paper reviews the former existing scheme on (n,n) -multiple secret sharing (MSS) for color images along with its slight limitation. This scheme generates a set of n shared images from a set of n secret images using the Chinese remainder theorem (CRT)
Heri Prasetyo, Jing-Ming Guo
doaj +1 more source
Anonymous Quantum Conference Key Agreement
Conference key agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that want to keep their shared ...
Frederik Hahn, Jarn de Jong, Anna Pappa
doaj +1 more source
Image visualization encryption algorithm based on Shamir threshold secret key sharing
An image visualization encryption algorithm with authentication function by using Shamir scheme was proposed.The main idea of this algorithm is to obtain the data by segmenting the binary secret image into blocks.Then,Shamir scheme was used to obtain the
Yifu TAN,Zichen LI
doaj +3 more sources
Analysis of the conjugacy search problem of the Diffie-Hellman protocol based on the SL(2,3) subgroup [PDF]
The purpose of the Diffie-Hellman key exchange is to establish a shared secret key given that the protocol works in an abelian group setting. In this paper, conditions are presented to attain a shared secret key over a nonabelian group for the well-known
Jusoo Siti Hasanah +3 more
doaj +1 more source
Probabilistic Secret Sharing. [PDF]
In classical secret sharing schemes a dealer shares a secret among a set of participants in such a way that qualified subsets can reconstruct the secret, while forbidden ones do not get any kind of information about it. The basic parameter to optimize is the size of the shares, that is, the amount of secret information that the dealer has to give to ...
D’Arco, Paolo +4 more
openaire +3 more sources
A Tag-Based PHY-Layer Authentication Scheme Without Key Distribution
Authentication is the process of confirming the legal identity of communicating entities, and it is the first line of defense for security communication.
Yongli An, Shikang Zhang, Zhanlin Ji
doaj +1 more source

