Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,060,751 papers from all fields of science
Search
Sign In
Create Free Account
Secret sharing
Known as:
Key splitting
, Threshold scheme
, Threshold shadow scheme
Expand
Secret sharing (also called secret splitting) refers to methods for distributing a secret amongst a group of participants, each of whom is allocated…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
Access structure
Adversary (cryptography)
All-or-nothing transform
Authentication
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Hierarchical threshold secret sharing scheme for color images
P. Fathimal
,
P. Rani
Multim. Tools Appl.
2017
Corpus ID: 13124
The applications that use pattern recognition via secret sharing are seldom linear, straightforward and uncomplicated. The layers…
Expand
2013
2013
ANALYSING SECURE IMAGE SECRET SHARING SCHEMES BASED ON STEGANOGRAPHY
Sonali D. Patil
,
Kapil Tajane
,
Janhavi Sirdeshpande
2013
Corpus ID: 124757420
The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst…
Expand
2009
2009
Secret sharing on trees: problem solved
L. Csirmaz
,
G. Tardos
IACR Cryptology ePrint Archive
2009
Corpus ID: 540549
We determine the worst case information rate for all secret sharing schemes based on trees. It is the inverse of 2 − 1/c, where c…
Expand
2009
2009
Robust Location Tag Generation from Noisy Location Data for Security Applications
D. Qiu
,
D. Boneh
,
S. Lo
,
P. Enge
2009
Corpus ID: 17060446
Location-based security service provides authorization of persons or facilities based on their distinctive location information…
Expand
2007
2007
A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps
Chen Wei
,
Long Xiang
,
Bai Yuebin
,
Gao Xiaopeng
International Conference on Parallel Processing…
2007
Corpus ID: 18003596
In a (t, n) threshold secret sharing scheme, any t- out-of-n participants could recover the shared secret, and any less than t…
Expand
2004
2004
Mitigating routing misbehaviour of rational nodes in CHORD
Marius Portmann
,
S. Ardon
,
A. Seneviratne
International Symposium on Applications and the…
2004
Corpus ID: 16138517
In peer-to-peer systems, nodes rely on other nodes to route and forward messages to their destinations. If peer-to-peer…
Expand
2004
2004
Secret sharing with access structures in a hierarchy
Chin-Chen Chang
,
Chu-Hsing Lin
,
Wei Lee
,
Pai-Cheng Hwang
18th International Conference on Advanced…
2004
Corpus ID: 5909608
We propose a secret sharing scheme with the property of access structures in a hierarchy. We employ the concept of admission…
Expand
2000
2000
Scene-Based Shot Change Detection and Comparative Evaluation
L. Cheong
Computer Vision and Image Understanding
2000
Corpus ID: 5809611
A key step for managing a large video database is to partition the video sequences into shots. Past approaches to this problem…
Expand
1998
1998
Faster learning of control parameters through sharing experiences of autonomous mobile robots
I. Kelly
,
D. Keating
International Journal of Systems Science
1998
Corpus ID: 1088130
This paper describes a learning algorithm for small autonomous mobile robots based on sets of fuzzy automata. The task of the…
Expand
1978
1978
Group random-access disciplines for multi-access broadcast channels
I. Rubin
IEEE Transactions on Information Theory
1978
Corpus ID: 36763759
A group random-access (GILA) control discipline for a multi-access communication channel is presented and studied. A GILA scheme…
Expand