On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme

<p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as th...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Wang Daoshun [verfasserIn] Yi Feng [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2010

Übergeordnetes Werk:	In: EURASIP Journal on Advances in Signal Processing - SpringerOpen, 2008, (2010), 1, p 782438
Übergeordnetes Werk:	year:2010 ; number:1, p 782438

Links:	Link aufrufen Link aufrufen Journal toc Journal toc

Katalog-ID:	DOAJ017044421

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ017044421
003	DE-627
005	20230310085210.0
007	cr uuu---uuuuu
008	230226s2010 xx \|\|\|\|\|o 00\| \|\|eng c
035			\|a (DE-627)DOAJ017044421
035			\|a (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK5101-6720
050		0	\|a TK7800-8360
100	0		\|a Wang Daoshun \|e verfasserin \|4 aut
245	1	0	\|a On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
264		1	\|c 2010
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a <p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p<
653		0	\|a Telecommunication
653		0	\|a Electronics
700	0		\|a Yi Feng \|e verfasserin \|4 aut
773	0	8	\|i In \|t EURASIP Journal on Advances in Signal Processing \|d SpringerOpen, 2008 \|g (2010), 1, p 782438 \|w (DE-627)534054277 \|w (DE-600)2364203-8 \|x 16876180 \|7 nnns
773	1	8	\|g year:2010 \|g number:1, p 782438
856	4	0	\|u https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 \|z kostenfrei
856	4	0	\|u http://asp.eurasipjournals.com/content/2010/782438 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1687-6172 \|y Journal toc \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1687-6180 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
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_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
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_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|j 2010 \|e 1, p 782438

Indexfelder

author_variant	w d wd y f yf
matchkey_str	article:16876180:2010----::novrigerthrnshmtvsasc
hierarchy_sort_str	2010
callnumber-subject-code	TK
publishDate	2010
allfields	(DE-627)DOAJ017044421 (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Wang Daoshun verfasserin aut On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p< Telecommunication Electronics Yi Feng verfasserin aut In EURASIP Journal on Advances in Signal Processing SpringerOpen, 2008 (2010), 1, p 782438 (DE-627)534054277 (DE-600)2364203-8 16876180 nnns year:2010 number:1, p 782438 https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 kostenfrei http://asp.eurasipjournals.com/content/2010/782438 kostenfrei https://doaj.org/toc/1687-6172 Journal toc kostenfrei https://doaj.org/toc/1687-6180 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2010 1, p 782438
spelling	(DE-627)DOAJ017044421 (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Wang Daoshun verfasserin aut On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p< Telecommunication Electronics Yi Feng verfasserin aut In EURASIP Journal on Advances in Signal Processing SpringerOpen, 2008 (2010), 1, p 782438 (DE-627)534054277 (DE-600)2364203-8 16876180 nnns year:2010 number:1, p 782438 https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 kostenfrei http://asp.eurasipjournals.com/content/2010/782438 kostenfrei https://doaj.org/toc/1687-6172 Journal toc kostenfrei https://doaj.org/toc/1687-6180 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2010 1, p 782438
allfields_unstemmed	(DE-627)DOAJ017044421 (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Wang Daoshun verfasserin aut On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p< Telecommunication Electronics Yi Feng verfasserin aut In EURASIP Journal on Advances in Signal Processing SpringerOpen, 2008 (2010), 1, p 782438 (DE-627)534054277 (DE-600)2364203-8 16876180 nnns year:2010 number:1, p 782438 https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 kostenfrei http://asp.eurasipjournals.com/content/2010/782438 kostenfrei https://doaj.org/toc/1687-6172 Journal toc kostenfrei https://doaj.org/toc/1687-6180 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2010 1, p 782438
allfieldsGer	(DE-627)DOAJ017044421 (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Wang Daoshun verfasserin aut On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p< Telecommunication Electronics Yi Feng verfasserin aut In EURASIP Journal on Advances in Signal Processing SpringerOpen, 2008 (2010), 1, p 782438 (DE-627)534054277 (DE-600)2364203-8 16876180 nnns year:2010 number:1, p 782438 https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 kostenfrei http://asp.eurasipjournals.com/content/2010/782438 kostenfrei https://doaj.org/toc/1687-6172 Journal toc kostenfrei https://doaj.org/toc/1687-6180 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2010 1, p 782438
allfieldsSound	(DE-627)DOAJ017044421 (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310 DE-627 ger DE-627 rakwb eng TK5101-6720 TK7800-8360 Wang Daoshun verfasserin aut On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier <p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p< Telecommunication Electronics Yi Feng verfasserin aut In EURASIP Journal on Advances in Signal Processing SpringerOpen, 2008 (2010), 1, p 782438 (DE-627)534054277 (DE-600)2364203-8 16876180 nnns year:2010 number:1, p 782438 https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 kostenfrei http://asp.eurasipjournals.com/content/2010/782438 kostenfrei https://doaj.org/toc/1687-6172 Journal toc kostenfrei https://doaj.org/toc/1687-6180 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2010 1, p 782438
language	English
source	In EURASIP Journal on Advances in Signal Processing (2010), 1, p 782438 year:2010 number:1, p 782438
sourceStr	In EURASIP Journal on Advances in Signal Processing (2010), 1, p 782438 year:2010 number:1, p 782438
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Telecommunication Electronics
isfreeaccess_bool	true
container_title	EURASIP Journal on Advances in Signal Processing
authorswithroles_txt_mv	Wang Daoshun @@aut@@ Yi Feng @@aut@@
publishDateDaySort_date	2010-01-01T00:00:00Z
hierarchy_top_id	534054277
id	DOAJ017044421
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ017044421</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310085210.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2010 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ017044421</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310</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">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5101-6720</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Wang Daoshun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</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"><p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p<</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yi Feng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">EURASIP Journal on Advances in Signal Processing</subfield><subfield code="d">SpringerOpen, 2008</subfield><subfield code="g">(2010), 1, p 782438</subfield><subfield code="w">(DE-627)534054277</subfield><subfield code="w">(DE-600)2364203-8</subfield><subfield code="x">16876180</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2010</subfield><subfield code="g">number:1, p 782438</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://asp.eurasipjournals.com/content/2010/782438</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-6172</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-6180</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</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_39</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_63</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_95</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_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</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_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</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_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</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_4126</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_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_4335</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_4367</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="j">2010</subfield><subfield code="e">1, p 782438</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Wang Daoshun
spellingShingle	Wang Daoshun misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
authorStr	Wang Daoshun
ppnlink_with_tag_str_mv	@@773@@(DE-627)534054277
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK5101-6720
illustrated	Not Illustrated
issn	16876180
topic_title	TK5101-6720 TK7800-8360 On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
topic	misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics
topic_unstemmed	misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics
topic_browse	misc TK5101-6720 misc TK7800-8360 misc Telecommunication misc Electronics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	EURASIP Journal on Advances in Signal Processing
hierarchy_parent_id	534054277
hierarchy_top_title	EURASIP Journal on Advances in Signal Processing
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)534054277 (DE-600)2364203-8
title	On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
ctrlnum	(DE-627)DOAJ017044421 (DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310
title_full	On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
author_sort	Wang Daoshun
journal	EURASIP Journal on Advances in Signal Processing
journalStr	EURASIP Journal on Advances in Signal Processing
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2010
contenttype_str_mv	txt
author_browse	Wang Daoshun Yi Feng
class	TK5101-6720 TK7800-8360
format_se	Elektronische Aufsätze
author-letter	Wang Daoshun
author2-role	verfasserin
title_sort	on converting secret sharing scheme to visual secret sharing scheme
callnumber	TK5101-6720
title_auth	On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
abstract	<p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p<
abstractGer	<p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p<
abstract_unstemmed	<p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p<
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	1, p 782438
title_short	On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme
url	https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310 http://asp.eurasipjournals.com/content/2010/782438 https://doaj.org/toc/1687-6172 https://doaj.org/toc/1687-6180
remote_bool	true
author2	Yi Feng
author2Str	Yi Feng
ppnlink	534054277
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
callnumber-a	TK5101-6720
up_date	2024-07-04T00:05:54.520Z
_version_	1803604778834460672
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ017044421</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310085210.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2010 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ017044421</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ096ed556aeb9470c9d3b286cb69af310</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">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5101-6720</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Wang Daoshun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</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"><p<Abstract</p< <p<Traditional Secret Sharing (SS) schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS) schemes decode the secret without computation, but each share is <it<m</it< times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS) schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform) a <inline-formula< <graphic file="1687-6180-2010-782438-i1.gif"/<</inline-formula<-SS scheme to a <inline-formula< <graphic file="1687-6180-2010-782438-i2.gif"/<</inline-formula<-VSS scheme for greyscale images. The generation of the shadow images (shares) is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i3.gif"/<</inline-formula<-SS scheme to a more general case of greyscale <inline-formula< <graphic file="1687-6180-2010-782438-i4.gif"/<</inline-formula<-VSS scheme.</p<</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yi Feng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">EURASIP Journal on Advances in Signal Processing</subfield><subfield code="d">SpringerOpen, 2008</subfield><subfield code="g">(2010), 1, p 782438</subfield><subfield code="w">(DE-627)534054277</subfield><subfield code="w">(DE-600)2364203-8</subfield><subfield code="x">16876180</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2010</subfield><subfield code="g">number:1, p 782438</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/096ed556aeb9470c9d3b286cb69af310</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://asp.eurasipjournals.com/content/2010/782438</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-6172</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-6180</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</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_39</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_63</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_95</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_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</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_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</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_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</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_4126</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_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_4335</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_4367</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="j">2010</subfield><subfield code="e">1, p 782438</subfield></datafield></record></collection>
score	7.3985376

Nicht das Richtige dabei?

Schreiben Sie uns!

On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?