Efficient Schemes for Securing Network Coding Against Wiretapping
Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security re...
Saved in:
Published in | Wuhan University journal of natural sciences Vol. 18; no. 4; pp. 355 - 362 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.08.2013
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications. |
---|---|
AbstractList | Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications. |
Author | LIU Guangjun ZHOU Hang |
AuthorAffiliation | State Key Laboratory of Integrated Service Networks, XidianUniversity, Xi'an 710071, Shaanxi, China College of Science, Engineering University of the ChinesePeople's Armed Police Force, Xi'an 710086, Shaanxi, China |
Author_xml | – sequence: 1 givenname: Guangjun surname: Liu fullname: Liu, Guangjun email: liuguangjuns@gmail.com organization: State Key Laboratory of Integrated Service Networks, Xidian University – sequence: 2 givenname: Hang surname: Zhou fullname: Zhou, Hang organization: State Key Laboratory of Integrated Service Networks, Xidian University, College of Science, Engineering University of the Chinese People’s Armed Police Force |
BookMark | eNqFkE1PAjEQhhuDiYD-AG_rzctqp93dtkdC8CMhekDjsSmlC0Vol3aJ8d_bDcSDBzx1OnmfmcwzQD3nnUHoGvAdYMzuIwAvRY6B5lgUJOdnqA9C0LwQgvdSnUI5EEwu0CDGNcZUlAz6aDSpa6utcW020yuzNTGrfchmRu-DdcvsxbRfPnxmY7_ovqOlsi622YcNplVNk3qX6LxWm2iuju8QvT9M3sZP-fT18Xk8muaaiJLnlBFBNTBWa6BEGbUoBSdVZbTSAqu5UiVhNRdKkVTydASbE8KMqucMGFR0iG4Pc5vgd3sTW7m1UZvNRjnj91ECqwgUGJfs_2hRcEaTHZ6i7BDVwccYTC21bVVrvWuDshsJWHbq5MGvTH5l51d2JPwhm2C3KnyfZMiBiU1n1wS59vvgkraT0M1x0cq75S5xv5sKBpQXZUV_AH96mQs |
CitedBy_id | crossref_primary_10_1007_s11859_014_0994_4 crossref_primary_10_1016_j_comnet_2018_03_013 |
Cites_doi | 10.1109/LCOMM.2009.12.091648 10.1109/INFCOM.2011.5934876 10.1155/2010/216524 10.4218/etrij.13.0212.0166 10.1109/TIT.2008.926449 10.1007/BFb0052348 10.1109/TIT.2006.881746 10.1109/ITWNIT.2009.5158587 10.1109/TIT.2008.928291 10.1109/18.850663 10.1109/TIT.2002.807285 10.1109/TIT.2010.2090212 10.1002/j.1538-7305.1984.tb00072.x 10.1109/MILCOM.2007.4454988 10.1201/9781420011241 10.1109/ICC.2008.336 10.1109/NETCOD.2010.5487671 10.1007/978-1-4419-5906-5 |
ContentType | Journal Article |
Copyright | Wuhan University and Springer-Verlag Berlin Heidelberg 2013 |
Copyright_xml | – notice: Wuhan University and Springer-Verlag Berlin Heidelberg 2013 |
DBID | 2RA 92L CQIGP ~WA AAYXX CITATION 7SC 7SP 7SR 7TB 7U5 8BQ 8FD FR3 JG9 JQ2 KR7 L7M L~C L~D |
DOI | 10.1007/s11859-013-0942-8 |
DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 中文科技期刊数据库-7.0平台 中文科技期刊数据库- 镜像站点 CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Mechanical & Transportation Engineering Abstracts Solid State and Superconductivity Abstracts METADEX Technology Research Database Engineering Research Database Materials Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Materials Research Database Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts METADEX Computer and Information Systems Abstracts Professional Engineered Materials Abstracts Solid State and Superconductivity Abstracts Engineering Research Database Advanced Technologies Database with Aerospace |
DatabaseTitleList | Materials Research Database Materials Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Biology Computer Science |
DocumentTitleAlternate | Efficient Schemes for Securing Network Coding Against Wiretapping |
EISSN | 1993-4998 |
EndPage | 362 |
ExternalDocumentID | 10_1007_s11859_013_0942_8 47138456 |
GroupedDBID | -4W -5D -5G -BR -EM -SA -S~ -Y2 -~C .86 .VR 06D 0R~ 0VY 123 188 1N0 2.D 29R 29~ 2B. 2C- 2J2 2JY 2KG 2KM 2LR 2RA 2VQ 2~H 30V 4.4 408 40D 40E 5VR 5VS 6NX 8RM 8TC 8UJ 92D 92I 92L 93E 93N 95- 95. 95~ 96X AAAVM AABHQ AAFWJ AAIAL AAJKR AANXM AARHV AARTL AATVU AAWCG AAYIU AAYQN AAYTO ABFTV ABJOX ABKCH ABMNI ABNWP ABQBU ABTEG ABTHY ABTMW ABXPI ACBXY ACGFS ACHXU ACKNC ACMLO ACOKC ACOMO ACPRK ACSNA ADHHG ADHIR ADINQ ADKPE ADRFC ADURQ ADYPR ADZKW AEBTG AEGAL AEGNC AEJHL AEJRE AEKMD AEOHA AEPYU AETLH AEXYK AFGCZ AFLOW AFNRJ AFRAH AFUIB AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIIXL AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMYQR ARMRJ ASPBG AVWKF AXYYD AZFZN B-. BA0 BAPOH BBWZM BDATZ BGNMA CAG CAJEA CAJUS CCEZO CCVFK CHBEP COF CQIGP CS3 CSCUP CW9 DU5 EBS EIOEI EJD ESBYG FA0 FEDTE FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GQ6 GQ7 HF~ HG6 HMJXF HRMNR HVGLF HZ~ IJ- IXD I~X I~Z J-C JBSCW KOV M4Y MA- N2Q NDZJH NF0 NQJWS NU0 O9- O93 O9G O9I O9J P19 P9R PF0 PT5 Q-- Q-0 QOK QOR QOS R89 R9I RHV RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SBY SCL SCLPG SDH SHX SISQX SMT SNE SNX SOJ SPISZ STPWE SZN T13 T16 TCJ TGH TSG TUC U1G U2A U5K U9L UG4 UGNYK UZ4 UZXMN VC2 VFIZW W48 WK8 YLTOR Z7R Z7X Z7Z Z83 Z88 Z8M Z8R Z8T Z8W Z92 ZOVNA ~A9 ~WA AAXDM AAYZH ABQSL AFBBN H13 ZMTXR AAYXX ABFSG ACSTC ADHKG AEZWR AFHIU AGQPQ AHWEU AIXLP CITATION 7SC 7SP 7SR 7TB 7U5 8BQ 8FD FR3 JG9 JQ2 KR7 L7M L~C L~D |
ID | FETCH-LOGICAL-c2958-37293c177fc132aead598266ecac90abaa527f89aa2aa580947b227eafb717163 |
IEDL.DBID | U2A |
ISSN | 1007-1202 |
IngestDate | Fri Jul 11 11:46:24 EDT 2025 Thu Jul 10 23:13:00 EDT 2025 Tue Jul 01 02:38:55 EDT 2025 Thu Apr 24 22:56:49 EDT 2025 Fri Feb 21 02:31:27 EST 2025 Wed Feb 14 10:40:47 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Keywords | network coding TP 305 security encryption pseudo-random function wiretapping |
Language | English |
License | http://www.springer.com/tdm |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c2958-37293c177fc132aead598266ecac90abaa527f89aa2aa580947b227eafb717163 |
Notes | Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications. 42-1405/N network coding; security; wiretapping; pseudorandom function; encryption ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
PQID | 1448739938 |
PQPubID | 23500 |
PageCount | 8 |
ParticipantIDs | proquest_miscellaneous_1762140057 proquest_miscellaneous_1448739938 crossref_citationtrail_10_1007_s11859_013_0942_8 crossref_primary_10_1007_s11859_013_0942_8 springer_journals_10_1007_s11859_013_0942_8 chongqing_primary_47138456 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 20130800 |
PublicationDateYYYYMMDD | 2013-08-01 |
PublicationDate_xml | – month: 8 year: 2013 text: 20130800 |
PublicationDecade | 2010 |
PublicationPlace | Berlin/Heidelberg |
PublicationPlace_xml | – name: Berlin/Heidelberg |
PublicationTitle | Wuhan University journal of natural sciences |
PublicationTitleAbbrev | Wuhan Univ. J. Nat. Sci |
PublicationTitleAlternate | Wuhan University Journal of Natural Sciences |
PublicationYear | 2013 |
Publisher | Springer Berlin Heidelberg |
Publisher_xml | – name: Springer Berlin Heidelberg |
References | van Tilborg, Jajodia (CR21) 2011 Cai, Yeung (CR6) 2002 Mollin (CR20) 2006 Guo, Luo, Li (CR17) 2010; 2010 Silva, Kschischang (CR10) 2011; 57 Silva, Kschischang (CR13) 2009 CR8 Fragouli, Katabi, Markopoulou (CR5) 2007 Lima, Barros, Medard (CR19) 2009 Ahlswede, Cai, Li (CR1) 2000; 46 Silva, Kschischang (CR11) 2008; 54 Bhattad, Narayanan (CR12) 2005 Li, Yeung, Cai (CR2) 2003; 49 Ozarow, Wyner (CR9) 1984; 63 Rivest (CR18) 1997 Vilela, Lima, Barros (CR16) 2008 Koetter, Kschischang (CR3) 2008; 54 Wei, Zhen, Guan (CR15) 2010 Adeli, Liu (CR14) 2009; 13 Feldman, Malkin, Servedio (CR7) 2004 Zhang, Jiang, Lin (CR23) 2011 Liu, Wang (CR22) 2013; 35 Ho, Medard, Koetter (CR4) 2006; 52 R Koetter (942_CR3) 2008; 54 T Ho (942_CR4) 2006; 52 J Feldman (942_CR7) 2004 P Zhang (942_CR23) 2011 D Silva (942_CR11) 2008; 54 L H Ozarow (942_CR9) 1984; 63 J P Vilela (942_CR16) 2008 Q Guo (942_CR17) 2010; 2010 M Adeli (942_CR14) 2009; 13 942_CR8 L Lima (942_CR19) 2009 G J Liu (942_CR22) 2013; 35 D Silva (942_CR10) 2011; 57 K Bhattad (942_CR12) 2005 H C A Tilborg van (942_CR21) 2011 C Fragouli (942_CR5) 2007 Y W Wei (942_CR15) 2010 R L Rivest (942_CR18) 1997 R A Mollin (942_CR20) 2006 R Ahlswede (942_CR1) 2000; 46 N Cai (942_CR6) 2002 D Silva (942_CR13) 2009 S-Y R Li (942_CR2) 2003; 49 |
References_xml | – volume: 13 start-page: 956 issue: 12 year: 2009 end-page: 958 ident: CR14 article-title: Secure network coding with minimum overhead based on Hash functions [J] publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2009.12.091648 – start-page: 1 year: 2010 end-page: 6 ident: CR15 article-title: Efficient weakly-secure network coding schemes against wiretapping attacks [C] publication-title: ( 2010) – start-page: 1026 year: 2011 end-page: 1034 ident: CR23 article-title: Padding for orthogonality: Efficient subspace authentication for network coding [C] publication-title: Proceedings of IEEE INFOCOM doi: 10.1109/INFCOM.2011.5934876 – year: 2006 ident: CR20 publication-title: [M] – start-page: 388 year: 2004 end-page: 401 ident: CR7 article-title: On the capacity of secure network coding [C] publication-title: 42 – start-page: 1 year: 2007 end-page: 8 ident: CR5 article-title: Wireless network coding: Opportunities & challenges [C] publication-title: , 2007 – volume: 2010 start-page: 1 year: 2010 end-page: 9 ident: CR17 article-title: Secure network coding against wiretapping and Byzantine attacks [J] publication-title: EURASIP Journal on Wireless Communications and Networking doi: 10.1155/2010/216524 – volume: 35 start-page: 173 issue: 1 year: 2013 end-page: 176 ident: CR22 article-title: Homomorphic subspace MAC scheme for secure network coding [J] publication-title: ETRI Journal doi: 10.4218/etrij.13.0212.0166 – start-page: 323 year: 2002 ident: CR6 article-title: Secure network coding [C] publication-title: Proceedings of International Symposium in Information Theory – volume: 54 start-page: 3579 issue: 8 year: 2008 end-page: 3591 ident: CR3 article-title: Coding for errors and erasures in random network coding [J] publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2008.926449 – start-page: 125 year: 2009 end-page: 129 ident: CR19 article-title: Towards secure multiresolution network coding [C] publication-title: ( – year: 2011 ident: CR21 publication-title: [M] – start-page: 210 year: 1997 end-page: 218 ident: CR18 article-title: All-or-nothing encryption and the package transform [C] publication-title: Proceedings of the Fast Software Encryption doi: 10.1007/BFb0052348 – start-page: 1750 year: 2008 end-page: 1754 ident: CR16 article-title: Lightweight security for network coding [C] publication-title: ( 2008) – ident: CR8 – volume: 52 start-page: 4413 issue: 10 year: 2006 end-page: 4430 ident: CR4 article-title: A random linear network coding approach to multicast [J] publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2006.881746 – volume: 63 start-page: 2135 year: 1984 end-page: 2157 ident: CR9 article-title: Wire-tap channel II [J] publication-title: AT & T Bell Labs Tech J – start-page: 281 year: 2009 end-page: 285 ident: CR13 article-title: Universal weakly secure network coding [C] publication-title: Proceedings of IEEE Information Theory Workshop on Networking and Information Theory doi: 10.1109/ITWNIT.2009.5158587 – volume: 54 start-page: 3951 year: 2008 end-page: 3967 ident: CR11 article-title: A rank-metric approach to error control in random network coding [J] publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2008.928291 – volume: 46 start-page: 1204 issue: 4 year: 2000 end-page: 1216 ident: CR1 article-title: Network information flow [J] publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.850663 – volume: 49 start-page: 371 issue: 2 year: 2003 end-page: 381 ident: CR2 article-title: Linear network coding [J] publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2002.807285 – volume: 57 start-page: 1124 year: 2011 end-page: 1135 ident: CR10 article-title: Universal secure network coding via rank-metric codes [J] publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2010.2090212 – year: 2005 ident: CR12 article-title: Weakly secure network coding [C] publication-title: ( 05) – volume: 63 start-page: 2135 year: 1984 ident: 942_CR9 publication-title: AT & T Bell Labs Tech J doi: 10.1002/j.1538-7305.1984.tb00072.x – start-page: 388 volume-title: Proceedings of 42nd Annual Allerton Conference on Communication, Control, and Computing year: 2004 ident: 942_CR7 – volume-title: Proceedings of first Workshop on Network Coding, Theory, and Applications (NetCod05) year: 2005 ident: 942_CR12 – start-page: 1 volume-title: IEEE Military Communications Conference, 2007 year: 2007 ident: 942_CR5 doi: 10.1109/MILCOM.2007.4454988 – volume-title: An Introduction to Cryptography [M] year: 2006 ident: 942_CR20 doi: 10.1201/9781420011241 – start-page: 1026 volume-title: Proceedings of IEEE INFOCOM year: 2011 ident: 942_CR23 doi: 10.1109/INFCOM.2011.5934876 – volume: 2010 start-page: 1 year: 2010 ident: 942_CR17 publication-title: EURASIP Journal on Wireless Communications and Networking – volume: 54 start-page: 3951 year: 2008 ident: 942_CR11 publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2008.928291 – volume: 13 start-page: 956 issue: 12 year: 2009 ident: 942_CR14 publication-title: IEEE Communications Letters doi: 10.1109/LCOMM.2009.12.091648 – start-page: 1750 volume-title: Proceedings of IEEE International Conference on Communications (ICC2008) year: 2008 ident: 942_CR16 doi: 10.1109/ICC.2008.336 – volume: 49 start-page: 371 issue: 2 year: 2003 ident: 942_CR2 publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2002.807285 – volume: 35 start-page: 173 issue: 1 year: 2013 ident: 942_CR22 publication-title: ETRI Journal doi: 10.4218/etrij.13.0212.0166 – volume: 52 start-page: 4413 issue: 10 year: 2006 ident: 942_CR4 publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2006.881746 – volume: 46 start-page: 1204 issue: 4 year: 2000 ident: 942_CR1 publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.850663 – start-page: 323 volume-title: Proceedings of International Symposium in Information Theory year: 2002 ident: 942_CR6 – volume: 57 start-page: 1124 year: 2011 ident: 942_CR10 publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2010.2090212 – start-page: 125 volume-title: Proceedings of ITW (Information Theory Wireness Network year: 2009 ident: 942_CR19 – ident: 942_CR8 – start-page: 1 volume-title: Proceedings of the IEEE International Symposium on Network Coding (NetCod 2010) year: 2010 ident: 942_CR15 doi: 10.1109/NETCOD.2010.5487671 – start-page: 210 volume-title: Proceedings of the Fast Software Encryption year: 1997 ident: 942_CR18 doi: 10.1007/BFb0052348 – volume: 54 start-page: 3579 issue: 8 year: 2008 ident: 942_CR3 publication-title: IEEE Transactions on Information Theory doi: 10.1109/TIT.2008.926449 – volume-title: Encyclopedia of Cryptography and Security [M] year: 2011 ident: 942_CR21 doi: 10.1007/978-1-4419-5906-5 – start-page: 281 volume-title: Proceedings of IEEE Information Theory Workshop on Networking and Information Theory year: 2009 ident: 942_CR13 doi: 10.1109/ITWNIT.2009.5158587 |
SSID | ssj0039571 |
Score | 1.8972104 |
Snippet | Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead... |
SourceID | proquest crossref springer chongqing |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 355 |
SubjectTerms | Biomedical and Life Sciences Coding Computer Science Life Sciences Materials Science Mathematical analysis Mathematical models Networks Proposals Security Vectors (mathematics) Wiretapping |
Title | Efficient Schemes for Securing Network Coding Against Wiretapping |
URI | http://lib.cqvip.com/qk/85480X/201304/47138456.html https://link.springer.com/article/10.1007/s11859-013-0942-8 https://www.proquest.com/docview/1448739938 https://www.proquest.com/docview/1762140057 |
Volume | 18 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7ohuDFH1NxU0cET0qhS9ulPQ7ZHIqeHMxTSLJ0Ctqp3Q7-977XNhuKCt56SBPal5f3fXkvXwDOYhupSBjjRcnEemFnIrzEt6GnRZwKi_FXhXRQ-PauOxyF1-NoXJ3jzl21u0tJFiv16rAbhhaq7Qk8pCToxutQj5C6Ux3XiPfc8kt5p4Jl0R5ch_vcpTJ_6oIEFR5n2fQNh_samFZo81uCtIg7gx3YqgAj65UW3oU1mzVgo7xC8qMB2-5aBlZ56R70-oUsBEYThtTVvticITJlebmzPmVZWfnNzIziFlNT9YQYkZFo8VyRXMN0H0aD_v3l0KtuSvAMT6LYo9xbYDpCpAbZpcLZQbp83a41yiS-0kpFXKRxohTHxxg_XmjOhVWpFqSXExxALZtl9hAY-mPKtdCmy02IvShfh4mxgdY8mSC6aEJr-cvka6mIITHCBTFCsSb47h9KU2mM01UXz3KljkwmkGgCSSaQcRPOl6-47v5ofOoMI9ENKLehMjtb5MhgkHkR2PqrDS78yCcRoTbhwllVVj6b_z5q61-tj2CTFzOMigSPoTZ_X9gTBC5z3YZ67-rhpt8uJuwnrFTkzw |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZ4CMGFN6LjFSROoEpd2i7tcUJD43liErcoydKBBC3Q7cC_x24bJhBM4tZDmqi1HX-Onc8AJ4mNVSyM8eN0aP2oPRR-GtjI1yLJhEX_qyK6KHx71-kPoquH-KG5x126aneXkqx26ullN3QtVNsT-hiSoBnPwyJigYRUecC7bvulvFMVZdEZXJsH3KUyf5uCCBUei3z0hst9d0xTtPkjQVr5nYt1WG0AI-vWEt6AOZtvwlLdQvJjE9ZcWwbWWOkWdHsVLQR6E4ahq32xJUNkysr6ZH3E8rrym5mC_BZTI_WEGJERafFYEV3DaBsGF737877fdErwDU_jxKfcW2jaQmQGo0uF2kG8fJ2ONcqkgdJKxVxkSaoUx8cEP15ozoVVmRbElxPuwEJe5HYXGNpjxrXQpsNNhLOoQEepsaHWPB0iuvCg9fXL5GvNiCHRw4UJQjEPAvcPpWk4xqnVxbOcsiOTCCSKQJIIZOLB6dcrbroZg4-dYCSaAeU2VG6LSYkRDEZeBLZmjcGNH-NJRKgenDmpysZmy79Xbf1r9BEs9-9vb-TN5d31HqzwStuoYHAfFsbvE3uAIGasDyul_QRsaeYu |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZgCMSFN2I8g8QJVNGl7dIeJ2DiLQ5M2i1KsnQgQTfoduDfY7cNEwgmceshTZTYrj_XzmeAo9hGKhLGeFHSs17Y6Akv8W3oaRGnwqL_VSFdFL67b152wutu1K36nOau2t2lJMs7DcTSlI1Oh730dHLxDd0M1fkEHoYnaNKzMBfSZWBU6A5vuU8x5aCKiIv-xzW4z11a87cpiFzhaZD133Dp705qgjx_JEsLH9RegaUKPLJWKe1VmLHZGsyX7SQ_1mDZtWhglcWuQ-uioIjAnTEMY-2rzRmiVJaXf9n7LCurwJkZkA9jqq-eES8yIjAeKaJu6G9Ap33xeHbpVV0TPMOTKPYoDxeYhhCpwRNRqCnE0ddsWqNM4iutVMRFGidKcXyMcfNCcy6sSrUg7pxgE2rZILNbwNA2U66FNk1uQpxF-TpMjA205kkPkUYdtr-OTA5LdgyJ3i6IEZbVwXdnKE3FN05tL17khCmZRCBRBJJEIOM6HH-94qabMvjQCUaiSVCeQ2V2MM4xmsEojIDXtDHoBDC2RLRahxMnVVnZb_73qtv_Gn0ACw_nbXl7dX-zA4u8UDaqHdyF2uh9bPcQz4z0fqGzn7hP6mE |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Schemes+for+Securing+Network+Coding+Against+Wiretapping&rft.jtitle=Wuhan+University+journal+of+natural+sciences&rft.au=Liu%2C+Guangjun&rft.au=Zhou%2C+Hang&rft.date=2013-08-01&rft.issn=1007-1202&rft.volume=18&rft.issue=4&rft.spage=355&rft.epage=362&rft_id=info:doi/10.1007%2Fs11859-013-0942-8&rft.externalDBID=NO_FULL_TEXT |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F85480X%2F85480X.jpg |