Sciweavers

6137 search results - page 1099 / 1228
» Securing Collaborative Applications
Sort
View
WPES
2003
ACM
14 years 2 months ago
Analysis of privacy preserving random perturbation techniques: further explorations
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
Haimonti Dutta, Hillol Kargupta, Souptik Datta, Kr...
ASIACRYPT
2003
Springer
14 years 2 months ago
The Insecurity of Esign in Practical Implementations
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
Pierre-Alain Fouque, Nick Howgrave-Graham, Gwena&e...
CSFW
2002
IEEE
14 years 1 months ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe
ICPR
2002
IEEE
14 years 1 months ago
Biometric Hash based on Statistical Features of Online Signatures
This paper presents a new approach to generate biometric hash values based on statistical features in online signature signals. Whilst the output of typical online signature verif...
Claus Vielhauer, Ralf Steinmetz, Astrid Mayerh&oum...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
« Prev « First page 1099 / 1228 Last » Next »