Sciweavers

977 search results - page 100 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
IWSEC
2007
Springer
14 years 3 months ago
Run-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...
CSFW
2005
IEEE
14 years 2 months ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider
DEXAW
2003
IEEE
99views Database» more  DEXAW 2003»
14 years 2 months ago
Handling Identity in Peer-to-Peer Systems
Due to the limited number of available IP addresses most computers on the Internet use dynamic IP addresses which causes problems for applications that have to maintain routing ta...
Manfred Hauswirth, Anwitaman Datta, Karl Aberer
ACSAC
2000
IEEE
14 years 1 months ago
A Reliable, Scalable General-Purpose Certificate Store
Although there have been various proposals to build large-scale PKIs, there appears to be no research publicly available on the underlying certificate store which will be required...
Peter Gutmann
CSFW
1994
IEEE
14 years 1 months ago
One-Representative Safety Analysis in the Non-Monotonic Transform Model
We analyze the safety question for the Non-Monotonic Transform NMT model, an access control model that encompasses a wide variety of practical access control mechanisms. In genera...
Ravi S. Sandhu, Paul Ammann