860 search results - page 31 / 172 » Completeness in two-party secure computation: a computationa... |
162
click to vote
CHIMIT
2007
ACM
15 years 10 months ago
2007
ACM
End users are often cast as the weak link in computer security; they fall victim to social engineering and tend to know very little about security technology and policies. This pa...
143
Voted
ACISP
2005
Springer
15 years 11 months ago
2005
Springer
We deal with a divisor class halving algorithm on hyperelliptic curve cryptosystems (HECC), which can be used for scalar multiplication, instead of a doubling algorithm. It is not ...
161
click to vote
NSPW
2004
ACM
15 years 11 months ago
2004
ACM
Over the past years, the computing industry has started various initiatives announced to increase computer security by means of new hardware architectures. The most notable effort...
197
click to vote
SIGMETRICS
2006
ACM
16 years 23 hour ago
2006
ACM
Despite the existence of several secure BGP routing protocols, there has been little progress to date on actual adoption. Although feasibility for widespread adoption remains the ...
181
click to vote
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...