Sciweavers

250 search results - page 48 / 50
» Improving the Exact Security of Digital Signature Schemes
Sort
View
CIT
2006
Springer
13 years 9 months ago
A new collision resistant hash function based on optimum dimensionality reduction using Walsh-Hadamard transform
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
Barzan Mozafari, Mohammad Hasan Savoji
CCS
2008
ACM
13 years 7 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
CCS
2001
ACM
13 years 9 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
13 years 7 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
ACSAC
2003
IEEE
13 years 9 months ago
Bayesian Event Classification for Intrusion Detection
Intrusion detection systems (IDSs) attempt to identify attacks by comparing collected data to predefined signatures known to be malicious (misuse-based IDSs) or to a model of lega...
Christopher Krügel, Darren Mutz, William K. R...