Sciweavers

569 search results - page 93 / 114
» On the Security of the Digital Signature Algorithm
Sort
View
SACMAT
2006
ACM
14 years 2 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
DRMTICS
2005
Springer
14 years 2 months ago
A Vector Approach to Cryptography Implementation
The current deployment of Digital Right Management (DRM) schemes to distribute protected contents and rights is leading the way to massive use of sophisticated embedded cryptograph...
Jacques J. A. Fournier, Simon W. Moore
ICS
2010
Tsinghua U.
14 years 5 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
CCS
2007
ACM
14 years 2 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
13 years 10 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