Sciweavers

6137 search results - page 478 / 1228
» Securing Collaborative Applications
Sort
View
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
16 years 9 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
ACSAC
1998
IEEE
15 years 12 months ago
Application-Level Isolation to Cope with Malicious Database Users
System protection mechanisms such as access controls can be fooled by authorized but malicious users, masqueraders, and misfeasors. Intrusion detection techniques are therefore us...
Sushil Jajodia, Peng Liu, Catherine D. McCollum
TDSC
2010
119views more  TDSC 2010»
15 years 2 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
16 years 1 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
Hung-Min Sun, Cheng-Ta Yang
ICISC
2000
126views Cryptology» more  ICISC 2000»
15 years 9 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...