Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
S. Lee, D. Choi and Y. Choi proposed an improved countermeasure algorithm of RSA cryptosystem with Chinese Remainder Theorem to prevent fault attack. In this paper, we introduce new fault attacks on their countermeasure algorithm. Our analysis shows that the attacker can obtain an erroneous signature by injecting some faults during the RSA signing computation. Thus the attacker can recover the RSA...
A total k--coloring c of G is called k-neighbor sum distinguishing if for each edge uv, the sum of color of u and the colors of its incident edges is different from the sum of color of v and the colors of its incident edges. The smallest k is called the neighbor sum distinguishing total chromatic number. and first introduced this coloring and conjectured that the neighbor sum distinguishing total...
It is assumed that Japanese can analogize the meaning of original text if they read the original text according to the commonality of written expressions, such as the commonality of Kanji and Chinese characters in case of Chinese-Japanese translations. In this study, participants rewrote translated sentences while viewing simultaneously the original sentences written in Chinese and the translated...
The stream cipher Espresso was proposed by Elena Dubrova and Martin Hell in Cryptography and Communications in 2015, which employs the nonlinear feedback shift register (NLFSR) of Galois configuration as a main building block. This Galois configuration of NLFSR is transformed into its equivalent Fibonacci configuration, and then stream cipher Espresso is changed into the stream cipher Espresso variant...
Discovering the causal relationship from the observational data is a key problem in many scientific research fields. However, it is not easy to discovery the causal relationship by using general causal discovery methods, such as constraint based method or additive noise model, among large scale data, due to the curse of the dimension. Although some causal dividing frameworks are proposed to alleviate...
We combined various concepts with co-design, and experience design into a creative workshop that allows the engineers to see functional and morphological differences for a better robot design. Four different types of cards were used for the designer and the engineer to co-build their common ground in designing robots, in particular, emotional cards were of a value to indicate how robots would be perceived...
The paper proposes a new approach to model checking Chandy-Lamport Distributed Snapshot Algorithm (CLDSA). The essential of the approach is that CLDSA is specified as a meta-program in Maude such that the meta-program takes a specification of an underlying distributed system (UDS) and generates the specification of the UDS on which CLDSA is superimposed (UDS-CLDSA). To model check that a UDS-CLDSA...
One model for viral marketing is the positive influence. In this model, an inactive node is changed into active if and only if at least half of its neighbors are already in active state. The positive influence model can be viewed as a special case of a general threshold model, in which the threshold function at each node has value one if at least a certain fraction of neighbors are in active state,...
Traditional DDoS anti-spoofing scrubbers require dedicated middleboxes thus adding CAPEX, latency and complexity in the network. This paper starts by showing that the current SDN match-and-action model is rich enough to implement a collection of anti-spoofing methods. Secondly we develop and utilize advance methods for dynamic resource sharing to distribute the required mitigation resources over a...
The rapid growth of sensor-embedded smartphones has led to a new data sensing and collecting paradigm, known as crowdsensing. Many auction-based incentive mechanisms have been proposed to stimulate smartphone users to participate in crowdsensing. However, none of them have taken into consideration the Sybil attack where a user illegitimately pretends multiple identities to gain benefits. This attack...
Local business service systems (LBSS), such as Yelp and Dianping, play an essential role in making decisions like choosing a restaurant for our daily life. These systems heavily rely on individuals' voluntarily submitted reviews to build the reputation for nearby businesses. Unfortunately, the reviews expose users' private information such as visited places to the public and adversaries. Even worse,...
Crowdsourcing applications are vulnerable to malicious behaviors, posing serious threats to their adoption and large deployment. Based on the notion that the requestor (i.e., the crowdsourcer) can block malicious behaviors via leveraging the market power through task allocation and pricing, we propose two novel frameworks based on the mechanism design game theory (i.e., the reverse game theory). To...
Recent real-world attacks against Certification Authorities (CAs) and fraudulently issued certificates arouse the public to rethink the security of public key infrastructure for web-based connections. To distribute the trust of CAs, notaries, as an independent party, are introduced to record certificates, and a client can request an audit proof of certificates from notaries directly. However, there...
In today's always-connected world, we receive a large number of notifications on our mobile devices. These notifications cause interruptions, stress, and even impact users' lifestyle. To understand how users respond to notifications, we develop an application that monitors various features (e.g., importance) of the notifications, users' actions, and the level of users' engagement with the notifications...
When studying large-scale networks, including the Web and computer networks, it is first necessary to collect appropriate data. There is a large body of literature on web crawling and network sampling in general; however, this work typically assumes that a query on a node either reveals all edges incident to that node (in the case of an undirected graph) or all edges outgoing from that node (e.g.,...
Over the past few years, many major wireless providers restricted their unlimited data plans and replaced them with limited-size fixed-price data packages. While this could be perceived as a disadvantage for customers, it helps the cellular wireless providers to reduce the traffic intensity at their base stations. Then the lower traffic intensity leads to a better service quality and higher rates...
This paper addresses the problem of service function chaining in a network. Currently, problems of chaining services in a network (i.e., service function chaining) can be broadly categorised into middlebox placement in a network and packet steering through middleboxes. In this work, we propose a One Pass Packet Steering (OPPS) approach for use in multi-subscriber environments, with the aim of reducing...
This paper presents a method to automatically estimate parameters for density-based clustering based on data distribution. It also includes several techniques for visualizing the clusters over a map, useful for interactive data exploration. The proposed method enables parameter estimation to automatically adapt to multiple resolutions, allowing the clusters to be recomputed and visualized interactively...
Properties of discrete sets formed as an intersection of a convex polytope and a sphere (polyhedral-spherical sets, (PSS)), functions on such sets, and their applications in unconstrained combinatorial optimization are studied. One of the main features is an existence of differentiable convex extensions of objective functions, allowing to design exact and approximate algorithms based on polyhedral,...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.