Sciweavers

30 search results - page 2 / 6
» Computationally Secure Pattern Matching in the Presence of M...
Sort
View
SIAMCOMP
2011
13 years 6 days ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
13 years 10 months ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
WEBI
2009
Springer
13 years 12 months ago
Data Mining for Malicious Code Detection and Security Applications
: Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques....
Bhavani M. Thuraisingham
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 6 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
ASIACRYPT
2007
Springer
13 years 11 months ago
Two-Party Computing with Encrypted Data
We consider a new model for online secure computation on encrypted inputs in the presence of malicious adversaries. The inputs are independent of the circuit computed in the sense ...
Seung Geol Choi, Ariel Elbaz, Ari Juels, Tal Malki...