The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Covert channel in network protocols has been an area absorbing great interests for many years in secret transmission. Recently, covert channels based on packet length have become a new preference among researchers in this field because of their excellent performance in simulating statistical features of network packets in real world. However, few approaches which can embed secret information with...
Time synchronization is very important in the IEEE802.15.4e network which aim to industrial automation applications. It enabled high end-to-end reliability and low power wireless networking. If an adversary launches time synchronization attacks to the IEEE802.15.4e networks, the whole network communications will be paralyzed. In this paper, we present two types of attacks: 1) ASN and 2) time synchronization...
Time synchronization is very important in many sensor network applications especially in industrial wireless network. If an adversary launches time synchronization attacks to the industrial wireless networks, the whole network communications will be paralyzed. However, the time synchronization is not insufficient to be protected in the current industrial wireless standards which based on IEEE802.15...
Secure multi-party computation has been a research focus for more than two decades. The convex hulls problem is a special case of secure multi-party computation. However, the precise convex hulls will certainly expose every vertex and even bring about unfairness. As a result, the practical approximate convex hulls are in need. In this paper, we summarize and discuss the convex hulls problem, and then...
Privacy-preserving data mining aims at securely extracting knowledge from two or more parties' private data. Secure multi-party computation is the paramount approach to it. In this paper, we study privacy-preserving add and multiply exchanging technology and present three new different approaches to privacy-preserving add to multiply protocol. After that, we analyze and compare the three different...
Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, current schemes will inevitably disclose the points on the vertices. In this paper, we proposed the concept of privacy-preserving approximate convex...
Secure multi-party computation has been a hot research topic of cryptograhy for about two decades, and the convex hulls problem is a special case of it. However, the precise convex hulls will certainly expose all vertexes and even bring about unfairness. Therefore the practical approximate convex hulls are in need. In this paper, we summarize and discuss the convex hulls problem, and then we present...
Convex hulls problem is a special case of privacy-preserving geometry problem in the inquiry of secure multi-party computation. In the past, only in two-dimensional space privacy-preserving convex hulls have been investigated, and there is little focus in the three-dimensional space. However, three-dimensional privacy-preserving convex hulls can be applied in many fields, such as researching and exploration...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.