CN108494774A - A kind of anti-link control attack method for reinforcing anonymous communication system safety - Google Patents
A kind of anti-link control attack method for reinforcing anonymous communication system safety Download PDFInfo
- Publication number
- CN108494774A CN108494774A CN201810253911.3A CN201810253911A CN108494774A CN 108494774 A CN108494774 A CN 108494774A CN 201810253911 A CN201810253911 A CN 201810253911A CN 108494774 A CN108494774 A CN 108494774A
- Authority
- CN
- China
- Prior art keywords
- data
- fragment
- information
- link
- fragmentation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
- H04L63/0421—Anonymous communication, i.e. the party's identifiers are hidden from the other party or parties, e.g. using an anonymizer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9057—Arrangements for supporting packet reassembly or resequencing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The anti-link that the invention discloses a kind of for reinforcing anonymous communication system safety controls attack method, includes the following steps, former data information is subdivided into m parts of refining data fragments, each part of data fragmentation is denoted as ai, select two panels data fragmentation a from m parts of refining data fragments at random every timekAnd ajNew fragment is formed, m/2 parts of new fragments, the data fragmentation a selected every time are sharedkAnd ajAlternate position spike in former data information is at least L, and L meets conditional：1<L≤m/2；Sending direction LIST SERVER request link nodal information, the link nodes information that sender returns according to LIST SERVER send all new fragment B to recipientn, recipient receives new fragment BnAfterwards, according to new fragment BnInformation be reduced into former data information, former data information is sent using fragmentation and reassembly method, reduces link request number, resource consumption can be reduced, the link control attack based on node failure can be resisted, man-in-the-middle attack can be resisted and eavesdropping is attacked.
Description
Technical field
The present invention relates to anonymous communication system security technique fields, more particularly to one kind is for reinforcing anonymous communication system
The anti-link of safety controls attack method.
Background technology
Anonymous communication system is to ensure the communication system of increasing income of communication user safety and release.The was released from 2004
One anonymous communication system so far, has multiple common anonymous communication systems, as Mix anonymous communications network, Crowds are anonymous
Communication network, Tor anonymous communication networks etc..Despite the presence of a plurality of types of anonymous communication systems based on different technologies, still
Its core component is typically all by sender, recipient, LIST SERVER and to redirect node and form.It redirects node according to communication
The difference of position is divided into as Ingress node, intermediate node, Egress node three types.Communication chain between sender and recipient
Road redirects node by multiple.The core of anonymous communication system security protection is to ensure the safety of node and link.
Anonymous communication system has largely ensured the communication security between user, but also constantly suffers from simultaneously each
The network attack of kind various kinds.Malicious attacker destroys communication security between user using the technologies such as monitoring, obscuring, and reduces communication
Data safety, or even the anonymous link of control, cause user's signal intelligence to be fully exposed under malicious attack.Therefore it studies anonymous
The anti-link attack technology of communication system becomes a current research hotspot.
The method of the anti-link control safe practice of current anonymous communication system mainly has the following two kinds：
It was published one is 2017《Information engineering college journal》Page 333 to page 337 of the phase of volume 18 the 3rd in it is public
" a kind of anonymous communication technology of anti-link congestion attack " opened, author proposes delay variation caused by attacking link congestion
Blurring can destroy anonymous communication link delay and attack the relevance of data transmission modes, to reach protection communication link peace
Full purpose.Realize that the technology needs the operation state to-fill procedure on sender's host, it is also necessary to which a filling service is set
Device receives filling data.
Another kind is to publish for 2016《Computer science》Page 154 to page 159 of the phase of volume 43 the 10th in disclose
" design based on rerouting anonymous communication system ", author propose use fragment redundancy approach, message is divided into k pieces,
The k pieces message is subjected to coding and forms n piece redundancy messages (n>K), n pieces message is then forwarded to reception by mulitpath
Person, recipient are receiving arbitrary k ' pieces (k '>=k) under message scenario so that when certain path failures in link, recipient is still
So original information can be reconstructed by decoding according to the fragmental messages received.It is superfluous that data packet is divided into multi-disc by this method
Remaining, link request number is more than fragment number under normal conditions, and fragment data encrypting and decrypting can consume a large amount of Internet resources, and should
Method is that single link control of the resistance based on node failure is attacked, and effect is resisted not to man-in-the-middle attack and eavesdropping attack
Obviously.
Invention content
The anti-link that the purpose of the present invention is to provide a kind of for reinforcing anonymous communication system safety controls attacker
Method, when anonymous communication system is controlled by link attacks, contributes to the number for ensureing user's communication to solve the above technical problem
It is unaffected according to safety.
For this purpose, the present invention uses following technical scheme：
A kind of anti-link control attack method for reinforcing anonymous communication system safety includes the following steps：
S1：Former data information is subdivided into m parts of refining data fragments, each part of data fragmentation is denoted as ai, m is even number, 1≤
I≤m, i are data fragmentation aiStation location marker in former data information；
S2：Take a random number L, 1<L≤m/2；
S3：A piece of a is selected from m parts of refining data fragments at randomk；
S4：Another fragment a is chosen from remaining refining data fragmentj, by data fragmentation akAnd ajIt is combined into new fragment
Bn, wherein L≤| k-j |<m；1≤n≤m/2；
S5：Step S3, S4 is repeated until having selected all refining data fragment ai；
S6：Sending direction LIST SERVER request link nodal information, the link that sender returns according to LIST SERVER
Nodal information sends all new fragment B to recipientn；
S7：Recipient receives new fragment BnAfterwards, according to new fragment BnInformation be reduced into former data information；
S8：Check in the data information after reduction whether there is data fragmentation aiMissing, if it is not, thening follow the steps S9；
S9：Terminate data information and sends or carry out next group of data information transmission.
Optionally, in the step S8：If there is data fragmentation aiMissing, then go to step S6.
Optionally, the step S3 further includes the refining data fragment a that will be selectedkLabeled as having selected, the step S4
Further include the refining data fragment a that will be selectedjLabeled as having selected.
Optionally, the new fragment BnInformation include data fragmentation akAnd ajAnd its station location marker (k, j).
Optionally, in the step S4, first new fragment of generation is denoted as B1, B1It is sent as sender in step S6
First new fragment.
Optionally, the step S6 is specifically, the available link nodes letter of sending direction LIST SERVER requesting query
Breath, LIST SERVER receive and return to available link nodes information to sender after the inquiry request of sender, send root
According to the link nodes information of return, new fragment B is sent to recipient by different available link nodesn。
Optionally, the step S7 is specifically, when recipient receives new fragment BnAfterwards, it is split and is reduced to two parts carefully
Change data fragmentation akAnd aj, and according to station location marker (k, j) by two parts of refining data fragment akAnd ajIt is ranked up.
Compared with prior art, the embodiment of the present invention has the advantages that：
In the embodiment of the present invention, former data information is sent using fragmentation and reassembly method, improves existing fragment redundancy side
Method reduces link request number, can reduce resource consumption；And can binding site mark check whether data fragmentation lacks, can be with
Resist the link control attack based on node failure；It also can ensure that data fragmentation is discontinuous, improve existing data fragmentation and compile
The method of code, can resist man-in-the-middle attack and eavesdropping is attacked.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention without having to pay creative labor, may be used also for those of ordinary skill in the art
To obtain other attached drawings according to these attached drawings.
Fig. 1 is a kind of anti-link control attack for reinforcing anonymous communication system safety provided in an embodiment of the present invention
The flow chart of method.
Fig. 2 is a kind of anti-link control attack for reinforcing anonymous communication system safety provided in an embodiment of the present invention
The fragment stage schematic diagram of method.
Fig. 3 is a kind of anti-link control attack for reinforcing anonymous communication system safety provided in an embodiment of the present invention
The recombination stage schematic diagram of method.
Specific implementation mode
In order to make the invention's purpose, features and advantages of the invention more obvious and easy to understand, below in conjunction with the present invention
Attached drawing in embodiment, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that disclosed below
Embodiment be only a part of the embodiment of the present invention, and not all embodiment.Based on the embodiments of the present invention, this field
All other embodiment that those of ordinary skill is obtained without making creative work, belongs to protection of the present invention
Range.
Technical solution to further illustrate the present invention below with reference to the accompanying drawings and specific embodiments.
Refering to Figure 1, present embodiments providing a kind of anti-link control for reinforcing anonymous communication system safety
Attack method processed, includes the following steps：
Step S1：Former data information is subdivided into m parts of refining data fragments, each part of data fragmentation is denoted as ai.Wherein, m
For even number, 1≤i≤m, i are data fragmentation aiStation location marker in former data information.
Step S2：Take a random number L, 1<L≤m/2.
Step S3：A piece of a is selected from m parts of refining data fragments at randomk。
Step S4：Another fragment a is chosen from remaining refining data fragmentj, by data fragmentation akAnd ajIt is combined into new point
Piece Bn。
Wherein, L is data fragmentation akAnd ajBetween position difference minimum value, and L≤| k-j |<m；1≤n≤m/2.Cause
It is 1<L≤m/2 and L≤| k-j |<M, so m >=4.
Step S5：Step S3, S4 is repeated until having selected all refining data fragment ai。
Step S6：Sending direction LIST SERVER request link nodal information, sender return according to LIST SERVER
Link nodes information sends all new fragment B to recipientn。
Therefore, in conjunction with above step, a new fragment B is sent every timenWhen, including data fragmentation akAnd ajDo not connect
Method that is continuous, improving existing data fragmentation coding, can resist man-in-the-middle attack and eavesdropping is attacked.
Further, this fragmentation and reassembly method sends former data information, improves existing fragment redundancy approach, reduces
Link request number, can reduce resource consumption.
Step S7：Recipient receives new fragment BnAfterwards, according to new fragment BnInformation be reduced into former data information.
Step S8：Check in the data information after reduction whether there is data fragmentation aiMissing, if it is not, thening follow the steps S9.
Specifically, its inspection method principle is, when there is data fragmentation aiIt, must in the data information after reduction when missing
With the presence of discontinuous data fragmentation, judge whether data fragmentation lacks accordingly.
Step S9：Terminate data information and sends or carry out next group of data information transmission.
Specifically, in step S8, if there is data fragmentation aiMissing, then go to step S6, until after checking reduction
Not missing data fragment a in data informationi, then terminate data information and send or carry out next group of data information transmission.
Wherein, step S3 further includes the refining data fragment a that will be selectedkLabeled as having selected, step S4 further includes by quilt
The refining data fragment a chosenjLabeled as having selected.
Further, new fragment BnInformation in include at least data fragmentation ak, data fragmentation ajAnd its station location marker (k,
J) three parts.
In step s 4, first of generation new fragment BnIt is denoted as B1, B1First sent as sender in step S6
New fragment.
Step S6 is specifically, the available link nodes information of sending direction LIST SERVER requesting query, directory service
Device receives and returns to available link nodes information to sender after the inquiry request of sender, and sender is according to the link of return
Nodal information sends new fragment B by different available link nodes to recipientn。
Step S7 is specifically, when recipient receives new fragment BnAfterwards, it is split and is reduced to two parts of refining data fragment ak
And aj, and according to station location marker (k, j) by two parts of refining data fragment akAnd ajIt is ranked up.
Referring to Fig. 2, Fig. 2 is the fragment stage schematic diagram that the anti-link controls attack method.
Former data information data is first divided into m parts of refining data fragments.Step S2, S3 and S4 are executed successively, and it is new to form one
Fragment Bn.The new fragment includes data fragmentation ak, data fragmentation ajWith station location marker (k, j).This method energy binding site identifies
(k, j) checks data fragmentation aiWhether lack, the link control attack based on node failure can be resisted.
Step S3, S4 is repeated, until having selected all refining data fragment ai, and composition has m/2 parts of new fragments, by generation
First part of new fragment is denoted as B1, wherein 1≤n≤m/2.
Referring to Fig. 3, Fig. 3 is the recombination stage schematic diagram that the anti-link controls attack method.All new fragment BnAccording to
Data fragmentation ak, data fragmentation ajIt is reduced into former data information data with station location marker (k, j).
Therefore, anti-link control attack method provided in this embodiment includes following three phases：
(1) the fragment stage
First, former data information data is carried out fragment by sender, is divided into m parts of refining data fragments, and a is denoted as per a piece ofi。
Each data fragmentation aiThere is its station location marker i.Station location marker i represents data fragmentation aiIn former data information data
Location information.
Secondly, sender randomly selects an integer value L, and meet condition 1 by after former data information data refinement slices
<L≤m/2。
Then, sender is at random from m parts of data fragmentation aiOne fragment a of middle selectionk, selected label is choosing.
Finally, data fragmentation a is selectedkAfterwards, from remaining not selected data fragmentation aiIn randomly select another fragment
aj, and meet condition L≤| i-j |<M, both data fragmentation akWith ajPosition difference in former data information is at least L.By data
Fragment akAnd ajAnd its station location marker (k, j) is combined into new fragment Bn。B1For first group of data combination in the fragment stage, that is to say
First needs the new fragment sent.
(2) transmission phase
First, all data fragmentation a are waited foriBy shifting combination at new fragment BnAfterwards, sending direction LIST SERVER requesting query
Available link nodes information inquires available pitch chain circuit node information.
Wherein, 1≤n≤m/2.
Secondly, LIST SERVER returns to available link nodes information after receiving the inquiry request of sender.
Finally, the information that sender returns according to LIST SERVER, by different available link nodes to reception
Side sends new fragment Bn。
(3) stage is recombinated
First, recipient receives new fragment BnAfterwards, two parts of refining data fragment a are split intokAnd aj。
Secondly, according to BnIncluding station location marker (i, j), recipient will decomposite come data fragmentation akAnd ajAccording to it
Station location marker sequence restoring data information data.
Finally, if recipient receives total data fragment a at the appointed timei, then terminate data information and send or carry out
Next group of data information is sent.If not receiving total data fragment a at the appointed timei, then the part of missing is checked, and notify
Sender sends the data fragmentation a of the missingi, until recipient receives total data fragment ai, restore former data information
data。
Therefore, in the embodiment of the present invention, compared with prior art, former data information is sent using fragmentation and reassembly method
Data improves existing fragment redundancy approach, reduces link request number, can reduce resource consumption；And it can binding site mark
Know and checks data fragmentation aiWhether lack, the link control attack based on node failure can be resisted；When transmission data information, also
Ensure data fragmentation akAnd ajDiscontinuously, the method for improving existing data fragmentation coding, can resist man-in-the-middle attack and steal
Listen attack.
The above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to before
Stating embodiment, invention is explained in detail, it will be understood by those of ordinary skill in the art that：It still can be to preceding
The technical solution recorded in each embodiment is stated to modify or equivalent replacement of some of the technical features；And these
Modification or replacement, the spirit and scope for various embodiments of the present invention technical solution that it does not separate the essence of the corresponding technical solution.
Claims (7)
1. a kind of anti-link control attack method for reinforcing anonymous communication system safety, which is characterized in that including following
Step：
S1：Former data information is subdivided into m parts of refining data fragments, each part of data fragmentation is denoted as ai, m is even number, 1≤i≤m,
I is data fragmentation aiStation location marker in former data information；
S2：Take a random number L, 1<L≤m/2；
S3：A piece of a is selected from m parts of refining data fragments at randomk；
S4：Another fragment a is chosen from remaining refining data fragmentj, by data fragmentation ak、ajIt is combined into new fragment Bn, wherein
L≤|k-j|<m；1≤n≤m/2；
S5：Step S3, S4 is repeated until having selected all refining data fragment ai；
S6：Sending direction LIST SERVER request link nodal information, the link nodes that sender returns according to LIST SERVER
Information sends all new fragment B to recipientn；
S7：Recipient receives new fragment BnAfterwards, according to new fragment BnInformation be reduced into former data information；
S8：Check in the data information after reduction whether there is data fragmentation aiMissing, if it is not, thening follow the steps S9；
S9：Terminate data information and sends or carry out next group of data information transmission.
2. anti-link according to claim 1 controls attack method, which is characterized in that in the step S8：If there is data
Fragment aiMissing, then go to step S6.
3. anti-link according to claim 1 controls attack method, which is characterized in that the step S3 further includes that will be chosen
In refining data fragment akLabeled as having selected, the step S4 further includes the refining data fragment a that will be selectedjLabeled as
Choosing.
4. anti-link according to claim 1 controls attack method, which is characterized in that the new fragment BnInformation include
Data fragmentation akAnd ajAnd its station location marker (k, j).
5. anti-link according to claim 1 controls attack method, which is characterized in that in the step S4, the of generation
One new fragment is denoted as B1, B1The first new fragment sent as sender in step S6.
6. anti-link according to claim 1 controls attack method, which is characterized in that the step S6 is specifically, send
The available link nodes information of direction LIST SERVER requesting query, the inquiry request that LIST SERVER receives sender are backward
Sender returns to available link nodes information, and sender is according to the link nodes information of return, by different available
Link nodes send new fragment B to recipientn。
7. anti-link according to claim 4 controls attack method, which is characterized in that the step S7 is specifically, when connecing
Debit receives new fragment BnAfterwards, it is split and is reduced to two parts of refining data fragment akAnd aj, and according to station location marker (k, j)
By two parts of refining data fragment akAnd ajIt is ranked up.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810253911.3A CN108494774A (en) | 2018-03-26 | 2018-03-26 | A kind of anti-link control attack method for reinforcing anonymous communication system safety |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810253911.3A CN108494774A (en) | 2018-03-26 | 2018-03-26 | A kind of anti-link control attack method for reinforcing anonymous communication system safety |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108494774A true CN108494774A (en) | 2018-09-04 |
Family
ID=63337790
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810253911.3A Pending CN108494774A (en) | 2018-03-26 | 2018-03-26 | A kind of anti-link control attack method for reinforcing anonymous communication system safety |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108494774A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115277054A (en) * | 2022-06-08 | 2022-11-01 | 北京邮电大学 | Directory service method and system in anonymous network |
| CN115314491A (en) * | 2022-06-14 | 2022-11-08 | 北京邮电大学 | Directory service method and system of directory server cluster based on distributed structure |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2469771A1 (en) * | 2010-12-22 | 2012-06-27 | Thales | Method and device for transmitting data between two secured Ethernet networks via a routed network |
| CN102882900A (en) * | 2011-07-11 | 2013-01-16 | 阿里巴巴集团控股有限公司 | Application and deployment method for large-scale server cluster and large-scale server cluster |
| CN103475649A (en) * | 2013-08-30 | 2013-12-25 | 中国科学院信息工程研究所 | Concealed anonymous communication method based on peer-to-peer network |
| CN105682089A (en) * | 2015-12-29 | 2016-06-15 | 北京交通大学 | Data protection method and device based on fragments |
| CN106059774A (en) * | 2016-05-31 | 2016-10-26 | 东南大学 | Data slice mixture privacy protection method based on cluster |
| CN106850351A (en) * | 2017-02-10 | 2017-06-13 | 北京浩瀚深度信息技术股份有限公司 | The approximate delay statistics method and device of http business under a kind of asymmetric link environment |
-
2018
- 2018-03-26 CN CN201810253911.3A patent/CN108494774A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2469771A1 (en) * | 2010-12-22 | 2012-06-27 | Thales | Method and device for transmitting data between two secured Ethernet networks via a routed network |
| CN102882900A (en) * | 2011-07-11 | 2013-01-16 | 阿里巴巴集团控股有限公司 | Application and deployment method for large-scale server cluster and large-scale server cluster |
| CN103475649A (en) * | 2013-08-30 | 2013-12-25 | 中国科学院信息工程研究所 | Concealed anonymous communication method based on peer-to-peer network |
| CN105682089A (en) * | 2015-12-29 | 2016-06-15 | 北京交通大学 | Data protection method and device based on fragments |
| CN106059774A (en) * | 2016-05-31 | 2016-10-26 | 东南大学 | Data slice mixture privacy protection method based on cluster |
| CN106850351A (en) * | 2017-02-10 | 2017-06-13 | 北京浩瀚深度信息技术股份有限公司 | The approximate delay statistics method and device of http business under a kind of asymmetric link environment |
Non-Patent Citations (2)
| Title |
|---|
| ZHI-YUAN LI: "《Network Coding-based Mutual Anonymity Communication Protocol》", 《2012 IEEE 11TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS》 * |
| 王少辉等: "《基于重路由匿名通信系统的设计》", 《计算机科学》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115277054A (en) * | 2022-06-08 | 2022-11-01 | 北京邮电大学 | Directory service method and system in anonymous network |
| CN115277054B (en) * | 2022-06-08 | 2023-11-10 | 北京邮电大学 | Directory service method and system in anonymous network |
| CN115314491A (en) * | 2022-06-14 | 2022-11-08 | 北京邮电大学 | Directory service method and system of directory server cluster based on distributed structure |
| CN115314491B (en) * | 2022-06-14 | 2023-10-20 | 北京邮电大学 | Directory service method and system for directory server cluster based on distributed structure |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108390881A (en) | A kind of distribution high concurrent real-time messages method for pushing and system | |
| Tian et al. | A survey of key technologies for constructing network covert channel | |
| CN101599968B (en) | Reliable anonymous transmission method and system thereof | |
| CN103118139B (en) | Distributed information hides transmission system and transmission method thereof | |
| CN108494774A (en) | A kind of anti-link control attack method for reinforcing anonymous communication system safety | |
| CN106027555B (en) | A kind of method and system improving content distributing network safety using SDN technology | |
| Jesi et al. | Identifying malicious peers before it's too late: a decentralized secure peer sampling service | |
| Zamani et al. | Towards {Provably-Secure} Scalable Anonymous Broadcast | |
| de Araujo Zanella et al. | A reed-solomon based method to improve message delivery in delay tolerant networks | |
| Wang et al. | AC: an NDN-based blockchain network with erasure coding | |
| Halepoto et al. | Evaluation of multimedia streams in internet applications | |
| CN101702727B (en) | Method for defending against DDos in address disjunction mapping network | |
| Annessi et al. | To trust or not to trust: Data origin authentication for group communication in 5G networks | |
| Zhou et al. | Chaos-based delay-constrained green security communications for fog-enabled information-centric multimedia network | |
| Akbari et al. | Packet loss in peer-to-peer video streaming over the Internet | |
| Han et al. | Provide privacy for mobile p2p systems | |
| Huang et al. | An Improved μTESLA Protocol Based on Queuing Theory and Benaloh-Leichter SSS in WSNs | |
| Majhi et al. | Lightweight Cryptographic Techniques in 5G Software-Defined Internet of Things Networking | |
| Challal et al. | Efficient multicast source authentication using layered hash-chaining scheme | |
| Bhuvana Suganth et al. | Fault tolerance communication in mobile distributed networks | |
| Park et al. | Multi‐block FEC for reprogramming wireless sensor networks | |
| Du et al. | Strategies of network coding against nodes conspiracy attack | |
| Yu et al. | Anchor: An ndn-based blockchain network | |
| Lv et al. | Loss-tolerant bundle fragment authentication for space-based DTNs | |
| Chong et al. | Stepping-random code: a rateless erasure code for short-length messages |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180904 |
|
| RJ01 | Rejection of invention patent application after publication |