Sciweavers

14824 search results - page 2278 / 2965
» Security - Introduction
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
15 years 10 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
CTRSA
2006
Springer
129views Cryptology» more  CTRSA 2006»
15 years 10 months ago
An Optimal Non-interactive Message Authentication Protocol
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...
Sylvain Pasini, Serge Vaudenay
190
Voted
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
15 years 10 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
DASC
2006
IEEE
15 years 10 months ago
Automated Caching of Behavioral Patterns for Efficient Run-Time Monitoring
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
Natalia Stakhanova, Samik Basu, Robyn R. Lutz, Joh...
« Prev « First page 2278 / 2965 Last » Next »