Sciweavers

124 search results - page 2 / 25
» Randomly supported independence and resistance
Sort
View
SP
2005
IEEE
183views Security Privacy» more  SP 2005»
13 years 11 months ago
A Generic Attack on Checksumming-Based Software Tamper Resistance
Self-checking software tamper resistance mechanisms employing checksums, including advanced systems as recently proposed by Chang and Atallah (2002) and Horne et al. (2002), have ...
Glenn Wurster, Paul C. van Oorschot, Anil Somayaji
FOCS
2008
IEEE
13 years 11 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
JCP
2007
148views more  JCP 2007»
13 years 5 months ago
P3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
Iman Saleh, Mohamed Eltoweissy
FM
2006
Springer
127views Formal Methods» more  FM 2006»
13 years 9 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
IEICET
2008
147views more  IEICET 2008»
13 years 5 months ago
Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with a...
Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul ...