6137 search results - page 995 / 1228 » Securing Collaborative Applications |
109
click to vote
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
137
Voted
ISSRE
2002
IEEE
15 years 7 months ago
2002
IEEE
Improving the dependability of computer systems is increasingly important as more and more of our lives depend on the availability of such systems. Wrapping dynamic link libraries...
115
Voted
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
111
Voted
FPL
2009
Springer
15 years 7 months ago
2009
Springer
A silicon Physical Unclonable Function (PUF), which is a die-unique challenge-response function, is an emerging hardware primitive for secure applications. It exploits manufacturi...
104
Voted
INDOCRYPT
2001
Springer
15 years 6 months ago
2001
Springer
We propose a new anonymous fingerprinting scheme using Okamoto-Uchiyama cryptosystem[1]. In the previous schemes[2]-[4] the enciphering rate is so small that it seems very difficu...