Sciweavers

264 search results - page 23 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
142
Voted
ACSAC
2010
IEEE
15 years 1 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
153
Voted
WETICE
2003
IEEE
15 years 8 months ago
Design and Implementation of Virtual Private Services
Large scale distributed applications such as electronic commerce and online marketplaces combine network access with multiple storage and computational elements. The distributed r...
Sotiris Ioannidis, Steven M. Bellovin, John Ioanni...
120
Voted
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
15 years 7 months ago
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
Michael Szydlo, Yiqun Lisa Yin
129
Voted
ISW
2009
Springer
15 years 10 months ago
Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
The recently started SHA-3 competition in order to find a new secure hash standard and thus a replacement for SHA-1/SHA-2 has attracted a lot of interest in the academic world as ...
Mario Lamberger, Florian Mendel
132
Voted
EUROCRYPT
2003
Springer
15 years 8 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell