1843 search results - page 108 / 369 » Securing Class Initialization |
154
click to vote
CRYPTO
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
148
click to vote
LISA
2008
15 years 7 months ago
2008
With the increasing adoption of mobile computing devices that carry confidential data, organizations need to secure data in an ever-changing environment. Critical organizational d...
194
Voted
IJNSEC
2007
15 years 4 months ago
2007
When the network is homogeneous, choosing the cipher type for a packet telephony application is simple. It is clear that stream ciphers perform better than block ciphers over land...
137
Voted
DFT
2007
IEEE
15 years 11 months ago
2007
IEEE
We introduce a reliable memory system that can tolerate multiple transient errors in the memory words as well as transient errors in the encoder and decoder (corrector) circuitry....
133
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...