Sciweavers

5639 search results - page 593 / 1128
» Timed Abstract Non-interference
Sort
View
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
APWEB
2008
Springer
15 years 8 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li
ARC
2008
Springer
89views Hardware» more  ARC 2008»
15 years 8 months ago
A Networked, Lightweight and Partially Reconfigurable Platform
Abstract. In this paper we present a networked lightweight and partially reconfigurable platform assisted by a remote bitstreams server. We propose a software and hardware architec...
Pierre Bomel, Guy Gogniat, Jean-Philippe Diguet
ASIACRYPT
2008
Springer
15 years 8 months ago
A New Attack on the LEX Stream Cipher
Abstract. In [6], Biryukov presented a new methodology of stream cipher design, called leak extraction. The stream cipher LEX, based on this methodology and on the AES block cipher...
Orr Dunkelman, Nathan Keller
ASIACRYPT
2008
Springer
15 years 8 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim