Secret sharing: A comprehensive survey, taxonomy and applications

The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authenticati...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Chattopadhyay, Arup Kumar [verfasserIn] Saha, Sanchita [verfasserIn] Nag, Amitava [verfasserIn] Nandi, Sukumar [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2023

Schlagwörter:	Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing

Übergeordnetes Werk:	Enthalten in: Computer science review - Amsterdam [u.a.] : Elsevier, 2007, 51
Übergeordnetes Werk:	volume:51

DOI / URN:	10.1016/j.cosrev.2023.100608

Katalog-ID:	ELV067216943

Internformat


LEADER	01000naa a22002652 4500
001	ELV067216943
003	DE-627
005	20240226093040.0
007	cr uuu---uuuuu
008	240226s2023 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.cosrev.2023.100608 \|2 doi
035			\|a (DE-627)ELV067216943
035			\|a (ELSEVIER)S1574-0137(23)00075-8
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
082	0	4	\|a 004 \|q VZ
100	1		\|a Chattopadhyay, Arup Kumar \|e verfasserin \|0 (orcid)0000-0001-9884-7565 \|4 aut
245	1	0	\|a Secret sharing: A comprehensive survey, taxonomy and applications
264		1	\|c 2023
336			\|a nicht spezifiziert \|b zzz \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed.
650		4	\|a Secret sharing
650		4	\|a Threshold secret sharing
650		4	\|a Multi-secret sharing
650		4	\|a Verifiable secret sharing
700	1		\|a Saha, Sanchita \|e verfasserin \|4 aut
700	1		\|a Nag, Amitava \|e verfasserin \|4 aut
700	1		\|a Nandi, Sukumar \|e verfasserin \|4 aut
773	0	8	\|i Enthalten in \|t Computer science review \|d Amsterdam [u.a.] : Elsevier, 2007 \|g 51 \|h Online-Ressource \|w (DE-627)546503101 \|w (DE-600)2390720-4 \|w (DE-576)284748439 \|x 1876-7745 \|7 nnns
773	1	8	\|g volume:51
912			\|a GBV_USEFLAG_U
912			\|a GBV_ELV
912			\|a SYSFLAG_U
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_74
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_101
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_150
912			\|a GBV_ILN_151
912			\|a GBV_ILN_187
912			\|a GBV_ILN_213
912			\|a GBV_ILN_224
912			\|a GBV_ILN_230
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2049
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2106
912			\|a GBV_ILN_2110
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2232
912			\|a GBV_ILN_2470
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 51

Indexfelder

author_variant	a k c ak akc s s ss a n an s n sn
matchkey_str	article:18767745:2023----::erthrnaopeesvsretxnma
hierarchy_sort_str	2023
publishDate	2023
allfields	10.1016/j.cosrev.2023.100608 doi (DE-627)ELV067216943 (ELSEVIER)S1574-0137(23)00075-8 DE-627 ger DE-627 rda eng 004 VZ Chattopadhyay, Arup Kumar verfasserin (orcid)0000-0001-9884-7565 aut Secret sharing: A comprehensive survey, taxonomy and applications 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed. Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing Saha, Sanchita verfasserin aut Nag, Amitava verfasserin aut Nandi, Sukumar verfasserin aut Enthalten in Computer science review Amsterdam [u.a.] : Elsevier, 2007 51 Online-Ressource (DE-627)546503101 (DE-600)2390720-4 (DE-576)284748439 1876-7745 nnns volume:51 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 51
spelling	10.1016/j.cosrev.2023.100608 doi (DE-627)ELV067216943 (ELSEVIER)S1574-0137(23)00075-8 DE-627 ger DE-627 rda eng 004 VZ Chattopadhyay, Arup Kumar verfasserin (orcid)0000-0001-9884-7565 aut Secret sharing: A comprehensive survey, taxonomy and applications 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed. Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing Saha, Sanchita verfasserin aut Nag, Amitava verfasserin aut Nandi, Sukumar verfasserin aut Enthalten in Computer science review Amsterdam [u.a.] : Elsevier, 2007 51 Online-Ressource (DE-627)546503101 (DE-600)2390720-4 (DE-576)284748439 1876-7745 nnns volume:51 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 51
allfields_unstemmed	10.1016/j.cosrev.2023.100608 doi (DE-627)ELV067216943 (ELSEVIER)S1574-0137(23)00075-8 DE-627 ger DE-627 rda eng 004 VZ Chattopadhyay, Arup Kumar verfasserin (orcid)0000-0001-9884-7565 aut Secret sharing: A comprehensive survey, taxonomy and applications 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed. Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing Saha, Sanchita verfasserin aut Nag, Amitava verfasserin aut Nandi, Sukumar verfasserin aut Enthalten in Computer science review Amsterdam [u.a.] : Elsevier, 2007 51 Online-Ressource (DE-627)546503101 (DE-600)2390720-4 (DE-576)284748439 1876-7745 nnns volume:51 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 51
allfieldsGer	10.1016/j.cosrev.2023.100608 doi (DE-627)ELV067216943 (ELSEVIER)S1574-0137(23)00075-8 DE-627 ger DE-627 rda eng 004 VZ Chattopadhyay, Arup Kumar verfasserin (orcid)0000-0001-9884-7565 aut Secret sharing: A comprehensive survey, taxonomy and applications 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed. Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing Saha, Sanchita verfasserin aut Nag, Amitava verfasserin aut Nandi, Sukumar verfasserin aut Enthalten in Computer science review Amsterdam [u.a.] : Elsevier, 2007 51 Online-Ressource (DE-627)546503101 (DE-600)2390720-4 (DE-576)284748439 1876-7745 nnns volume:51 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 51
allfieldsSound	10.1016/j.cosrev.2023.100608 doi (DE-627)ELV067216943 (ELSEVIER)S1574-0137(23)00075-8 DE-627 ger DE-627 rda eng 004 VZ Chattopadhyay, Arup Kumar verfasserin (orcid)0000-0001-9884-7565 aut Secret sharing: A comprehensive survey, taxonomy and applications 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed. Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing Saha, Sanchita verfasserin aut Nag, Amitava verfasserin aut Nandi, Sukumar verfasserin aut Enthalten in Computer science review Amsterdam [u.a.] : Elsevier, 2007 51 Online-Ressource (DE-627)546503101 (DE-600)2390720-4 (DE-576)284748439 1876-7745 nnns volume:51 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 51
language	English
source	Enthalten in Computer science review 51 volume:51
sourceStr	Enthalten in Computer science review 51 volume:51
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing
dewey-raw	004
isfreeaccess_bool	false
container_title	Computer science review
authorswithroles_txt_mv	Chattopadhyay, Arup Kumar @@aut@@ Saha, Sanchita @@aut@@ Nag, Amitava @@aut@@ Nandi, Sukumar @@aut@@
publishDateDaySort_date	2023-01-01T00:00:00Z
hierarchy_top_id	546503101
dewey-sort	14
id	ELV067216943
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV067216943</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240226093040.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240226s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cosrev.2023.100608</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV067216943</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1574-0137(23)00075-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chattopadhyay, Arup Kumar</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-9884-7565</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Secret sharing: A comprehensive survey, taxonomy and applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Secret sharing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Threshold secret sharing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-secret sharing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Verifiable secret sharing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Saha, Sanchita</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nag, Amitava</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nandi, Sukumar</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computer science review</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 2007</subfield><subfield code="g">51</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)546503101</subfield><subfield code="w">(DE-600)2390720-4</subfield><subfield code="w">(DE-576)284748439</subfield><subfield code="x">1876-7745</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:51</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">51</subfield></datafield></record></collection>
author	Chattopadhyay, Arup Kumar
spellingShingle	Chattopadhyay, Arup Kumar ddc 004 misc Secret sharing misc Threshold secret sharing misc Multi-secret sharing misc Verifiable secret sharing Secret sharing: A comprehensive survey, taxonomy and applications
authorStr	Chattopadhyay, Arup Kumar
ppnlink_with_tag_str_mv	@@773@@(DE-627)546503101
format	electronic Article
dewey-ones	004 - Data processing & computer science
delete_txt_mv	keep
author_role	aut aut aut aut
collection	elsevier
remote_str	true
illustrated	Not Illustrated
issn	1876-7745
topic_title	004 VZ Secret sharing: A comprehensive survey, taxonomy and applications Secret sharing Threshold secret sharing Multi-secret sharing Verifiable secret sharing
topic	ddc 004 misc Secret sharing misc Threshold secret sharing misc Multi-secret sharing misc Verifiable secret sharing
topic_unstemmed	ddc 004 misc Secret sharing misc Threshold secret sharing misc Multi-secret sharing misc Verifiable secret sharing
topic_browse	ddc 004 misc Secret sharing misc Threshold secret sharing misc Multi-secret sharing misc Verifiable secret sharing
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Computer science review
hierarchy_parent_id	546503101
dewey-tens	000 - Computer science, knowledge & systems
hierarchy_top_title	Computer science review
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)546503101 (DE-600)2390720-4 (DE-576)284748439
title	Secret sharing: A comprehensive survey, taxonomy and applications
ctrlnum	(DE-627)ELV067216943 (ELSEVIER)S1574-0137(23)00075-8
title_full	Secret sharing: A comprehensive survey, taxonomy and applications
author_sort	Chattopadhyay, Arup Kumar
journal	Computer science review
journalStr	Computer science review
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works
recordtype	marc
publishDateSort	2023
contenttype_str_mv	zzz
author_browse	Chattopadhyay, Arup Kumar Saha, Sanchita Nag, Amitava Nandi, Sukumar
container_volume	51
class	004 VZ
format_se	Elektronische Aufsätze
author-letter	Chattopadhyay, Arup Kumar
doi_str_mv	10.1016/j.cosrev.2023.100608
normlink	(ORCID)0000-0001-9884-7565
normlink_prefix_str_mv	(orcid)0000-0001-9884-7565
dewey-full	004
author2-role	verfasserin
title_sort	secret sharing: a comprehensive survey, taxonomy and applications
title_auth	Secret sharing: A comprehensive survey, taxonomy and applications
abstract	The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed.
abstractGer	The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed.
abstract_unstemmed	The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed.
collection_details	GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700
title_short	Secret sharing: A comprehensive survey, taxonomy and applications
remote_bool	true
author2	Saha, Sanchita Nag, Amitava Nandi, Sukumar
author2Str	Saha, Sanchita Nag, Amitava Nandi, Sukumar
ppnlink	546503101
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1016/j.cosrev.2023.100608
up_date	2024-07-06T20:30:29.991Z
_version_	1803863017382739968
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV067216943</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240226093040.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240226s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.cosrev.2023.100608</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV067216943</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1574-0137(23)00075-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chattopadhyay, Arup Kumar</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-9884-7565</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Secret sharing: A comprehensive survey, taxonomy and applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The emergence of ubiquitous computing and different disruptive technologies caused magnificent development in information and communication technology. Likewise, cybercriminals are also carefully considering different newer ways of attacks. Protecting the confidentiality, integrity, and authentication of sensitive information is the day’s major challenge. Secret sharing is a method that allows a trusted authority (the dealer) to distribute a secret or a number of secrets among some target participants with the intention that certain predetermined groups of participants can collaborate to recover the secret or secrets. Any other group formed by the participants cannot do so. Threshold secret sharing (TSS) is a particular form of secret sharing. It permits any group consisting of at least a specific number (called the threshold) of participants to reconstruct the secret or secrets. However, any group with fewer than the specified number of participants is forbidden to do so. It provides tolerance against single point of failure (SPOF), which has attracted a large number of researchers to contribute in this field. It has the potential to be implemented in numerous practical and secure applications. In this paper, we present a comprehensive survey of a variety of existing threshold secret sharing schemes. We have identified various aspects of developing secure and efficient secret sharing schemes. We have also highlighted some of the applications based on secret sharing. Finally, the open challenges and future research directions in the field of secret sharing are identified and discussed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Secret sharing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Threshold secret sharing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-secret sharing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Verifiable secret sharing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Saha, Sanchita</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nag, Amitava</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nandi, Sukumar</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computer science review</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 2007</subfield><subfield code="g">51</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)546503101</subfield><subfield code="w">(DE-600)2390720-4</subfield><subfield code="w">(DE-576)284748439</subfield><subfield code="x">1876-7745</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:51</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">51</subfield></datafield></record></collection>
score	7.399805

Nicht das Richtige dabei?

Schreiben Sie uns!

Secret sharing: A comprehensive survey, taxonomy and applications

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?