Sciweavers

42 search results - page 3 / 9
» Practical Secure Evaluation of Semi-private Functions
Sort
View
OOPSLA
1999
Springer
13 years 10 months ago
Practical Experience with an Application Extractor for Java
Java programs are routinely transmitted over low-bandwidth network connections as compressed class le archives (i.e., zip les and jar les). Since archive size is directly proporti...
Frank Tip, Chris Laffra, Peter F. Sweeney, David S...
ACSAC
2010
IEEE
13 years 4 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
ACSAC
2008
IEEE
13 years 8 months ago
Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage
Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Mea...
Paul F. Farrell Jr., Simson L. Garfinkel, Douglas ...
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
13 years 8 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
14 years 13 days ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak