5476 search results - page 263 / 1096 » Resettably Secure Computation |
187
click to vote
PKC
2001
Springer
15 years 11 months ago
2001
Springer
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
177
click to vote
ECOOPW
1999
Springer
15 years 11 months ago
1999
Springer
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
190
click to vote
SEC
2003
15 years 8 months ago
2003
For the emerging ambient environments, in which interconnected intelligent devices will surround us to increase the comfort of our lives, fault tolerance and security are of paramo...
186
click to vote
ISVC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Intrusion detection systems gather large quantities of host and network information in an attempt to detect and respond to attacks against an organization. The widely var...
183
click to vote
FC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...